Verifying liveness by augmented abstraction

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

Volumn 1683, Issue , 1999, Pages 141-156

  Kesten, Yonit ^a   Pnueli, Amir ^b  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

Abstraction; Completeness; Deduction; Fair discrete systems; Infinite systems; Linear temporal logic; Liveness properties; Verification

Indexed keywords

ABSTRACTING; MODEL CHECKING; TEMPORAL LOGIC; VERIFICATION;

ABSTRACTION; COMPLETENESS; DEDUCTION; FAIR DISCRETE SYSTEMS; INFINITE SYSTEM; LINEAR TEMPORAL LOGIC; LIVENESS PROPERTIES;

COMPUTER CIRCUITS;

EID: 84956868810     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48168-0_11     Document Type: Conference Paper

References (27)

1. S. Bensalem, A. Bouajjani, C. Loiseaux, and J. Sifakis. Properties preserving simulations. CAV'92, LNCS 663
2. N. Bj0rner, I.A. Browne, and Z. Manna. Automatic generation of invariants and intermediate assertions. In 1st Intl. Conf. on Principles and Practice of Constraint Programming, LNCS 967, 1995.
3. S. Bensalem, Y. Lakhnech, and S. Owre. Abstractions of infinite state systems compositionally and automatically. CAV'98, LNCS 1427.
4. I.A. Browne, Z. Manna, and H.B. Sipma. Generalized verification diagrams. In FSTTSC'95, LNCS 1026.
5. Cousot, R. Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fix-points. POPL'77
6. E.M. Clarke, O. Grumberg, and K. Hamaguchi. Another look at LTL model checking. CAV'94, LNCS 818
7. E.M. Clarke, O. Grumberg, and D.E. Long. Model checking and abstraction. ACM Trans. Prog. Lang. Sys., 16(5):1512-1542, 1994.
8. E.M. Clarke, O. Grumberg, and D.E. Long. Model checking. In Model Checking, Abstraction and Composition, volume 152 of Nato ASI Series F, pages 477-498. Springer-Verlag, 1996.
9. P. Cousot and N. Halbwachs. Automatic discovery of linear restraints among variables of a program. POPL'78.
10. D. Dams, R. Gerth, and O. Grumberg. Abstract interpretation of reactive systems. ACM Trans. Prog. Lang. Sys., 19(2), 1997.
11. O. Grumberg, N. Francez, J.A. Makowski, and W.-P. de Roever. A proof rule for fair termination. Inf. and Comp., 66:83-101, 1985.
12. S. Graf and C. Loiseaux. A tool for symbolic program verification and abstraction. CAV'93, LNCS 697.
13. Y. Kesten and A. Pnueli. Deductive verification of fair discrete systems. Technical report, the Weizmann Institute, 1998.
14. Y. Kesten and A. Pnueli. Modularization and Abstraction: The Keys to Formal Verification. MFCS'98, LNCS 1450.
15. Y. Kesten, A. Pnueli, and L. Raviv. Algorithmic verification of linear temporal logic specifications. ICALP'98, LNCS 1443.
16. O. Lichtenstein and A. Pnueli. Checking that finite state concurrent programs satisfy their linear specification. POPL '85.
17. D. Lehmann, A. Pnueli, and J. Stavi. Impartiality, justice and fairness: The ethics of concurrent termination. In ICALP'81, LNCS 115.
18. Z. Manna, A. Anuchitanukul, N. Bj0rner, A. Browne, E. Chang, M. Colon, L. De Alfaro, H. Devarajan, H. Sipma, and T.E. Uribe. STeP: The Stanford Temporal Prover. Technical Report STAN-CS-TR-94-1518, Dept. of Comp. Sci., Stanford University, 1994.
19. Z. Manna, A. Brown, H. B. Sipma, and T. E. Uribe. Visual abstractions for temporal verification. AMAST'98.
20. Z. Manna and A. Pnueli. Completing the temporal picture. Theor. Comp. Sci., 83(1):97-130, 1991.
21. Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems: Specification. Springer-Verlag, New York, 1991.
22. Z. Manna and A. Pnueli. Temporal verification diagrams. In Theoretical Aspects of Computer Software, LNCS 789, 1994.
23. Z. Manna and A. Pnueli. Temporal Verification of Reactive Systems: Safety. Springer-Verlag, New York, 1995.
24. H.B. Sipma, T.E. Uribe, and Z. Manna. Deductive model checking. CAV'96.
25. T. E. Uribe. Abstraction-Based Deductive-Algorithmic Verification of Reactive Systems. PhD thesis, Stanford University, 1999.
26. M. Y. Vardi. Verification of concurrent programs - the automata-theoretic framework. Annals of Pure Applied Logic, 51:79-98, 1991.
27. M.Y. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification. In LICS'86.