Powerful techniques for the automatic generation of invariants

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

Volumn 1102, Issue , 1996, Pages 323-335

  Bensalem, Saddek ^a,c   Lakhnech, Yassine ^b   Saidi, Hassen ^a  

^a VERIMAG   (France)

^b UNIVERSITY OF KIEL   (Germany)

^c SRI INTERNATIONAL   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

ASSERTION LANGUAGE; AUTOMATIC GENERATION; CONTROL LOCATIONS; GLOBAL SYSTEMS; STRENGTHENING TECHNIQUE; TRANSITION SYSTEM;

COMPUTER AIDED ANALYSIS;

EID: 84957363964     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61474-5_80     Document Type: Conference Paper

References (20)

1. K.R. Apt. Ten years of Hoare’s logic: a survey, part I. ACM Trans. on Prog. Lang. and Sys, 3(2):431-483, 1981.
2. N. Bjøner, A. Browne, and Z. Manna. Automatic generation of invariants and intermediate assertions. In U. Montanari, editor, 1st Int. Conf. on Principles and Practice of Constraint Programming, 1995.
3. M. Caplain. Finding invariant assertions for proving programs. In Proc. Int. Conf. on Reliable Software, Los Angeles, CA, 1975.
4. E.M. Clarke, E.A. Emerson, and E. Sistla. Automatic verification of finite state concurrent systems using temporal logic specifications: A practical approach. In POPL’83. ACM, 1983.
5. 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 syrup, of Prog. Lang., pages 238-252. ACM Press, 1977.
6. E. W. Dijkstra. Guarded commands, nondeterminacy, and formal derivation. Comm. ACM, 18(8):453-457, 1975.
7. B. Elspas. The semiautomatic generation of inductive assertions for proving program correctness. Research report, SRI, Menlo Park, CA, 1974.
8. R. W. Floyd. Assigning meanings to programs. In In. Proc. Syrup. on Appl. Math. 19, pages 19-32. American Mathematical Society, 1967.
9. S. M. German and B. Wegbreit. A synthesizer of inductive assertions. IEEE Trans. On Software Engineering, 1:68-75, March 1975.
10. S. Graf and H. Saidi. Verifying inwriants using theorem proving. In In this volume, 1996.
11. S. Katz and Z. Manna. A heuristic approach to program verification. In Proc. 3rd Int. Joint Conf. on Artificial Intelligence, Stanford, CA, 1976.
12. L. Lamport. A new solution of Dijkstra’s concurrent programming problem. Comm. ACM, 17(8):453-455, 1974.
13. O. Lichtenstein and A. Pnueh. Checking that finite state concurrent programs satisfy their hnear specification. In. POPL, pages.97-107, 1985.
14. Z. Manna, A. Anuchitanukul, N. Bjøner, A. Browne, E. Chang, M. Colon, L. De Alfaro, H. Devarajan, H. Sipma, and T. Uribe. STeP: The Stanford Temporal Prover. Technical report, Stanford Univ., Stanford, CA, 1995.
15. Z. Manna and A. Pnueh. Temporal Verification of Reactive Systems: Safety. Springer-Verlag, 1995.
16. S. Owre, J. Rushby, N. Shankar, and F. yon Henke. Formal verification for faulttolerant architectures: Prolegomena to the design of PVS. IEEE Transactions on Software Engineering, 1995.
17. J. P. Queille and J. Sifakis. Specification and verification of concurrent systems in CESAR. In Proc. 5th Int. Sym. on Programming, volume 137 of Lecture Notes in Computer Science, pages 337-351. Springer-Verlag, 1982.
18. B. K. Szymanski. A simple solution to Lamport’s concurrent programming problem verification. In Proc. Intern. Conf on Supercomputing Sys., pages 621-626, 1988.
19. B. K. Szymanski and J. M. Vidal. Automatic verfication of a class of symmetric parallel programs. In Proc. 13th IFIP World Computer Congress, 1994.
20. M.Y. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification. In LICS’86. IEEE, 1986.