Skip to main content
SpringerLink
Log in

Distinctness and Sharing Domains for Static Analysis of Java Programs

  • Conference paper
  • First Online:
ECOOP 2001 — Object-Oriented Programming (ECOOP 2001)

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

Included in the following conference series:

Abstract

The application field of static analysis techniques for objectoriented programming is getting broader, ranging from compiler optimizations to security issues. This leads to the need of methodologies that support reusability not only at the code level but also at higher (semantic) levels, in order to minimize the effort of proving correctness of the analyses. Abstract interpretation may be the most appropriate approach in that respect. This paper is a contribution towards the design of a general framework for abstract interpretation of Java programs. We introduce two generic abstract domains that express type, structural, and sharing information about dynamically created objects. These generic domains can be instantiated to get specific analyses either for optimization or verification issues. The semantics of the domains are precisely defined by means of concretization functions based on mappings between concrete and abstract locations. The main abstract operations, i.e., upper bound and assignment, are discussed. An application of the domains to source-to-source program specialization is sketched to illustrate the effectiveness of the analysis.

Supported by the Belgian National Fund for Scientific Research (FNRS).

Partially supported by MURST projects ‘Certificazione Automatica di Programmi mediante Interpretazione Astratta’ and ‘Interpretazione Astratta, Type Systems e Analisi Control-Flow’.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. O. Agesen. Constrained-based type inference and parametric polymorphism. In B. Le Charlier, editor, Proceedings of the First International Symposium on Static Analysis (SAS’94), number 864 in LNCS, Namur, September 1994. Springer-Verlag.

    Google Scholar 

  2. P. S. Almeida. Balloon Types: Controlling Sharing of State in Data Types. In Proceedings of the European Conference on Object-Oriented Programming (ECOOP’97), 1997.

    Google Scholar 

  3. B. Blanchet. Escape analysis for object oriented languages. application to java. In Proceedings of the Conference on Object-Oriented Programming, Systems, Languages and Applications Static Analysis (OOPSLA’99), November 1999.

    Google Scholar 

  4. M. Bruynooghe. A practical framework for the abstract interpretation of logic programs. Journal of Logic Programming, 10(2):91–124, February 1991.

    Article  MATH  MathSciNet  Google Scholar 

  5. C. Chambers, J. Dean, and D. Grove. Whole-Program Optimization of Object-Oriented Languages. Technical report, Department of Computer Science and Engineering, University of Washington, Box 352350, Seattle, Washington 98195-2350 USA.

    Google Scholar 

  6. D. R. Chase, M. Wegman, and F. K. Zadeck. Analysis of Pointer and Structures. In Proceedings of the ACM SIGPLAN’90 Conference on Programming Language and Implementation, White-Plains, New-York, June 1990.

    Google Scholar 

  7. A. Cortesi, B. Le Charlier, and P. Van Hentenryck. Combination of abstract domains for logic programming. In Proceedings of the 21th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL’94), Portland, Oregon, January 1994.

    Google Scholar 

  8. A. Cortesi, B. Le Charlier, and P. Van Hentenryck. Type analysis of prolog using type graphs. Journal of Logic Programming, 23(3):237–278, June 1995.

    Article  MATH  MathSciNet  Google Scholar 

  9. P. Cousot and R. Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Conference Record of Fourth ACM Symposium on Programming Languages (POPL’77), pages 238–252, Los Angeles, California, January 1977.

    Google Scholar 

  10. P. Cousot and R. Cousot. Systematic design of program analysis frameworks. In Conference Record of Sixth ACM Symposium on Programming Languages (POPL’79), pages 269–282, Los Angeles, California, January 1979.

    Google Scholar 

  11. A. Deutsch. A storeless model of aliasing and its abstraction using finite representations of right-regular equivalence relations. In Proceedings of the 1992 International Conference on Computer Languages, pages 2–13, Oakland, California, April 1992. IEEE Computer Society Press, Los Alamitos, California.

    Chapter  Google Scholar 

  12. A. Deutsch. Interprocedural May-Alias Analysis for Pointers: Beyond k-Limiting. In Proceedings of the ACM SIGPLAN’94 Conference on Programming Language and Implementation, pages 230–241, Orlando, Florida, June 1994.

    Google Scholar 

  13. A. Deutsch. Semantic models and abstract interpretation for inductive data structures and pointers. In Proceedings of the ACM Symposium on Partial Evaluation and Semantics-Based program Manipulation(PEPM’95), pages 226–228, New-York, June 1995.

    Google Scholar 

  14. N. Dor, M. Rodeh, and M. Sagiv. Checking cleanness in linked lists. In Proceedings of the Seventh International Symposium on Static Analysis (SAS’2000), LNCS. Springer-Verlag, September 2000.

    Google Scholar 

  15. V. Englebert, B. Le Charlier, D. Roland, and P. Van Hentenryck. Generic abstract interpretation algorithms for prolog: Two optimization techniques and their experimental evaluation. Software Practice and Experience, 23(4):419–459, April 1993.

    Article  Google Scholar 

  16. D. Evans. Static detection of dynamic memory errors. In Proceedings of the ACM SIGPLAN’96 Conference on Programming Language and Implementation, 1996.

    Google Scholar 

  17. P. Fradet, R. Gaugne, and D. Le Métayer. Static detection of pointer errors: an axiomatisation and a checking algorithm. In Proceedings of the European Symposium on Programming (ESOP’96), LNCS, 1996.

    Google Scholar 

  18. G. Janssens and M. Bruynooghe. Deriving descriptions of possible values of program variables by means of abstract interpretation. Journal of Logic Programming, 13(2-3):205–258, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  19. B. Le Charlier and P. Van Hentenryck. Experimental Evaluation of a Generic Abstract Interpretation Algorithm for Prolog. ACM Transactions on Programming Languages and Systems (TOPLAS), 16(1):35–101, January 1994.

    Article  Google Scholar 

  20. K. Musumbu. Interprétation Abstraite de Programmes Prolog. PhD thesis, Institute of Computer Science, University of Namur, Belgium, September 1990. In French.

    Google Scholar 

  21. F. Nielson, H. R. Nielson, and C. Hankin. Principles of Program Analysis. Springer-Verlag, 1999.

    Google Scholar 

  22. I. Pollet. Smantiques opérationnelles et domaines abstraits pour l’analyse statique de Java. DEA thesis, University of Namur, Belgium, September 1999.

    Google Scholar 

  23. I. Pollet, B. Le Charlier, and A. Cortesi. Distinctness and Sharing Domains for Static Analysis of Java Programs. Research Paper RP-01-003, Institute of Computer Science, University of Namur, Belgium, 2001.

    Google Scholar 

  24. M. Sagiv, T. Reps, and R. Wilhelm. Parametric shape analysis via 3-valued logic. In Proceedings of the 26th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL’99), San Antonio, January 1999.

    Google Scholar 

  25. M. Sagiv, T. Reps, and R. Wilhem. Solving shape-analysis problems in languages with destructive updating. ACM Transactions on Programming Languages and Systems (TOPLAS), 20(1):1–50, January 1998.

    Article  Google Scholar 

  26. U. Schultz, J. Lawall, C. Consel, and G. Muller. Towards automatic specialization of Java programs. In Proceedings of ECOOP’99, pages 367–390, 1999.

    Google Scholar 

  27. J. Stransky. A Lattice for Abstract Interpretation of Dynamic (lisp-like) Structure. Information and Computation, 101:70–102, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  28. P. Van Hentenryck, A. Cortesi, and B. Le Charlier. Evaluation of Prop. Journal of Logic Programming, 23(3):237–278, June 1995.

    MATH  Google Scholar 

  29. E. Yahav. Verifying Safety Properties of Concurrent Java Programs Using 3-Valued Logic. In Proc. of the 28 th ACM Symposium on Principles of Programming Languages (POPL’2001), January 2001.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Namur, Belgium

    Isabelle Pollet & Baudouin Le Charlier

  2. Ca’ Foscari University, Italy

    Agostino Cortesi

Authors
  1. Isabelle Pollet
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Baudouin Le Charlier
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Agostino Cortesi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Aarhus, Åbogade 34, 8200, Århus N, Denmark

    Jørgen Lindskov Knudsen

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pollet, I., Le Charlier, B., Cortesi, A. (2001). Distinctness and Sharing Domains for Static Analysis of Java Programs. In: Knudsen, J.L. (eds) ECOOP 2001 — Object-Oriented Programming. ECOOP 2001. Lecture Notes in Computer Science, vol 2072. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45337-7_5

Download citation

  • DOI: https://doi.org/10.1007/3-540-45337-7_5

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42206-8

  • Online ISBN: 978-3-540-45337-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation