Skip to main content

A Mechanized Strategy for Safe Abstraction of CSP Specifications

  • Conference paper
Book cover Formal Methods: Foundations and Applications (SBMF 2009)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 5902))

Included in the following conference series:

Abstract

Infinite models cannot be directly analyzed by model checking. An alternative for achieving that is using data abstraction to derive a simpler (abstract) but finite model so that the properties can be verified using the abstract model instead. This work proposes a strategy and an algorithm for generating abstractions of systems modeled in the process algebra CSP. These abstractions are safe in the sense that they preserve trace-based refinements. We show the application of our strategy to an example.

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

Access this chapter

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. Ball, T., Majumdar, R., Millstein, T., Rajamani, S.: Automatic predicate abstraction of C programs. ACM SIGPLAN Notices 36(5), 203–213 (2001)

    Article  Google Scholar 

  2. Bourdoncle, F.: Abstract interpretation by dynamic partitioning. Journal of Functional Programming 2(04), 407–435 (2008)

    Article  MathSciNet  Google Scholar 

  3. Bryant, R.: Symbolic Boolean manipulation with ordered binary-decision diagrams. ACM Computing Surveys (CSUR) 24(3), 293–318 (1992)

    Article  Google Scholar 

  4. Clarke, E., Grumberg, O., Jha, S., Lu, Y., Veith, H.: Progress on the state explosion problem in model checking. Informatics-10 Years Back 10, 176–194 (2001)

    Google Scholar 

  5. Cousot, P., Cousot, R.: Abstract Interpretation Frameworks. Journal of Logic and Computation 2(4), 511–547 (2004)

    Article  MathSciNet  Google Scholar 

  6. Farias, A., Mota, A., Sampaio, A.: Efficient CSP-Z Data Abstraction. In: Boiten, E.A., Derrick, J., Smith, G.P. (eds.) IFM 2004. LNCS, vol. 2999, pp. 108–127. Springer, Heidelberg (2004)

    Google Scholar 

  7. Farias, A., Mota, A., Sampaio, A.: Compositional abstraction of CSP-Z processes. Journal of the Brazilian Computer Society 14, 23–44 (2008)

    Article  Google Scholar 

  8. Fischer, C.: CSP-OZ: A combination of Object-Z and CSP. In: Formal Methods for Open Object-Based Distributed Systems (FMOODS 1997), vol. 2, pp. 423–438 (1997)

    Google Scholar 

  9. Forjaz, M.: The origins of Embraer. Tempo Social 17, 281–298 (2005)

    Article  Google Scholar 

  10. Graf, S., Saidi, H.: Construction of abstract state graphs with PVS. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol. 1254, pp. 72–83. Springer, Heidelberg (1997)

    Google Scholar 

  11. Lazic, R., Roscoe, A.: A semantic study of data independence with applications to model checking. Bulletin-European Association For Theoretical Computer Science 71, 259–260 (2000)

    Google Scholar 

  12. Roscoe, A.: The Theory and Practice of Concurrency. Prentice Hall, Englewood Cliffs (1998)

    Google Scholar 

  13. Sampaio, A., Albuquerque, C., Vasconcelos, J., Cruz, L., Figueiredo, L., Cavalcante, S.: Software test program: a software residency experience. In: ICSE 2005: Proceedings of the 27th international conference on Software engineering, pp. 611–612. ACM Press, New York (2005)

    Google Scholar 

  14. Smith, G.: The Object-Z Specification Language. Springer, Heidelberg (2000)

    MATH  Google Scholar 

  15. Systems, F.: Failures-Divergence Refinement - FDR2 User Manual, June 2005. Formal Systems (Europe) Ltd. (June 2005)

    Google Scholar 

  16. Visser, W., Havelund, K., Brat, G., Park, S., Lerda, F.: Model Checking Programs. Automated Software Engineering 10(2), 203–232 (2003)

    Article  Google Scholar 

  17. Wehrheim, H.: Data Abstraction Techniques in the Validation of CSP-OZ Specifications. Formal Aspects of Computing 12(3), 147–164 (2000)

    Article  MATH  Google Scholar 

  18. Woodcock, J., Davies, J.: Using Z: specification, refinement, and proof. Prentice-Hall, Inc., Upper Saddle River (1996)

    MATH  Google Scholar 

  19. Yorav, S., Clarke, E.: Automated Compositional Abstraction Refinement for Concurrent C Programs: A Two-Level Approach. Electronic Notes in Theoretical Computer Science 89(3), 105–127 (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Damasceno, A., Farias, A., Mota, A. (2009). A Mechanized Strategy for Safe Abstraction of CSP Specifications. In: Oliveira, M.V.M., Woodcock, J. (eds) Formal Methods: Foundations and Applications. SBMF 2009. Lecture Notes in Computer Science, vol 5902. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10452-7_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-10452-7_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-10451-0

  • Online ISBN: 978-3-642-10452-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics