Automatic generation of invariants and intermediate assertions

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

Volumn 976, Issue , 1995, Pages 589-623

  Bjørner, Nikolaj ^a   Browne, Anca ^a   Manna, Zohar ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY;

APPROXIMATE ANALYSIS; AUTOMATIC GENERATION; BACKWARD PROPAGATION; FORWARD PROPAGATION; LARGE SCALE VERIFICATION; SAFETY VERIFICATION; TEMPORAL SAFETY PROPERTIES; TEMPORAL SPECIFICATION;

COMPUTER PROGRAMMING;

EID: 84958044521     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-60299-2_37     Document Type: Conference Paper

References (17)

1. 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. Princ. of Prog. Lang., pages 238-252. ACM Press, 1977.
2. E.M. Clarke, O. Grumberg, and D.E. Long. Model checking and abstraction. In 19th ACM Syrup. Princ. of Prog. Lang., pages 343-354, 1992.
3. P. Cousot and N. Halbwachs. Automatic discovery of linear restraints among the variables of a program. In 5th ACM Syrup. Princ. of Prog. Lang., pages 84-97, Jan. 1978.
4. D.R. Dams, O. Grumberg, and R. Gerth. Abstract interpretation of reactive systems: Abstractions preserving ∀CTL* ∃ECTL*, CTL*. In IFIP Working Conference on Programming Concepts, Methods and Calculi (PROCOMET 94), pages 573-592, June 1994.
5. P. Granger. Static analysis of linear congruence equalities among variables of a program. In TAPSOFT 91, Vol. 1: Colloq. on Trees in Algebra and Programming (CAAP '91), LNCS, pages 169-192. Springer-Verlag, April 1991.
6. S.M. German and B. Wegbreit. A Synthesizer of Inductive Assertions. IEEE transactions on Software Engineering, 1(1):68-75, March 1975.
7. D. Harel. Statecharts: A visual approach to complex systems. Technical Report CS84-05, Dept. of Applied Mathematics, Weizmalm Institute of Science, 1984.
8. N. Heintze. Set Based Program Analysis. PhD thesis, Carnegie Mellon University, 1992.
9. T.A. Henzinger and P.-H. Ho. Algorithmic analysis of nonlinear hybrid systems. In Proc. 7th Intl. Conference on Computer Aided Verification, LNCS, 1995.
10. N. Heintze and J. Jaffar. A decision procedure for a class of Herbrand set constraints. Technical Report CMU-CS-91-110, Carnegie Mellon University, Feb. 1991. Abstract appears in Proceedings of the 5th Annual IEEE Symposium on Logic in Computer Science, 1990.
11. N. Halbwachs, P. Raymond, and Y.-E. Proy. Verification of linear hybrid systems by means of convex approximations. In 1st Intl. Static Analysis Syrup., vol. 864 of LNCS, pages 223-237. Springer-Verlag, Sept. 1994.
12. M. Karr. Affine relationships among variables of a program. Acta Infor. matica, 6:133-151, 1976.
13. S. Katz and Z. Manna. Logical analysis of programs. Communications of the ACM, 19(4):188-206, April 1976.
14. K. Lautenbach. Exacte Bedingungen der Lebendigkeit für eine Klasse yon Petri-Netzen. St. Augustin, GMD Bonn, 82, 1973.
15. Z. Manna, A. Anuchitanukul, N. Bjørner, A. Browne, E. Chang, M. ColSn, L. de Alfaro, H. Devarajan, H.B. Sipma, and T.E. Uribe. STEP: The Stanford temporal prover. Technical Report STAN-CS-TR-94-1518, Computer Science Department, Stanford University, July 1994.
16. Z. Manna and A. Pnueli. Temporal Verification of Reactive Systems: Safety. Springer-Verlag, New York, 1995.
17. W. Reisig. Petri Nets: An Introduction, vol. 4 of EATCS Monographs on Theoretical Computer Science. Springer-Verlag, Berlin, 1985.