Skip to main content
SpringerLink
Log in

Static Reduction Analysis for Imperative Object Oriented Languages

  • Conference paper
  • First Online:
Book cover Logic for Programming and Automated Reasoning (LPAR 2000)

Part of the book series: Lecture Notes in Artificial Intelligence ((LNAI,volume 1955))

  • 372 Accesses

Abstract

we define a generic control-flow sensitive static analysis, Static Reduction Analysis (SRA), for an untyped object-oriented language featuring side-effects and exceptions. While its aims and range of applications closely relate to Control Flow Analysis (CFA), SRA exhibits a distinguishing feature: it only deals with abstract syntax tree (AST) nodes and does not involve approximations of environments nor stores.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. O. Agesen. The cartesian product algorithm: Simple and precise typing of parametric polymorphism. In W. Oltho., editor, Proceedings of ECOOP’95, volume 952 of Lecture Notes in Computer Science, pages 2–26. Springer-Verlag, 1995. 359

    Google Scholar 

  2. G. Barthe, G. Dufay, L. Jakubiec, B. P. Serpette, S. Melo de Sousa, and S.-W. Yu. Formalisation of the Java Card Virtual Machine in Coq. In S. Drossopoulou, S. Eisenbach, B. Jacobs, G. T. Leavens, P. Müller, and A. Poetzsch-Heffter, editors, Proceedings of FTfJP’00—ECOOP Workshop on Formal Techniques for Java Programs, 2000. 360

    Google Scholar 

  3. C. Flanagan and M. Felleisen. Componential set-based analysis. In Proceedings of PLDI’97, volume 32 of ACM SIGPLAN Notices, pages 235–248. ACM Press, 1997. 346

    Google Scholar 

  4. J. Gosling, B. Joy, and G. Steele. Java Language Specification. The Java Series. Addison-Wesley, 1996. 344

    Google Scholar 

  5. D. P. Grove. Effective Interprocedural Optimization of Object-Oriented Languages. PhD thesis, University of Wahsington, 1998. 345

    Google Scholar 

  6. N. Heintze and D. McAllester. On the complexity of set-based analysis. In Proceedings of ICFP’97, pages 150-163. ACM Press, 1997. 346

    Google Scholar 

  7. S. Jagannathan and S. Weeks. A unified treatment of flow analysis in higher-order languages. In Proceedings of POPL’95, pages 393–407. ACM Press, 1995. 345

    Google Scholar 

  8. K. Leino and R. Joshi. A semantic approach to secure information flow. In J. Jeuring, editor, Proceedings of MPC’98, volume 1422 of Lecture Notes in Computer Science, pages 254–271, 1998. 345, 345

    Google Scholar 

  9. S. S. Muchnick and N. D. Jones, editors. Program Flow Analysis: Theory and Applications. Prenctice Hall, 1981. 344

    Google Scholar 

  10. F. Nielson and H. R. Nielson. Infinitary control flow analysis: a collecting semantics for closure analysis. In Proceedings of POPL’97, pages 332–345. ACM Press, 1997. 345, 360

    Google Scholar 

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

    Google Scholar 

  12. J. Palsberg and C. Pavlopoulou. From polyvariant flow information to intersection and union types. In Proceedings of POPL’98, pages 197–208. ACM Press, 1998. 360

    Google Scholar 

  13. J. Pleyvak. Optimization of Object-Oriented and Concurrent Programs. PhDthesis, University of Illinois at Urbana-Champaign, 1996. 345

    Google Scholar 

  14. B. Serpette. Approximations dévaluateurs fonctionnels. In Proceedings of WSA’92, pages 79–90, 1992. 346, 347

    Google Scholar 

  15. M. Shapiro and S. Horwitz. Fast and accurate flow-insensitive points-to analysis. In Proceedings of POPL’97, pages 1-14. ACM Press, 1997. 351

    Google Scholar 

  16. O. Shivers. Control-Flow Analysis of Higher-Order Languages. PhDthesis, School of Computer Science, Carnegie Mellon University, May 1991. Also appears as Technical Report CMU-CS-91-145. 345, 345, 346, 347

    Google Scholar 

  17. S. F. Smith and T. Wang. Polyvariant flow analysis with constrained types. In G. Smolka, editor, Proceedings of ESOP’00, volume 1782 of Lecture Notes in Computer Science, pages 382–396. Springer-Verlag, 2000. 360, 360

    Google Scholar 

  18. B. Steensgard. Points-to analysis in almost linear time. In Proceedings of POPL’96, pages 32–41. ACM Press, 1996. 351

    Google Scholar 

  19. D. Volpano and G. Smith. Language Issues in Mobile Program Security. In G. Vigna, editor, Mobile Agent Security, volume 1419 of Lecture Notes in Computer Science, pages 25–43. Springer-Verlag, 1998. 345

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. INRIA, Sophia-Antipolis, France

    Bernard Paul Serpette

Authors
  1. Gilles Barthe
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bernard Paul Serpette
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. CNRS, Université de Paris 7, case 7012, 2 place Jussieu, 75251, Paris Cedex 05, France

    Michel Parigot

  2. Computer Science Department, University of Manchester, Oxford Rd, M13 9PL, Manchester, UK

    Andrei Voronkov

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Barthe, G., Paul Serpette, B. (2000). Static Reduction Analysis for Imperative Object Oriented Languages. In: Parigot, M., Voronkov, A. (eds) Logic for Programming and Automated Reasoning. LPAR 2000. Lecture Notes in Artificial Intelligence(), vol 1955. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44404-1_22

Download citation

  • DOI: https://doi.org/10.1007/3-540-44404-1_22

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41285-4

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation