Skip to main content

Property Dependent Abstraction of Control Structure for Software Verification

  • Conference paper
  • First Online:
  • 271 Accesses

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

Abstract

In this paper we present a technique to compute abstract models for formal system verification. The method reduces the state space by eliminating those parts of a system model which are not required to check a property. The abstract model depends on the property, which is a formula of the next-less fragment of CTL *. The algorithm reads a system description, annotates it with abstract sub-models for the statements, which are finally composed as abstract model for the system. In the paper we introduce the core algorithm and illustrate it by an example.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alexander Asteroth, Christel Baier, and Ulrich Aßmann. Model checking with formula-dependent abstract models. In Computer Aided Verification (CAV’ 01), 2001.

    Google Scholar 

  2. Felice Balarin and Alberto L. Sangiovanni-Vincentelli. An iterative approach to language containment. In Courcoubetis, editor, Proceedings of Computer Aided Verification (CAV’ 93), volume 697 of Lecture Notes in Computer Science, pages 29–40. Springer, 1993.

    Google Scholar 

  3. Edmund M. Clarke, Orna Grumberg, and David E. Long. Model checking and abstraction. In Conference record of the Nineteenth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 343–354. ACM Press, 1992.

    Google Scholar 

  4. Edmund M. Clarke, Orna Grumberg, and Doron Peled. Model Checking. MIT Press, 1999.

    Google Scholar 

  5. Dennis Dams, Orna Grumberg, and Rob Gerth. Abstract interpretation of reactive systems. ACM Transactions on Programming Languages and Systems, 19(2):253–291, 1997.

    Article  Google Scholar 

  6. [HCD+99]_John Hatcliff, James C. Corbett, Matthew B. Dwyer, Stefan Sokolowski, and Hongjun Zheng. A formal study of slicing for multi-threaded programs with JVM concurrency primitives. In Proceedings of the International Symposium on Static Analysis (SAS’ 99), 1999.

    Google Scholar 

  7. Michael Jones and Ganesh Gopalakrishnan. Verifying transaction ordering properties in unbounded bus networks through combined deductive/algorithmic methods. In Formal Methods in Computer-Aided Design, pages 505–519, 2000.

    Google Scholar 

  8. Jae-Young Jang, Shaz Qadeer, Matt Kaufmann, and Carl Pixley. Formal verification of FIRE: A case study. In Design Automation Conference, pages 173–177, 1997.

    Google Scholar 

  9. Robert P. Kurshan. Computer-Aided Verification of Coordinating Processes. Princeton University Press, 1994.

    Google Scholar 

  10. [LGS+95]_Claire Loiseaux, Susanne Graf, Joseph Sifakis, Ahmed Bouajjani, and Saddek Bensalem. Property preserving abstractions for the verification of concurrent systems. Formal Methods in System Design, 6:1–35, 1995.

    Article  Google Scholar 

  11. Zohar Manna and Amir Pnueli. The Temporal Logic of Reactive and Concurrent Systems, Specification. Springer, 1992.

    Google Scholar 

  12. [PVE+00]_John Penix, Willem Visser, Eric Engstrom, Aaron Larson, and Nicholas Weininger. Verification of time partitioning in the DEOS scheduler kernel. In International Conference on Software Engineering, pages 488–497, 2000.

    Google Scholar 

  13. Natalia Sidorova and Martin Steffen. Verification of a wireless atm medium access protocol. Technical Report TR ST 00 3, University of Kiel, Germany, May 2000.

    Google Scholar 

  14. Karen Yorav and Orna Grumberg. Static analysis for state-space reductions preserving temporal logics. Technical Report CS-2000-03, Technion, Israel, 2000.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Firley, T., Goltz, U. (2002). Property Dependent Abstraction of Control Structure for Software Verification. In: Eriksson, LH., Lindsay, P.A. (eds) FME 2002:Formal Methods—Getting IT Right. FME 2002. Lecture Notes in Computer Science, vol 2391. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45614-7_29

Download citation

  • DOI: https://doi.org/10.1007/3-540-45614-7_29

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-45614-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics