Abstract
We define a class of diagrams that represent abstractions of—possibly infinite-state—reactive systems described by specifications written in temporal logic. Our diagrams are intended as the basis for the verification of both safety and liveness properties of such systems. Non-temporal proof obligations establish the correspondence between the original specification and the diagram, whereas model checking can be used to verify properties over finite-state abstractions.We describe the use of abstract interpretation techniques to generate proof diagrams from a given specification and user-defined predicates that represent sets of states.
This work has been partially supported by a PROCOPE grant from EGIDE and DAAD.
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
J.-R. Abrial. The B book — Assigning Programs to Meanings. Cambridge University Press, 1996.
S. Bensalem, V. Ganesh, Y. Lakhnech, C. Muñoz, S. Owre, H. Rueß, J. Rushby, V. Rusu, H. Saidi, N. Shankar, E. Singerman, and A. Tiwari. An overview of SAL. In 5th Langley Formal Methods Workshop, 2000. to appear.
S. Bensalem, Y. Lakhnech, and S. Owre. Computing abstractions of infinite state systems automatically and compositionally. In Conference on Computer-Aided Verification (CAV’98), volume 1427 of Lecture Notes in Computer Science, pages 319–331. Springer-Verlag, 1998.
D. Cansell and D. Méry. Abstract animator for temporal specifications Application to TLA. In Gilberto File’ and Agostino Cortesi, editors, SAS’99 Static Analysis Symposium, Venise, Italie, LNCS 1694, Heidelberg, September 1999. Springer Verlag.
R. Cousot. Fondements des mé thodes de preuve d’invariance et de fatalité de programmes parallè les. PhD thesis, INPL, novembre 1985. Doctorat-ès-Sciences.
D. Dams, O. Grumberg, and R. Gerth. Abstract interpretation of reactive systems: Abstraction preserving ∀ctŀ, ∃ctŀ and ctŀ. In Ernst-Rüdiger Olderog, editor, Programming Concepts, Methods and Calculi (PROCOMET’94), pages 561–581. IFIP Transaction, 1994.
L. de Alfaro and Z. Manna. Temporal verification by diagram transformation. In R. Alur and T. A. Henzinger, editors, CAV’96, LNCS 1102, pages 287–299. Springer-Verlag, jul. 1996.
D. Detlefs, G. Nelson, and J. Saxe. Simplify: the ESC theorem prover. Technical report, Systems Research Center, Digital Equipment Corporation, Palo Alto, CA, November 1996.
S. Graf and H. Saidi. Construction of abstract state graphs with PVS. In Conference on Computer-Aided Verification (CAV’97), volume 1254 of Lecture Notes in Computer Science. Springer-Verlag, 1997.
P. Granger. Static analysis of arithmetical congruences. IJCM, 30:165–190, 1989.
Hermann Hellwagner. Scalable readers/writers synchronization on shared-memory machines. Technical report, Siemens AG, ZFE ST SN 2, 1993.
G. Holzmann. The SPIN model checker. IEEE Trans. on software engineering, 16(5):1512–1542, May 1997.
Y. Kesten and A. Pnueli. Modularization and abstraction: The keys to practical formal verification. In 23rd Intl. Symp. Mathematical Foundations of Computer Science, volume 1450 of Lecture Notes in Computer Science, pages 54–71. Springer-Verlag, 1998.
Y. Kesten and A. Pnueli. Verifying liveness by augmented abstraction. In A. Flum and M. Rodríguez-Artalejo, editors, CSL’99, LNCS 1683, pages 141–156. Springer-Verlag, sep. 1999.
F. Kröger. Temporal Logics of Programs, volume 8 of EATCS Monographs on Theoretical Computer Science. Springer-Verlag, 1987. ISNB 3-540-17030-8.
L. Lamport. A new solution of dijkstra’s concurent programming problem. Communications of the ACM, 17(8):435–455, May 1974.
L. Lamport. A temporal logic of actions. Transactions On Programming Languages and Systems, 16(3):872–923, May 1994.
L. Lamport. TLA in pictures. IEEE Transactions on Software Engineering, 21(9):768–775, September 1995.
L. Lamport. The operators of TLA+. Technical report-WEB TLA, Digital Equipment Corporation, 1996. http://www.research.digital.com/SRC/tla/papers.html.
L. Lamport. The module structure of tla+. Technical report-WEB TLA, Digital Equipment Corporation, 1998. http://www.research.digital.com/SRC/tla/papers.html.
Z. Manna, A. Anuchitanukul, N. Bjorner, A. Browne, E. Chang, M. Colon, L. de Alfaro, H. Devarajan, H. Sipma, and T. Uribe. Step: the stanford theorem prover. Technical report, Department of Computer Science, Stanford University, June 1994.
Z. Manna, A. Browne, H. B. Spima, and T. E. Uribe. Tools and algorithms for construction and analysis of systems. In Brinksma, editor, TACAS’ 97, LNCS 1217, pages 334–350. Springer-Verlag, apr. 1997.
Z. Manna, A. Browne, H. B. Spima, and T. E. Uribe. Visual abstractions for temporal verification. In A. Haeberer, editor, AMAST’98, LNCS 1548, pages 28–41. Springer-Verlag, dec. 1998.
Z. Manna and A. Pnueli. The temporal logics of reactive and concurrent systems-Specification. Springer-Verlag, 1992.
S. Merz. Rules for abstraction. In R. K. Shyamasundar and K. Ueda, editors, Advances in Computing Science—ASIAN’97, volume 1345 of Lecture Notes in Computer Science, pages 32–45, Kathmandu, Nepal, Digital Equipment Corporation 1997. Springer-Verlag.
S. Merz. On the verification of a self-stabilizing algorithm. Available at http://www.pst.informatik.uni-muenchen.de/~merz/papers/dijkstra.ps.gz, 1998.
S. Owicki and L. Lamport. Proving liveness properties of concurrent programs. Transactions On Programming Languages and Systems, 4(3):455–495, July 1982.
H. Saidi and N. Shankar. Abstract and model check while you prove. In N. Halbwachs and D. Peled, editors, Conference on Computer-Aided Verification (CAV’99), volume 1633of Lecture Notes in Computer Science, pages 443–454, Trento, Italy, 1999. Springer-Verlag.
STERIA-Technologies de l’Information,Aix-en-Provence (F).Atelier B, Manuel Utilisateur, 1998. Version 3.5.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cansell, D., Méry, D., Merz, S. (2000). Predicate Diagrams for the Verification of Reactive Systems. In: Grieskamp, W., Santen, T., Stoddart, B. (eds) Integrated Formal Methods. IFM 2000. Lecture Notes in Computer Science, vol 1945. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-40911-4_22
Download citation
DOI: https://doi.org/10.1007/3-540-40911-4_22
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41196-3
Online ISBN: 978-3-540-40911-3
eBook Packages: Springer Book Archive