Abstract
This chapter introduces two abductive proof procedures for reasoning upon SCIFF (and therefore also CLIMB) specifications: sciff and g-sciff.
The sciff proof procedure checks whether an execution trace complies with a SCIFF specification, providing a concrete operational framework for:
-
generating positive and negative expectations starting from a trace and a specification;
-
checking whether the generated expectations are fulfilled by the actual occurring events (hypotheses confirmation step).
sciff is able reason upon a complete execution trace, or upon a growing trace, by dynamically acquiring and processing occurring events as they happen.
This is a preview of subscription content, log in via an institution to check access.
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). Proof Procedures. 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_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-14538-4_9
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)