Abstract
Static verification offers design-time support for guaranteeing that an interaction model will meet, during the execution, certain desired properties, enabling the early identification of errors and undesired situations. It is therefore exploited a-priori, before the execution. The positive outcome of static verification can be used as a proof attesting the trustworthiness and reliability of the developed model.
This chapter provides an introductory characterization of the static verification of declarative open interaction models, specified using the ConDec notation. We discuss the desiderata that a static verification technology must accomplish, and then focus on two specific problems:
-
static verification of properties, carried out on a single model;
-
static verification of a composition of local models, and conformance checking of a set of local models with a global (choreographic) model.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Montali, M. (2010). Static Verification of Declarative Open Interaction Models. In: Specification and Verification of Declarative Open Interaction Models. Lecture Notes in Business Information Processing, vol 56. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14538-4_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-14538-4_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14537-7
Online ISBN: 978-3-642-14538-4
eBook Packages: Computer ScienceComputer Science (R0)