Skip to main content
SpringerLink
Log in
Book cover

Programming Logics pp 194–215Cite as

Elimination Techniques for Program Analysis

  • Chapter

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7797))

Abstract

Key ideas in our recent work on automatically generating polynomial equalities and inequalities as invariants/inductive assertions for imperative programs are reviewed. Two approaches based on elimination techniques are briefly discussed. The first approach is algebraic and is based on giving the semantics of programming language constructs in terms of polynomial ideals. The second approach is based on assuming a priori the shapes of inductive assertions of interest and then using quantifier elimination techniques to generate constraints on parameters specifying the shape. The key ideas of these approaches are illustrated through examples.

This paper is based on a talk given at the Ganzinger Memorial Symposium held at the Max Planck Institute in May 2005. Most of this paper was written in the summer of 2006. This research was partially supported by NSF awards CCF-0541315 and CCF-0729097.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bressoud, D.: Factorization and Primality Testing. Springer (1989)

    Google Scholar 

  2. Cohen, E.: Programming in the 1990s. Springer (1990)

    Google Scholar 

  3. Colón, M.A.: Approximating the Algebraic Relational Semantics of Imperative Programs. In: Giacobazzi, R. (ed.) SAS 2004. LNCS, vol. 3148, pp. 296–311. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  4. Colón, M.A., Sankaranarayanan, S., Sipma, H.B.: Linear Invariant Generation Using Non-linear Constraint Solving. In: Hunt Jr., W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol. 2725, pp. 420–432. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  5. Cousot, P., Cousot, R.: Abstract Interpretation: a Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints. In: Conference Record of the Fourth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Los Angeles, California, pp. 238–252. ACM Press, New York (1977)

    Chapter  Google Scholar 

  6. Cousot, P., Halbwachs, N.: Automatic Discovery of Linear Restraints among Variables of a Program. In: Conference Record of the Fifth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Tucson, Arizona, pp. 84–97. ACM Press, New York (1978)

    Chapter  Google Scholar 

  7. Cox, D., Little, J., O’Shea, D.: Ideals, Varieties and Algorithms. An Introduction to Computational Algebraic Geometry and Commutative Algebra. Springer (1998)

    Google Scholar 

  8. Delzanno, G.: Constraint-based verification of parameterized cache coherence protocols. Formal Methods in System Design 23(3), 257–301 (2003)

    Article  MATH  Google Scholar 

  9. Dijkstra, E.: A Discipline of Programming. Prentice-Hall (1976)

    Google Scholar 

  10. Freire, P.: http://www.pedrofreire.com/crea2_en.htm

  11. German, S., Wegbreit, B.: A Synthesizer of Inductive Assertions. IEEE Transactions on Software Engineering 1(1), 68–75 (1975)

    Article  Google Scholar 

  12. Gulwani, S., Tiwari, A.: Assertion Checking over Combined Abstraction of Linear Arithmetic and Uninterpreted Functions. In: Sestoft, P. (ed.) ESOP 2006. LNCS, vol. 3924, pp. 279–293. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  13. Kaldewaij, A.: Programming. The Derivation of Algorithms. Prentice-Hall (1990)

    Google Scholar 

  14. Kapur, D.: An approach for solving systems of parametric polynomial equations. In: Saraswat, Hentenryck, V. (eds.) Principles and Practices of Constraint Programming, pp. 217–244. MIT Press (1995)

    Google Scholar 

  15. Kapur, D.: Automatically Generating Loop Invariants using Quantifier Elimination. Technical report, Department of Computer Science, University of New Mexico, Albuquerque, NM, USA (2003)

    Google Scholar 

  16. Kapur, D.: A Quantifier Elimination based Heuristic for Automatically Generating Inductive Assertions for Programs. J. of Systems Science and Complexity 19(3), 307–330 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  17. Kapur, D., Majumdar, R., Zarba, C.: Interpolation for data structures. In: Proceedings of the 14th ACM SIGSOFT Symp. on Foundations of Software Engineering (2006)

    Google Scholar 

  18. Kapur, D., Narendran, P.: An equational approach to theorem proving in first-order predicate calculus. In: Proceedings of the Ninth International Joint Conference on Artificial Intelligence (IJCAI 1985), pp. 1146–1153 (1985)

    Google Scholar 

  19. Kapur, D., Zarba, C.: A Reduction Approach to Decison Procedures. Technical Report, Department of Computer Science, UNM, (December 2006)

    Google Scholar 

  20. Knuth, D.E.: The Art of Computer Programming. Seminumerical Algorithms, vol. 2. Addison-Wesley (1969)

    Google Scholar 

  21. Kuncak, V.: Modular Data Structure Verification. PhD thesis, Department of EECS, MIT, Cambridge, MA (2007)

    Google Scholar 

  22. Manna, Z.: Mathematical Theory of Computation. McGraw-Hill (1974)

    Google Scholar 

  23. Manna, Z., Zarba, C.: Combining Decision Procedures. In: Formal Methods at the Crossroads: from Panacea to Foundational Support (2003)

    Google Scholar 

  24. Müller-Olm, M., Seidl, H.: Program Analysis through Linear Algebra. In: Symposium on Principles of Programming Languages, pp. 330–341 (2004)

    Google Scholar 

  25. Müller-Olm, M., Petter, M., Seidl, H.: Interprocedurally Analyzing Polynomial Identities. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol. 3884, pp. 50–67. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  26. Nelson, G.: Techniques for Program Verification. PhD thesis, Department of Computer Science, Stanford University, Palo Alto, CA (1981)

    Google Scholar 

  27. Petter, M.: Berechnung von polynomiellen invarianten. Master’s thesis, Fakultät für Informatik, Technische Universität München (2004), http://www2.cs.tum.edu/~petter/da

  28. Rodríguez-Carbonell, E.: Automatic Generation of Polynomial Invariants for System Verification. PhD thesis, Universitat Politecnica de Catalunya (2006)

    Google Scholar 

  29. Rodríguez-Carbonell, E., Kapur, D.: Automatic Generation of Polynomial Loop Invariants: Algebraic Foundations. In: Intl. Symp. on Symbolic and Algebraic Computation (ISSAC), pp. 266–273 (July 2004)

    Google Scholar 

  30. Rodríguez-Carbonell, E., Kapur, D.: Automatic generation of polynomial invariants of bounded degree using abstract interpretation. J. of Science of Programming 64(1), 54–75 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  31. Rodríguez-Carbonell, E., Kapur, D.: Generating all polynomial invariants in simple loops. J. of Symbolic Computation 42(4), 443–476 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  32. Rodríguez-Carbonell, E., Kapur, D.: An Abstract Interpretation Approach for Automatic Generation of Polynomial Invariants. In: Giacobazzi, R. (ed.) SAS 2004. LNCS, vol. 3148, pp. 280–295. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  33. Sankaranarayanan, S., Sipma, H., Manna, Z.: Non-linear Loop Invariant Generation using Gröbner Bases. In: Symp. on Principles of Programming Languages (2004)

    Google Scholar 

  34. Schrijver, A.: Theory of Linear and Integer Programming. John Wiley (1998)

    Google Scholar 

  35. Shelburne, B.J.: Zuse’s Z3 square root algorithm, http://www4.wittenberg.edu/academics/mathcomp/bjsdir/ZuseZ3Talk.pdf

  36. Shostak, R.: A Practical Decision Procedure for Arithmetic with Function Symbols. J. ACM 26(2), 351–360 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  37. Wegbreit, B.: The Synthesis of Loop Predicates. Communications of the ACM 17(2), 102–112 (1974)

    Article  MathSciNet  MATH  Google Scholar 

  38. Wu, W.: Basic principles of mechanical theorem proving in geometries. J. of Automated Reasoning 2, 221–252 (1986)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of New Mexico, Albuquerque, NM, USA

    Deepak Kapur

Authors
  1. Deepak Kapur
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Manchester, Oxford Road, M13 9PL, Manchester, UK

    Andrei Voronkov

  2. Max-Planck-Institut für Informatik, Campus E1 4, 66123, Saarbrücken, Germany

    Christoph Weidenbach

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Kapur, D. (2013). Elimination Techniques for Program Analysis. In: Voronkov, A., Weidenbach, C. (eds) Programming Logics. Lecture Notes in Computer Science, vol 7797. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-37651-1_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-37651-1_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-37650-4

  • Online ISBN: 978-3-642-37651-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation