Skip to main content

Efficient CSP Z Data Abstraction

  • Conference paper
Integrated Formal Methods (IFM 2004)

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

Included in the following conference series:

  • 428 Accesses

Abstract

This paper proposes an algorithm for abstracting infinite state CSP Z —formal combination of CSP (behavioural part) and Z (data part)—processes, with the aim of model checking. Differently from previous work, where CSP Z process abstraction is achieved by investigating only its data part, the current approach abstracts by exploring the whole CSP Z process. In this way we obtain a faster abstraction algorithm in general, more specific data abstractions, and a wider class of infinite state CSP Z processes to deal with.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

Similar content being viewed by others

References

  1. Cleaveland, R., Riely, J.: Testing-based abstractions for value-passing systems. In: Jonsson, B., Parrow, J. (eds.) CONCUR 1994. LNCS, vol. 836, pp. 417–432. Springer, Heidelberg (1994)

    Chapter  Google Scholar 

  2. Cousot, P., Cousot, R.: Abstract interpretation frameworks. Journal of Logic and Computation 2(4), 511–547 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  3. Duke, R., Rose, G., Smith, G.: Object-Z: A specification language advocated for the description of standards. Computer Standards and Interfaces 17, 511–533 (1995)

    Article  Google Scholar 

  4. Ehrig, H., Fey, W., Hansen, H.: ACT ONE: An algebraic specification language with two levels of semantics. Technical Report 83-01, Technische Universität Berlin (1983)

    Google Scholar 

  5. Farias, A.: Efficient and Mechanised Analysis of Infinite CSP Z Processes: strategy and tool support. M.Sc. dissertation (2003)

    Google Scholar 

  6. Farias, A., Mota, A., Sampaio, A.: From CSP Z to CSP M : a Transformational Java Tool. In: Proceedings of IV Workshop on Formal Methods. Computing Brazilian Society (SBC), pp. 1–10 (2001)

    Google Scholar 

  7. Fischer, C.: Combining CSP and Z. Technical Report, University of Oldenburg (1996)

    Google Scholar 

  8. Fischer, C.: Combination and Implementation of Processes and Data: from CSP-OZ to Java. PhD thesis, Fachbereich Informatik Universität Oldenburg (2000)

    Google Scholar 

  9. Fischer, C.: CSP-OZ: a combination of object-Z and CSP. In: 2nd IFIP International Conference on Formal Methods for Open Object-based Distributed Systems (FMOODS 1997), Chapmam & Hall, London (1997)

    Google Scholar 

  10. Formal Systems (Europe). FDR2 User Manual (1997)

    Google Scholar 

  11. Galloway, A.: Integrated formal Methods with Richer Methodological Profiles for the Development of Multi-Perspective Systems. PhD thesis, University of Teesside, School of Computing and Mathematics (1996)

    Google Scholar 

  12. Grumberg, O., Clarke, E., Peled, D.: Model Checking. The MIT Press, Cambridge (1999)

    MATH  Google Scholar 

  13. Hoare, C.A.R.: Communicating Sequential Processes. Prentice Hall, Englewood Cliffs (1985)

    MATH  Google Scholar 

  14. Hoare, C.A.R., Jifeng, H.: Unifying Theories of Programming. Prentice-Hall, Englewood Cliffs (1998)

    Google Scholar 

  15. Horstman, C., Cornell, G.: Core Java 2. vol. I and II. Sun Microsystems Press (2000)

    Google Scholar 

  16. ISO. Information technology - Programming languages, their environments and system software interfaces - Vienna Development Method - Specification Language - Part 1: Base language. International Standard ISO/IEC 13817-1 (December 1996)

    Google Scholar 

  17. ISO. Information Processing Systems - Open Systems Interconnection - LOTOS - A Formal Description Technique based on the Temporal Ordering of Observational Behaviour. ISO/IEC 8807, International Organisation for Standardisation, Geneva, Switzerland (1989)

    Google Scholar 

  18. Lazić, R.: A Semantic Study of Data Independence with Applications to Model Checking. PhD thesis, Oxford University Computing Laboratory (1999)

    Google Scholar 

  19. Milner, R.: A Calculus of Communication Systems. LNCS, vol. 92. Springer, Heidelberg (1980)

    MATH  Google Scholar 

  20. Mota, A.: Model Checking CSP Z : Techniques to Overcome State Explosion. PhD thesis. Federal University of Pernambuco, Brazil (2002)

    Google Scholar 

  21. Mota, A., Sampaio, A.: Model-Checking CSP-Z: strategy, tool support and industrial application. Science of Computer Programming 40, 59–96 (2001)

    Article  MATH  Google Scholar 

  22. Mota, A., Sampaio, A., Borba, P.: Mechanical Abstraction of CSP Z Processes. In: Eriksson, L.-H., Lindsay, P.A. (eds.) FME 2002. LNCS, vol. 2391, pp. 163–183. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  23. Roscoe, A.W.: The Theory and Practice of Concurrency. Oxford University Press, Oxford (1998)

    Google Scholar 

  24. Saaltink, M.: Z-Eves System. In: Till, D., P. Bowen, J., Hinchey, M.G. (eds.) ZUM 1997. LNCS, vol. 1212, Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  25. Spivey, M.: The Z Notation: A Reference Manual, 2nd edn. Prentice Hall International, Englewood Cliffs (1992)

    Google Scholar 

  26. Stahl, K., Baukus, K., Lakhneich, Y., Steffen, M.: Divide, Abstract and Model Check. In: SPIN, pp. 57–76 (1999)

    Google Scholar 

  27. Toetenal, W.: Model-Oriented Specification of Communicating Agents. PhD thesis, Faculty of Mathematics and Informatics (1992)

    Google Scholar 

  28. Wehrheim, H.: Data Abstraction for CSP-OZ. In: Woodcock, J.C.P., Davies, J., Wing, J.M. (eds.) FM 1999. LNCS, vol. 1709, p. 1028. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  29. Woodcock, J., Cavalcanti, A.: The Semantics of Circus. In: Bert, D., P. Bowen, J., C. Henson, M., Robinson, K. (eds.) B 2002 and ZB 2002. LNCS, vol. 2272, pp. 184–203. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  30. Namjoshi, K.S., Kurshan, R.P.: Syntactic Program Transformations for Automatic Abstraction. Computer Aided Verification, 435–449 (2000)

    Google Scholar 

  31. Wolper, P.: Expressing Interesting Properties of Programs in Propositional Temporal Logic. In: Proc. 13th ACM Symp. on Principles of Programming Languages, pp. 184–192 (1986)

    Google Scholar 

  32. Loiseaux, C., Graf, S., Sifakis, J., Bouajjani, A., Bensalem, S.: Property Preserving Abstractions for the Verification of Concurrent Systems. Formal Methods in System Design 6(1), 11–44 (1995)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Farias, A., Mota, A., Sampaio, A. (2004). Efficient CSP Z Data Abstraction. In: Boiten, E.A., Derrick, J., Smith, G. (eds) Integrated Formal Methods. IFM 2004. Lecture Notes in Computer Science, vol 2999. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24756-2_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24756-2_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-21377-2

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics