Skip to main content
SpringerLink
Log in

Property Checking Driven Abstract Interpretation-Based Static Analysis

  • Conference paper
  • First Online:
Verification, Model Checking, and Abstract Interpretation (VMCAI 2003)

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

Abstract

Concrete semantics used for abstract interpretation analyses are generally expressed as fixpoints. Checking a property on this kind of semantics can be done by intersecting the fixpoint with a specification related to the property. In this paper, we show how to produce a new, “reverse” analysis from this specification. The result of this analysis, expressed as a lower closure operator, is then used to guide the initial analysis. With this approach, we can refine the result given by the direct abstract analysis.We show that this method enables to deduce forward analyses from backward analyses (and vice-versa), and to combine them iteratively in a way similar to the forward-backward combination of analyses.

This work was supported in part by the RTD project IST-1999-20527 DAEDALUS of the European IST FP5 program.

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. P. Cousot. Méthodes itératives de construction et d’approximation de point fixes d’opérateurs monotones sur un treillis, analyse sémantique des programmes. Thèse ès sciences mathématiques, University of Grenoble, March 1978.

    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 Conference Record of the Fourth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 238–252, Los Angeles, California, 1977. ACM Press, New York, NY.

    Google Scholar 

  3. P. Cousot and R. Cousot. Systematic design of program analysis frameworks. In Conference Record of the Sixth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 269–282, San Antonio, Texas, 1979. ACM Press, New York, NY.

    Google Scholar 

  4. P. Cousot and R. Cousot. Refining model checking by abstract interpretation. Automated Software Engineering,6(1):69–95, 1999.

    Article  Google Scholar 

  5. P. Cousot and R. Cousot. Software analysis and model checking. In E. Brinksma and K.G. Larsen, editors, Proceedings of the 14th International Conference on Computer Aided Verification, CAV 2002, Copenhagen, Denmark, LNCS 2404, pages 37–56. Springer-Verlag Berlin Heidelberg, 27–31 July 2002.

    Google Scholar 

  6. R. Giacobazzi, F. Ranzato, and F. Scozzari. Making abstract interpretations complete. Journal of the ACM, 47(2):361–416, 2000.

    Article  MathSciNet  MATH  Google Scholar 

  7. P. Granger. Improving the results of static analyses of programs by local decreasing iterations. In R. K. Shyamasundar, editor, Foundations of Software Technology and Theoretical Computer Science, 12th conference, New Dehli, India, volume 652 of Lecture Notes in Computer Science, pages 68–79. Springer-Verlag, 1992.

    Google Scholar 

  8. D. Massé. Combining backward and forward analyses of temporal properties. In O. Danvy and A. Filinski, editors, Proceedings of the Second Symposium PADO’2001, Programs as Data Objects, volume 2053 of Lecture Notes in Computer Sciences, pages 155–172, Århus, Denmark, 21–23 May 2001. Springer-Verlag, Berlin, Germany.

    Chapter  Google Scholar 

  9. D. Massé. Semantics for abstract interpretation-based static analyzes of temporal properties. In M. Hermenegildo, editor, Proceedings of the Ninth Static Analysis Symposium SAS’02, volume 2477 of Lecture Notes in Computer Sciences, pages 428–443, Madrid, Spain, 17–20 September 2002. Springer-Verlag, Berlin, Germany.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LIX, École Polytechnique, Palaiseau, France

    Damien Massé

Authors
  1. Damien Massé
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, New York University, 715 Broadway (7th floor), NY 10003, NewYork, USA

    Lenore D. Zuck

  2. College of Computer Science, Northeastern University, 360 Huntington Ave., 02115, Boston, MA, USA

    Paul C. Attie

  3. Computer Science Department, Venice University C’Foscari, Via Torino 155, 30170, Mestre-Venezia, Italy

    Agostino Cortesi

  4. Department of Computer Science and Electrical Engineering, West Virginia University, 26505, Morgantown, WV, USA

    Supratik Mukhopadhyay

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Massé, D. (2003). Property Checking Driven Abstract Interpretation-Based Static Analysis. In: Zuck, L.D., Attie, P.C., Cortesi, A., Mukhopadhyay, S. (eds) Verification, Model Checking, and Abstract Interpretation. VMCAI 2003. Lecture Notes in Computer Science, vol 2575. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36384-X_8

Download citation

  • DOI: https://doi.org/10.1007/3-540-36384-X_8

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00348-9

  • Online ISBN: 978-3-540-36384-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation