Skip to main content
SpringerLink
Log in

Stan: A static analyzer for CLP({ie383-01}) based on abstract interpretation

  • System Descriptions
  • Conference paper
  • First Online:
Static Analysis (SAS 1996)

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

Included in the following conference series:

  • 154 Accesses

Abstract

Stan is an implementation of a static analysis for CLP ({ie383-02}) based on abstract interpretation. The semantics of the program is achieved using unfolding operator. The abstract domain is a space of convex polyhedra. Three types of program analysis are implemented — backward, forward and combined.The results of the analysis can be used in program optimization. The implementation is complemented by a graphic user interface.

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

Access this chapter

Log in via an institution

Institutional subscriptions

References

  1. N.V. Chernikova, Algorithm for discovering the set of all the solutions of a linear programming problem. U.S.S.R. Computation Mathematics and Mathematical Physics, 8(6):282–293, 1968

    Google Scholar 

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

    Google Scholar 

  3. P. Cousot and R. Cousot, Abstract Interpretation and Application to Logic Programs. Journal of Logic Programming, special issue on Abstract Interpretation, June 1992

    Google Scholar 

  4. P. Cousot and N. Halbwachs, Automatic discovery of Linear Restraints among Variables of a Program. Fifth Annual ACM Symposium on Principles of Programming Languages, 84–96, 1978

    Google Scholar 

  5. M. Handjieva, Abstract Interpretation of Constraint Logic Programs over Numeric Domains, URL http://lix.polytechnique.fr/~handjiev/HANDJIEVpapers.html

    Google Scholar 

  6. R. Giacobazzi, Semantic aspects of Logic Program Analysis. Ph.D. Dissertation, Università di Pisa, March 1993

    Google Scholar 

  7. J. Jaffar and J.-L. Lassez, Constraint Logic Programming. In Fourteenth Annual ACM Symposium on Principles of Programming Languages, 111–119, San Francisco, California, 1987

    Google Scholar 

  8. J. Jaffar, S. Michaylov, P. Stuckey and R. Yap, The CLP({ie384-01}) Language and System. ACM Transaction on Programming Languages and Systems, 14(3):339–395, July 1992

    Google Scholar 

  9. C. StJohn, Implementation of a static analysis for deriving linear size relations in Prolog programs, Technical Report, LIX, Ecole Polytechnique, France, 1993

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Ecole Polytechnique, LIX, 91128, Palaiseau Cedex, France

    Maria Handjieva

Authors
  1. Maria Handjieva
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Radhia Cousot David A. Schmidt

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Handjieva, M. (1996). Stan: A static analyzer for CLP({ie383-01}) based on abstract interpretation. In: Cousot, R., Schmidt, D.A. (eds) Static Analysis. SAS 1996. Lecture Notes in Computer Science, vol 1145. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61739-6_54

Download citation

  • DOI: https://doi.org/10.1007/3-540-61739-6_54

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-70674-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation