Abstract
We propose a mechanised strategy to turn an infinite CSP Z process (formed of CSP and Z constructs) into one suitable for model checking. This strategy integrates two theories which allow us to consider the infiniteness of CSP Z as two separate problems: data independence for handling the behavioural aspect and abstract interpretation for handling the data structure aspect. A distinguishing feature of our approach to abstract interpretation is the generation of the abstract domains based on a symbolic execution of the process.
This work was financially supported by CNPq grant 143720/98-8.
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.
References
A. Mota. Model checking CSP Z: Techniques to Overcome State Explosion. PhD thesis, Universidade Federal de Pernambuco, 2002.
A. Mota and A. Sampaio. Mo del-Checking CSP-Z. In Proceedings of the European Joint Conference on Theory and Practice of Software, volume 1382 of LNCS, pages 205–220. Springer-Verlag, 1998.
A. Mota and A. Sampaio. Model-Checking CSP-Z: Strategy, Tool Support and Industrial Application. Science of Computer Programming, 40:59–96, 2001.
A.W. Roscoe. The Theory and Practice of Concurrency. Prentice Hall, 1998.
B. Boigelot, S. Rassart, and P. Wolper. On the Expressiveness of Real and Integer Arithmetic Automata (Extended Abstract). LNCS, 1443:01–52, 1999.
C.A.R. Hoare. Communicating Sequential Processes. Prentice-Hall, 1985.
C. Fischer. Combining CSP and Z. Technical report, Univ. Oldenburg, 1996.
C. Fischer. Combination and Implementation of Processes and Data: from CSP-OZ to Java. PhD thesis, Fachbereich Informatik Universität Oldenburg, 2000.
C. Loiseaux, S. Graf, J. Sifakis, A. Bouajjani, and S. Bensalem. Property Preserving Abstractions for the Verification of Concurrent Systems. In Formal Methods in System Design, volume 6, pages 11–44. Kluwer Academic Publishers, Boston, 1995.
E.M. Clarke, O. Grumberg, and D.A. Peled. Model Checking. The MIT Press, 1999.
J.A.C.F. Neriet al. SACI-1: A cost-effective microssatellite bus for multiple mission payloads. Technical report, Instituto Nacional de Pesquisas Espaciais-INPE, 1995.
M. Goldsmith et al. FDR: User Manual and Tutorial, version 2.77. Formal Systems (Europe) Ltd, August 2001.
H. Wehrheim. Data Abstraction for CSP-OZ. In J. Woodcock and J. Wing, editors, FM’99 World Congress on Formal Methods. LNCS 1709, Springer, 1999.
H. Wehrheim. Data Abstraction Techniques in the Validation of CSP-OZ Sp. In Formal Aspects of Computing, volume 12, pages 147–164, 2000.
K. Laster and O. Grumberg. Modular model checking of software. In Tools and Algorithms for the Construction and Analysis of Systems, number 1382 in LNCS, pages 20–35, 1998.
K. Stahl, K. Baukus, Y. Lakhneich, and M. Steffen. Divide, Abstract, and Model Check. SPIN, pages 57–76, 1999.
M. Huhn, P. Niebert, and F. Wallner. Verification based on local states. In Tools and Algorithms for the Construction and Analysis of Systems, number 1382 in LNCS, pages 36–51, 1998.
M. Kaufmann and J. Moore. An Industrial Strength Theorem Prover for a Logic Based on Common Lisp. IEEE Trans. on Software Engineering, 23(4):203–213, 1997.
M. Saaltink. The Z-Eves System. In ZUM’97: The Z Formal Specification Notation. LNCS 1212, Springer, 1997.
M. Spivey. The Z Notation: A Reference Manual. Prentice-Hall International, 2nd edition, 1992.
P. Cousot and R. Cousot. Systematic design of program analysis frameworks. In Conference Record of the 6th ACM Symp. on Principles of Programming Languages (POPL’79), pages 269–282. ACM Press, New York, 1979.
P. Cousot and R. Cousot. Abstract interpretation frameworks. J. Logic. and Comp., 2(4):511–547, 1992.
P. Wolper. Expressing interesting properties of programs in propositional temporal logic (extended abstract). In Proc. 13th ACM Symposium on Principles of Programming Languages, pages 184–193, 1986.
R. Cleaveland and J. Riely. Testing-based abstractions for value-passing systems. In J. Parrow B. Jonsson, editor, CONCUR’94, volume 836, pages 417–432. Springer-Verlag Berlin, 1994.
R. Giacobazzi and F. Ranzato. Making abstract interpretations complete. Journal of the ACM, 47(2):361–416, 2000.
R. Lazić. A semantic study of data-independence with applications to the mechanical verification of concurrent systems. PhD thesis, Oxford University, 1999.
S.A. Cook and D.G. Mitchell. Satisfiability Problem: Theory and Applications. In Discrete Mathematics and Theoretical Computer Science. AMS, 1997.
S. Liu. Verifying Consistency and Validity of Formal Specifications by Testing. In FM’99-Formal Methods, pages 896–914. LNCS 1708, 1999.
S. Owre, S. Rajan, J.M. Rushby, N. Shankar, and M.K. Srivas. PVS: Combining Specification, Proof Checking, and Model Checking. In Rajeev Alur and Thomas A. Henzinger, editors, Computer-Aided Verification, CAV’96, volume 1102 of LNCS, pages 411–414, New Brunswick, NJ, July/August 1996. Springer-Verlag.
Y. Kesten, A. Klein, A. Pnueli, and G. Raanan. A Perfecto Verification: Combining Model Checking with Deductive Analysis to Verify Real-Life Software. In J.M. Wing, J. Woodcock and J. Davies, editor, FM’99-Formal Methods, volume 1 of LNCS 1708, pages 173–194. Springer-Verlag, 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mota, A., Borba, P., Sampaio, A. (2002). Mechanical Abstraction of CSP Z Processes. In: Eriksson, LH., Lindsay, P.A. (eds) FME 2002:Formal Methods—Getting IT Right. FME 2002. Lecture Notes in Computer Science, vol 2391. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45614-7_10
Download citation
DOI: https://doi.org/10.1007/3-540-45614-7_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43928-8
Online ISBN: 978-3-540-45614-8
eBook Packages: Springer Book Archive