Abstract and model check while you prove

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

Volumn 1633, Issue , 1999, Pages 443-454

  Saïdi, Hassen ^a   Shankar, Natarajan ^a  

^a SRI INTERNATIONAL   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; CALCULATIONS; COMPUTER AIDED ANALYSIS; TEMPORAL LOGIC;

AUTOMATIC REFINEMENT; BOOLEAN ABSTRACTIONS; BOOLEAN VARIABLES; FINITE STATE SYSTEMS; INFINITE STATE SYSTEMS; MU-CALCULUS; PROOF RULES; PROOF STRATEGY;

MODEL CHECKING;

EID: 84957079461     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48683-6_38     Document Type: Conference Paper

References (13)

1. [BLO98] S. Bensalem, Y. Lakhnech, and S. Owre. Computing abstractions 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. [CC77] 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.
3. [CGL94] 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.
4. [CU98] Michael Colon and Thomas Uribe. Generating finite-state abstractions of reactive systems using decision procedures. In Proceedings of the 9th Conference on Computer-Aided Verification, CAV'98, LNCS. Springer Verlag, June 1998.
5. [DGG94] D. Dams, O. Grumberg, and R. Gerth. Abstract interpretation of reactive systems: Abstractions preserving VCTL*, 3CTL* and CTL*. In Ernst-Rudiger Olderog, editor, IFIP Conference PROCOMET'94, pages 561-581, 1994.
6. [GS97] S. Graf and H. Saïdi. Construction of abstract state graphs with PVS. In Conference on Computer Aided Verification CAV'97, LNCS 1254, Springer Verlag, 1997.
7. [HS96] 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.
8. [LGS+95] C. Loiseaux, S. Graf, J. Sifakis, A. Bouajjani, and S. Bensalem. Property preserving abstractions for the verification of concurrent systems. Formal Methods in System Design, Vol 6, Iss 1, January 1995, 1995.
9. [OSRSC98] S. Owre, N. Shankar, J. M. Rushby, and D. W. J. Stringer-Calvert. The PVS Specification Language. Computer Science Laboratory, SRI International, Menlo Park, CA, August 1998.
10. [PH97] A. Pardo and G.D. Hachtel. Automatic abstraction techniques for pro-positional μ-calculus model checking. In Conference on Computer Aided Verification CAV'97, LNCS 1254, Springer Verlag, 1997.
11. [RSS95] S. Rajan, N. Shankar, and M.K. Srivas. An integration of model checking with automated proof checking. In Computer-Aided Verification, CAV '95, number 939 in Lecture Notes in Computer Science, Liege, Belgium, 1995. Springer-Verlag.
12. [Rus97] John Rushby. Specification, proof checking, and model checking for protocols and distributed systems with PVS. In FORTE/PSTV '97, Osaka, Japan, November 1997.
13. [vHPPR98] Friedrich von Henke, Stephan Pfab, Holger Pfeifer, and Harald Rueβ. Case studies in meta-level theorem proving. In Jim Grundy and Malcolm Newey, editors, Theorem Proving in Higher Order Logics: 11th International Conference, TPHOLs '98, volume 1479 of Lecture Notes in Computer Science, pages 461-478, Canberra, Australia, September 1998. Springer-Verlag.