Generating finite-state abstractions of reactive systems using decision procedures

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

Volumn 1427 LNCS, Issue , 1998, Pages 293-304

  Colón, Michael A ^a   Uribe, Tomás E ^a  

^a Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED ANALYSIS; ABSTRACTING;

DECISION PROCEDURE; FINITE-STATE ABSTRACTION; INFINITE STATE SYSTEMS; REACTIVE SYSTEM; STANFORD; SYSTEM DESCRIPTION; TEMPORAL PROPERTY;

ABSTRACTING; ALGORITHMS;

EID: 84863962507     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0028753     Document Type: Conference Paper

References (26)

1. th Intl. Conference on Computer Aided Verification, vol. 1102 of LNCS. Springer-Verlag, July 1996.
2. N.S. Bjørner, A. Browne, E.S. Chang, M. Colon, A. Kapur, Z. Manna, H.B. Sipma, and T.E. Uribe. STeP: Deductive-algorithmic verification of reactive and real-time systems. In Alur and Henzinger [AH96], pages 415-418.
3. N.S. Bjørner, A. Browne, and Z. Manna. Automatic generation of invariants and intermediate assertions. Theoretical Computer Science, 173(1):49-87, February 1997. (Pubitemid 127451487)
4. st Intl. Conf. on Principles and Practice of Constraint Programming, vol. 976 of LNCS, pp. 589-623, Springer-Verlag, 1995.
5. th Intl. Conf. on Automated Deduction, vol. 1249 of LNCS, pages 101-115. Springer-Verlag, July 1997. (Pubitemid 127089516)
6. P. Cousot and R. Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In 4th ACM Symp. Princ. of Prog. Lang., pages 238-252. ACM Press, 1977.
7. E.M. Clarke, O. Grumberg, and D.E. Long. Model checking and abstraction. ACM Trans, on Prog. Lang, and Systems, 16(5):1512-1542, September 1994.
8. D.R. Dams. Abstract Interpretation and Partition Refinement for Model Checking. PhD thesis, Eindhoven University of Technology, July 1996.
9. J. Dingel and T. Filkorn. Model checking of infinite-state systems using data abstraction, assumption-commitment style reasoning and theorem proving. In Wolper [Wo195], pages 54-69.
10. D.R. Dams, R. Gerth, and O. Grümberg. Abstract interpretation of reactive systems. ACM Transactions on Prog. Lang, and Systems, 19(2):253-291, 1997. (Pubitemid 127447776)
11. P.R. D'Argenio, J.P. Katoen, T. Ruys, and G.T. Tretmans. The bounded retransmission protocol must be on time! In 3rd TACAS Workshop, vol. 1217 of LNCS, pages 416-432. Springer-Verlag, 1997.
12. D.L. Dill and H. Wong-Toi. Verification of real-time systems by successive over and under approximation. In Wolper [Wo195], pages 409-422.
13. E.A. Emerson. Temporal and modal logic. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, vol. B, pages 995-1072. Elsevier Science Publishers (North-Holland), 1990.
14. th Intl. Conference on Computer Aided Verification, vol. 1254 of LNCS. Springer-Verlag, June 1997.
15. S. Graf and H. Saidi. Construction of abstract state graphs with PVS. In Grumberg [Gru97], pages 72-83.
16. K. Havelund and N. Shankar. Experiments in theorem proving and model checking for protocol verification. In Formal Methods Europe, pages 662-681, March 1996. (Pubitemid 126050595)
17. P. Kelb, D. Dams, and R. Gerth. Practical symbolic model checking of the full μ-calculus using compositional abstractions. Technical Report 95/31, Eindhoven University of Technology, The Netherlands, October 1995.
18. Y. Kesten, Z. Manna, and A. Pnueli. Temporal verification of simulation and refinement. In A Decade of Concurrency, vol. 803 of LNCS, pages 273-346. Springer-Verlag, 1994.
19. 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, 6:1-35, 1995.
20. K.L. McMillan. Symbolic Model Checking. Kluwer Academic Pub., 1993.
21. Z. Manna and A. Pnueli. Temporal Verification of Reactive Systems: Safety. Springer-Verlag, New York, 1995.
22. Z. Manna and A. Pnueli. Clocked transition systems. Tech. Report STAN-CS- TR-96-1566, Computer Science Department, Stanford University, April 1996.
23. A. Pardo and G. Hachtel. Automatic abstraction techniques for propositional μ-calculus model checking. In Grumberg [Gru97], pages 12-23.
24. H.B. Sipma, T.E. Uribe, and Z. Manna. Deductive model checking. In Alur and Henzinger [AH96], pages 208-219.
25. th Intl. Conference on Computer Aided Verification, vol. 939 of LNCS. Springer-Verlag, July 1995.
26. H. Wong-Toi. Symbolic Approximations for Verifying Real-Time Systems. PhD thesis, Computer Science Department, Stanford University, March 1995. Tech. Report CS-TR-95-1546.