Skip to main content
SpringerLink
Log in

Making Abstract Model Checking Strongly Preserving

  • Conference paper
  • First Online:
Static Analysis (SAS 2002)

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

Included in the following conference series:

Abstract

Usually, abstract model checking is not strongly preserving: it may well exist a temporal specification which is not valid on the abstract model but which is instead satisfied by the concrete model. Starting from the standard notion of bisimulation, we introduce a notion of completeness for abstract models: completeness together with a so-called partitioning property for abstract models implies strong preservation for the past μ-calculus. Within a rigorous abstract interpretation framework, we show that the least refinement of a given abstract model, for a suitable ordering on abstract models, which is complete and partitioning always exists, and it can be constructively characterized as a greatest fixpoint. This provides a systematic methodology for minimally refining an abstract model checking in order to get strong preservation.

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. S. Bensalem, Y. Lakhnech, S. Owre. Computing Abstractions of Infinite State Systems Compositionally and Automatically. In Proc. CAV’98, LNCS 1427, pp. 319–331, Springer, 1998.

    Google Scholar 

  2. E.M. Clarke, O. Grumberg, S. Jha, Y. Lu, and H. Veith. Counterexample-guided abstraction refinement. In Proc. CAV’00, LNCS 1855, pp. 154–169, Springer, 2000.

    Google Scholar 

  3. E.M. Clarke, O. Grumberg, S. Jha, Y. Lu, H. Veith. Progress on the State Explosion Problem in Model Checking. In Informatics-10 Years Back, 10 Years Ahead. LNCS 2000, pp. 176–194, Springer, 2001.

    Google Scholar 

  4. E.M. Clarke, O. Grumberg, D.E. Long. Model checking and abstraction. In Proc. ACM POPL’92, pp. 342–354, 1992.

    Google Scholar 

  5. E.M. Clarke, O. Grumberg and D. Long. Model checking and abstraction. ACM TOPLAS, 16(5):1512–1542, 1994.

    Article  Google Scholar 

  6. E.M. Clarke, O. Grumberg and D.A. Peled. Model checking. The MIT Press, 1999.

    Google Scholar 

  7. P. Cousot and R. Cousot. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Proc. ACM POPL’77, pp. 238–252, 1977.

    Google Scholar 

  8. P. Cousot and R. Cousot. Systematic design of program analysis frameworks. In Proc. ACM POPL’79, pp. 269–282, 1979.

    Google Scholar 

  9. P. Cousot and R. Cousot. Temporal abstract interpretation. In Proc. ACM POPL’00, pp. 12–25, 2000.

    Google Scholar 

  10. D. Dams, O. Grumberg, and R. Gerth. Abstract interpretation of reactive systems. A CM TOPLAS, 16(5):1512–1542, 1997.

    Google Scholar 

  11. J. Dingel and T. Filkorn. Model checking for infinite state systems using data abstraction, assumption-commitment style reasoning and theorem proving. In Proc. CAV’95, LNCS 939, pp. 54–69, Springer, 1995.

    Google Scholar 

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

    Article  Google Scholar 

  13. R. Giacobazzi and E. Quintarelli. Incompleteness, counterexamples and refinements in abstract model checking. In Proc. SAS’01, LNCS 2126, pp. 356–373, Springer, 2001.

    Google Scholar 

  14. R. Giacobazzi and F. Ranzato. Refining and compressing abstract domains. In Proc. ICALP’97, LNCS 1256, pp. 771–781, Springer, 1997.

    Google Scholar 

  15. R. Giacobazzi, F. Ranzato, and F. Scozzari. Making abstract interpretations complete. J. A CM, 47(2):361–416, 2000.

    MATH  MathSciNet  Google Scholar 

  16. C. Loiseaux, S. Graf, J. Sifakis, A. Bouajjani, and S. Bensalem. Property preserving abstractions for the verification of concurrent systems. Formal Methods in System Design, 6:1–36, 1995.

    Article  Google Scholar 

  17. F. Ranzato. On the completeness of model checking. In Proc. ESOP’01, LNCS 2028, pp. 137–154, Springer, 2001.

    Google Scholar 

  18. D.A. Schmidt. Binary relations for abstraction and refinement. In Proc. Workshop on Refinement and Abstraction, Japan 1999. To appear in Elsevier Electronic Notes in Computer Science.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Matematica Pura ed Applicata, Università di Padova, Via Belzoni 7, 35131, Padova, Italy

    Francesco Ranzato & Francesco Tapparo

  2. Dipartimento di Matematica, Università di Milano, Milano, Italy

    Francesco Tapparo

Authors
  1. Francesco Ranzato
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Francesco Tapparo
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science Facultad de Informática, Technical University of Madrid, Campus de Montegancedo, 28660, Boadilla del Monte, Madrid, Spain

    Manuel V. Hermenegildo  & Germán Puebla  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ranzato, F., Tapparo, F. (2002). Making Abstract Model Checking Strongly Preserving. In: Hermenegildo, M.V., Puebla, G. (eds) Static Analysis. SAS 2002. Lecture Notes in Computer Science, vol 2477. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45789-5_29

Download citation

  • DOI: https://doi.org/10.1007/3-540-45789-5_29

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-45789-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation