Model checking guided abstraction and analysis

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

Volumn 1824 LNCS, Issue , 2000, Pages 377-396

  Saïdi, Hassen ^a  

^a SRI INTERNATIONAL   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; STATIC ANALYSIS;

ABSTRACT SYSTEMS; BOOLEAN ABSTRACTIONS; CONCRETE DOMAINS; DECISION PROCEDURE; INFINITE STATE SYSTEMS; STATE EXPLORATION;

MODEL CHECKING;

EID: 84906076909     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45099-3_20     Document Type: Conference Paper

References (25)

1. S. Bensalem, Y. Lakhnech, and S. Owre. Computing abstracti ons of infinite state systems compositionally and automatically. In Proceedings of the 9th Conference on Computer-Aided Verification, CAV'98, LNCS. Springer Verlag, June 1998
2. S. Bensalem, Y. Lakhnech, and H assen Sä ?di. Powerful techniques for the automatic generation of invariants. In Rajeev Alur and Thomas A. Henzinger, editors, Computer-Aided Verification, CAV '96, number 1102 in Lecture Notes in Computer Science, pages 323-335, New Brun swick, NJ, July/August 1996. Springer-Verlag
3. Nikolaj Bjorner, Anca Browne, and Zohar Manna. Automatic Generation of Invariants and Intermediate Assertions. Theoretical Computer Science, 1997.
4. K. Mani Chandy and Jayadev Misra. Parallel Program Design. Addison-Wesley, Reading, Massachusetts, 1988
5. Ching-Tsun Chou. Simple proof techniques for property preservation via simulation. Information Processing Letters, 60(3):129-134, 1996
6. E.M. Clarke, O. Grumberg, and D.E. Long. Model checking and abstraction. ACM Transactions on Programming Languages and Systems, 16(5):1512-1542, September 1994
7. Michael Colon and Thomas Uribe. Generating finite-state abstractions of reactive systems using decision procedures. In Proceedings of the 9th C onference on Computer-Aided Verification, CAV'98, LNCS. Springer Verlag, June 1998
8. P. Cousot and R. Cousot. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In 4th POPL, January 1977
9. D. Dams. Abstract interpretation and partition refinement for model checking. PhD thesis, Technical University of Eindhoven, July 1996
10. D. Dams, O. Grumberg, and R. Gerth. A bstract interpretation of reactive systems: Abstractions preserving CTL*, CTL*and CTL*. In Ernst-Rudiger Olderog, editor, IFIP Conference PROCOMET'94, pages 561-581, 1994
11. S. Das, D. L. Dill, and S. Par k. Experience with predicate abstraction. Lecture Notes in Computer Science, 1633:160, 1999
12. J. Dingel and Th. Filkorn. Model checking for infinite state systems using data abstraction, assumption-c ommitment style reasoning and theorem proving. In Proc. of 7th CAV 95, Lìege. LNCS 939, Springer Verlag, 1995
13. S. Graf. Characterization of a sequentially consistent memory and verification of a cache memory by abstraction. Distributed Computing, 1995.
14. S. Graf, and H. Sä?di. Construction of abstract state graphs with PVS, Conference on Computer Aided Verification CAV'97, LNCS 1254, Springer,Verlag, 1997.
15. J.F. Groote and J. van de Pol. A bounded retransmission protocol for large data packets. Technical report, Department of Philosophy, October 1993
16. Klaus Havelund and N. Shankar. Experiments in theorem proving and model checking for protocol verification. In Formal Methods Europe FME '96, number 1051 in Lecture Notes in Computer Science, pages 662-681, Oxford, UK, March 1996. Springer-Verlag
17. L. Helmink, M.P.A. Sellink, and F.W. Vaandrager. Proof-checking a data link protocol. Technical report, Department of Philosophy, Utrech University, The Netherlands, March 1994
18. Bertrand Jeannet, Nicolas Halbwachs, and Pascal Raymond. Dynamic partitioning in analyses of numerical properties. In Agostino Cortesi and Gilberto Fiĺe, editors, Static Analysis, volume 1694 of Lecture Notes in Computer Science , pages 39-50. Springer, 1999
19. R.P. Kurshan. Computer-aided verification of coordinating processes, the automata theoretic approach. Princeton Series in Computer Science. Princeton University Press, 1994
20. David Lesens and Hassen Sa ̈?di. Automatic verification of parameterized networks of processes by abstraction. In Faron Moller, editor, 2nd International Workshop on Verification of Infinite State Systems: Inf inity '97, volume 9 of Electronic Notes in Theoretical Computer Science, Bologna, Italy, July 1997. Elsevier
21. C. Loiseaux, S. Graf, J. Sifakis, A. Bouajjani, and S. Bensalem. Property prese rving abstractions for the verification of concurrent systems. Formal Methods in System Design, Vol 6, Iss 1, January 1995, 1995
22. Zohar Manna and Amir Pnueli. The Temporal Verification of Reacti ve Systems: Safety. Springer-Verlag, 1995
23. S. Owre, N. Shankar, and J. M. Rushby. A tutorial on specification and verification using pvs. Technical report, Computer Science Laboratory, SRI International, February 1993
24. H. Sä ?di. Modular and incremental analysis of concurrent software systems. In 14th IEEE International Conference on Automated Software Engineering, pages 92-101, Cocoa Beach, FL, October 1999. IEEE Computer Society Press. 378, 393.
25. Hassen Sä ?di and Natarajan Shankar. Abstract and model check while you prove. In Computer-Aided Verification, CAV '99, Trento, Italy, July 1999