Skip to main content
SpringerLink
Log in

Domain Compression for Complete Abstractions

  • 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

We introduce the operation of domain compression for complete refinements of finite abstract domains. This provides a systematic method for simplifying abstract domains in order to isolate the most abstract domain, when it exists, whose refinement toward completeness for a given semantic function returns a given domain. Domain compression is particularly relevant to compare abstractions in static program analysis and abstract model checking. In this latter case we consider domain compression in predicate abstraction of transition systems.

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. T. Ball, A. Podelski, and S.K. Rajamani. Relative completeness of abstraction refinement for software model checking. In J.-P. Kaoen and P. Stevens, editors, Proc. of TACAS: Tools and Algorithms for the Construction and Analysis of Systems, volume 2280 of Lecture Notes in Computer Science, pages 158–172. Springer-Verlag, Berlin, 2002.

    Google Scholar 

  2. T.S. Blyth and M.F. Janowitz. itResiduation theory. Pergamon Press, 1972.

    Google Scholar 

  3. E. M. Clarke, E. A. Emerson, and A. P. Sistla. Automatic verification of finitestate concurrent system using temporal logic specification. ACM Trans. Program. Lang. Syst., 8(2):244–263, 1986.

    Article  MATH  Google Scholar 

  4. E.M. Clarke, O. Grumberg, S. Jha, Y. Lu, and H. Veith. Counterexample-guided abstraction refinement. In Proc. of the 12th Internat. Conf. on Computer Aided Verification (CAV’ 00 ), volume 1855 of Lecture Notes in Computer Science, pages 154–169. Springer-Verlag, Berlin, 2000.

    Google Scholar 

  5. A. Cortesi, G. Filé, R. Giacobazzi, C. Palamidessi, and F. Ranzato. Complementation in abstract interpretation. ACM Trans. Program. Lang. Syst., 19(1):7–47, 1997.

    Article  Google Scholar 

  6. 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 4th ACM Symp. on Principles of Programming Languages (POPL’ 77 ), pages 238–252. ACM Press, New York, 1977.

    Google Scholar 

  7. P. Cousot and R. Cousot. Systematic design of program analysis frameworks. In itConference Record of the 6th ACM Symp. on Principles of Programming Languages (POPL’ 79 ), pages 269–282. ACM Press, New York, 1979.

    Google Scholar 

  8. P. Cousot and R. Cousot. Comparing the Galois connection and widening/ narrowing approaches to abstract interpretation (Invited Paper). In M. Bruynooghe and M. Wirsing, editors, Proc. of the 4th Internat. Symp. on Programming Language Implementation and Logic Programming (PLILP’ 92 ), volume 631of Lecture Notes in Computer Science, pages 269–295. Springer-Verlag, Berlin, 1992.

    Google Scholar 

  9. P. Cousot and R. Cousot. On abstraction in software verification. In D. Brinksma and K.G. Larsen, editors, Proc. of the 14th Internat. Conf. on Computer Aided Verification (CAV’ 02 ), volume 2404 of Lecture Notes in Computer Science, pages 37–56. Springer-Verlag, Berlin, 2002.

    Google Scholar 

  10. G. Filé, R. Giacobazzi, and F. Ranzato. A unifying view of abstract domain design. ACM Comput. Surv., 28(2):333–336, 1996.

    Article  Google Scholar 

  11. G. Filé and F. Ranzato. Complementation of abstract domains made easy. In M. Maher, editor, Proceedings of the 1996 Joint International Conference and Symposium on Logic Programming (JICSLP’ 96 ), pages 348–362. The MIT Press, Cambridge, Mass., 1996.

    Google Scholar 

  12. G. Filé and F. Ranzato. The powerset operator on abstract interpretations. Theor. Comput. Sci, 222(1-2):77–111, 1999.

    Article  MATH  Google Scholar 

  13. R. Giacobazzi and I. Mastroeni. A characterization of symmetric semantics by domain complementation. In Proc. of the 2nd international conference in principles and practice of declarative programming PPDP’00, pages 115–126. ACM press, 2000.

    Google Scholar 

  14. R. Giacobazzi and E. Quintarelli. Incompleteness, counterexamples and refinements in abstract model-checking. In P. Cousot, editor, Proc. of The 8th International Static Analysis Symposium, SAS’01, volume 2126 of Lecture Notes in Computer Science, pages 356–373. Springer-Verlag, 2001.

    Google Scholar 

  15. R. Giacobazzi and F. Ranzato. Refining and compressing abstract domains. In P. Degano, R. Gorrieri, and A. Marchetti-Spaccamela, editors, Proc. of the 24th Internat. Colloq. on Automata, Languages and Programming (ICALP’ 97 ), volume 1256 of Lecture Notes in Computer Science, pages 771–781. Springer-Verlag, Berlin, 1997.

    Google Scholar 

  16. R. Giacobazzi and F. Ranzato. Optimal domains for disjunctive abstract interpretation. Sci. Comput. Program, 32(1-3):177–210, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  17. R. Giacobazzi and F. Ranzato. Uniform closures: order-theoretically reconstructing logic program semantics and abstract domain refinements. Inform. and Comput., 145(2):153–190, 1998.

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  19. R. Giacobazzi and F. Scozzari. A logical model for relational abstract domains. ACM Trans. Program. Lang. Syst., 20(5):1067–1109, 1998.

    Article  Google Scholar 

  20. S. Graf and H. Saïdi. Construction of abstract state graphs with PVS. In Proc. of the 9th Internat. Conf. on Computer Aided Verification (CAV’ 97 ), volume 1254 of Lecture Notes in Computer Science, pages 72–83. Springer-Verlag, Berlin, 1997.

    Google Scholar 

  21. T. Jensen. Disjunctive program analysis for algebraic data types. ACM Trans. Program. Lang. Syst., 19(5):751–803, 1997.

    Article  Google Scholar 

  22. C. Loiseaux, S. Graf, J. Sifakis, A. Bouajjani, and S. Bensalem. Property preserving abstractions for the verification of concurrent systems. Formal Methods Syst. Des., 6:11–44, 1995.

    Article  MATH  Google Scholar 

  23. F. Ranzato and F. Tapparo. Making abstract model checking strongly preserving. In M. Hermeneghildo and G. Puebla, editors, Proc. of The 9th International Static Analysis Symposium, SAS’02, volume 2477 of Lecture Notes in Computer Science, pages 411–427. Springer-Verlag, 2002.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica, Università di Verona, Strada Le Grazie 15, 37134, Verona, Italy

    Roberto Giacobazzi & Isabella Mastroeni

Authors
  1. Roberto Giacobazzi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Isabella Mastroeni
    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

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Giacobazzi, R., Mastroeni, I. (2003). Domain Compression for Complete Abstractions. 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_14

Download citation

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

  • 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