Predicate diagrams for the verification of reactive systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1945 LNCS, Issue , 2000, Pages 380-397

  Cansell, Dominique ^a   Méry, Dominique ^a   Merz, Stephan ^b  

^a LORIA   (France)

^b UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; FORMAL METHODS; MODEL CHECKING; SPECIFICATIONS;

ABSTRACT INTERPRETATION TECHNIQUES; FINITE-STATE ABSTRACTION; INFINITE STATE; LIVENESS PROPERTIES; PREDICATE DIAGRAMS; PROOF OBLIGATIONS; REACTIVE SYSTEM;

GRAPHIC METHODS;

EID: 84894539540     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-40911-4_22     Document Type: Conference Paper

References (29)

1. J.-R. Abrial. The B book - Assigning Programs to Meanings. Cambridge University Press, 1996.
2. S. Bensalem, V. Ganesh, Y. Lakhnech, C. Mufioz, S. Owre, H. RueB, 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.
3. S. Bensalem, Y. Lakhnech, and S. Owre. Computing abstractions of infinite state systems automatically and compositional I y. In Conference on Computer-Aided Verification (CAV'98), volume 1427 of Lecture Notes in Computer Science, pages 319-331. Springer-Verlag, 1998.
4. D. Cansell and D. Mery. 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.
5. R. Cousot. Fondements des me thodes de preuve d'invariance et de fatal ite deprogrammes paralleles. PhD thesis, INPL, novembre 1985. Doctorates-Sciences.
6. D. Dams, O. Grumberg, and R. Gerth. Abstract interpretation of reactive systems: Abstraction preserving ctl, ctl and ctl . In Emst-Riidiger Olderog, editor, Programming Concepts, Methods and Calculi (PROCOMET'94), pages 561-581. IFIP Transaction, 1994.
7. L. de Alfaro and Z. Manna. Temporal verification by diagram transformation. In R. Alur and T.A. Henzinger, editors, CAV96, LNCS 1102, pages 287-299. Springer-Verlag, jul. 1996.
8. 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.
9. S. Graf and H. Sai'di. 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.
10. P. Granger. Static analysis of arithmetical congruences. IJCM, 30:165-190, 1989.
11. Hermann Hellwagner. Scalable readers/writers synchronization on shared-memory machines. Technical report, Siemens AG, ZFE ST SN 2, 1993.
12. G. Holzmann. The SPIN model checker. IEEE Trans, on software engineering, 16(5): 1512- 1542, May 1997.
13. Y. Kestcn and A. Pnueli. Modularization and abstraction: The keys to practical formal veri-fication. In 23rd Intl. Symp. Mathematical Foundations of Computer Science, volume 1450 of Lecture Notes in Computer Science, pages 54-71. Springer-Verlag, 1998.
14. Y. Kesten and A. Pnueli. Verifying liveness by augmented abstraction. In A. Flum and M. Rodriguez-Artalejo, editors, CSL'99, LNCS 1683, pages 141-156. Springer-Verlag, sep. 1999.
15. F. Kroger. Temporal logics of Programs, volume 8 of EATCS Monographs on Theoretical Computer Science. Springer-Verlag, 1987. ISNB 3-540-17030-8.
16. L. Lamport. A new solution of dijkstra's concurent programming problem. Communications of the ACM, 17(8):435-455, May 1974.
17. L. Lamport. A temporal logic of actions. Transactions On Programming Languages and Systems, 16(3):872-923, May 1994.
18. L. Lamport. TLA in pictures. IEEE Transactions on Software Engineering, 21(9):768-775, September 1995.
19. L. Lamport. The operators of TLA+. Technical report-WEB TLA, Digital Equipment Corporation, 1996. http://www.research.digital.com/SRC/tla/papers. html.
20. L. Lamport. The module structure of tla+. Technical report-WEB TLA, Digital Equipment Corporation. 1998. http://www.research.digital.com/SRC/tla/ papers.html.
21. Z. Manna, A. Anuchitanukul, N. Bjorner, A. Browne, E. Chang, M. Colon, L. de Alfaro, H. Devarajan, H. Sipma, and T. Uribc. Step : The Stanford theorem prover. Technical report, Department of Computer Science, Stanford University, June 1994.
22. 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.
23. Z. Manna, A. Browne, H.B. Spima, and T.E. Uribe. Visual abstractions for temporal verifi-cation. In A. Haeberer, editor, AMAST'98, LNCS 1548, pages 28-41. Springer-Verlag, dec. 1998.
24. Z. Manna and A. Pnueli. The temporal logics of reactive and concurrent systems - Specifi-cation. Springer-Verlag, 1992.
25. 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.
26. S. Merz. On the verification of a self-stabilizing algorithm. Available at http://www.pst.informatik.uni-muenchen.dermerz/papers/dijkstra.ps.gz 1998.
27. S. Owickiand, L. Lamport. Proving liveness properties of concurrent programs. Transactions On Programming Languages and Systems, 4(3):455-495, July 1982.
28. H. Sai'di and N. Shankar. Abstract and model check while you prove. In N. Halbwachs and D. Pelcd, editors, Conference on Computer-Aided Verification (CAV'99), volume 1633 of Lecture Notes in Computer Science, pages 443-454, Trento, Italy, 1999. Springer-Verlag.
29. STERIA - Technologies de ITnformation, Aix-en-Provence (F). Atelier B, Manuel Utilisateur, 1998. Version 3.5.