Skip to main content

Semantic analysis of interval congruences

  • Conference paper
  • First Online:
Formal Methods in Programming and Their Applications

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 735))

  • 245 Accesses

Abstract

This paper describes a new non relational semantic analysis of program integer variables. Interval congruence analysis is designed using Cousot's abstract interpretation framework, its model generalizes integer intervals and integer cosets by the definition of coset congruences. The use of a widening operator defined on rational approximations of the integer model ensures fast convergences of the iteration process whereas the diversity of patterns of the modeled integer sets increases the accuracy of the analysis.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. P. Cousot and R. Cousot. Static determination of dynamic properties of programs. In Paris Dunod, editor, Proc. of the second International Symposium on programming, pages 106–130, 1976.

    Google Scholar 

  2. P. Cousot and R. Cousot. Abstract interpretation: a unified lattice model for static analysis of programs by construction of approximation of fixpoints. In 4th Annual ACM Symposium on Principles of Programming Languages, pages 238–252, Los Angeles, January 1977.

    Google Scholar 

  3. P. Cousot and R. Cousot. Systematic design of program analysis frameworks. In 6th Annual ACM Symposium on Principles of Programming Languages, pages 269–282, 1979.

    Google Scholar 

  4. P. Cousot and R. Cousot. Abstract interpretation and application to logic programs. Journal of Logic Programming, 13(2–3), 1992.

    Google Scholar 

  5. P. Cousot and R. Cousot. Abstract interpretation frameworks. Journal of Logic and Computation, 1992.

    Google Scholar 

  6. P. Cousot and R. Cousot. Comparing the galois connection and widening/narrowing approaches to abstract interpretation. Technical Report LIX/RR/92/09, Laboratoire d'Informatique de l'X, Ecole Polytechnique, 91128 Palaiseau cedex, France, 1992.

    Google Scholar 

  7. P. Granger. Static analysis of arithmetical congruences. Intern. J. Computer Math., 30:165–190, 1989.

    Google Scholar 

  8. P. Granger. Analyses sémantiques de congruence. PhD thesis. Ecole Polytechnique, Palaiseau, July 1991.

    Google Scholar 

  9. P. Granger. Static analysis of linear congruence equalities among variables of a program. In International Joint Conference on Theory and Practice of Software Development, volume 493 of Lecture Notes on Computer Science, pages 169–192. Springer Verlag, 1991.

    Google Scholar 

  10. F. Masdupuy. Array operations abstraction using semantic analysis of trapezoid congruences. In International Conference on Supercomputing, July 1992.

    Google Scholar 

  11. F. Masdupuy. Semantic analysis of rational interval congruences. Research Report LIX/RR/92/05, Ecole Polytechnique, 91128 Palaiseau, 1992.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Dines Bjørner Manfred Broy Igor V. Pottosin

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Masdupuy, F. (1993). Semantic analysis of interval congruences. In: Bjørner, D., Broy, M., Pottosin, I.V. (eds) Formal Methods in Programming and Their Applications. Lecture Notes in Computer Science, vol 735. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0039705

Download citation

  • DOI: https://doi.org/10.1007/BFb0039705

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57316-6

  • Online ISBN: 978-3-540-48056-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics