Computing polynomial program invariants

Information Processing Letters

Volumn 91, Issue 5, 2004, Pages 233-244

  Müller Olm, Markus ^a   Seidl, Helmut ^b  

^a UNIVERSITY OF HAGEN   (Germany)

^b TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

Abstract interpretation; Computable algebra; Polynomial relation; Program analysis; Program correctness

Indexed keywords

ALGEBRA; COMPUTATIONAL METHODS; COMPUTER SOFTWARE; INVARIANCE; LINEAR ALGEBRA; LINEAR EQUATIONS; POLYNOMIALS; SET THEORY; THEOREM PROVING;

COMPUTABLE ALGEBRA; POLYNOMIAL RELATIONS; PROGRAM ANALYSIS; PROGRAM CORRECTNESS;

DATA PROCESSING;

EID: 17044453720     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2004.05.004     Document Type: Article

References (15)

1. Apt K.R., Plotkin G.D. Countable nondeterminism and random assignment. J. ACM. 33:(4):1986;724-767.
2. Becker T., Weispfennig V. Gröbner Bases. A Computational Approach to Commutative Algebra. second ed. 1998;Springer-Verlag, Berlin.
3. Bensalem S., Lakhnech Y., Saidi H. Powerful techniques for the automatic generation of invariants. Proc. of the 8th International Conference on Computer Aided Verification. CAV 1996 Lecture Notes in Comput. Sci. vol. 1102:1996;323-335 Springer-Verlag, Berlin.
4. Bjørner N., Browne A., Manna Z. Automatic generation of invariants and intermediate assertions. Theoret. Comput. Sci. 173:(1):1997;49-87.
5. Cousot P. Constructive design of a hierarchy of semantics of a transition system by abstract interpretation. Electron. Notes Theoret. Comput. Sci. vol. 6:1997; www.elsevier.nl/locate/entcs/volume6.html.
6. Gunnarsson J., Plantin J., Germundsson R. Verification of a large discrete system using algebraic methods. Proc. of the IEE WODES'96. 1996.
7. Hecht M.S. Flow Analysis of Computer Programs. 1977;Elsevier, North-Holland.
8. Karr M. Affine relationships among variables of a program. Acta Inform. 6:1976;133-151.
9. H. Marchand, M. le Borgne, The supervisory control problem of discrete event systems using polynomial methods, Technical Report 3790, INRIA Rennes, October 1999.
10. Müller-Olm M., Rüthing O. The complexity of constant propagation. 10th European Symposium on Programming. ESOP Lecture Notes in Comput. Sci. vol. 2028:2001;190-205 Springer-Verlag, Berlin.
11. Müller-Olm M., Seidl H. Polynomial constants are decidable. 9th Static Analysis Symposium (SAS). Lecture Notes in Comput. Sci. vol. 2477:2002;4-19 Springer-Verlag, Berlin.
12. Müller-Olm M., Seidl H. A note on Karr's algorithm. Proceedings of ICALP. 2004;. in press.
13. Müller-Olm M., Seidl H. Precise interprocedural analysis through linear algebra. Proc. 31st POPL. 2004;330-341 Venice, Italy.
14. Reif J.R., Lewis H.R. Symbolic evaluation and the global value graph. Proc. 4th POPL, Los Angeles, CA. January 1977;104-118.
15. Sankaranarayanan S., Sipma H., Manna Z. Non-linear loop invariant generation using Gröbner bases. Proc. 31st POPL. 2004;318-329 Venice, Italy.