Skip to main content
SpringerLink
Log in

How to Make FDR Spin LTL Model Checking of CSP by Refinement

  • Conference paper
  • First Online:
FME 2001: Formal Methods for Increasing Software Productivity (FME 2001)

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

Included in the following conference series:

Abstract

We study the possibility of doing LTL model checking on CSP specifications in the context of refinement. We present evidence that the refinement-based approach to verification does not seem to be very well suited for verifying certain temporal properties. To remedy this problem, we show how to (and how not to) perform LTL model checking of CSP processes using refinement checking in general and the FDR tool in particular. We show how one can handle (potentially) deadlocking systems, discuss the validity of our approach for in finite state systems, and shed light on the relationship between “classical” model checking and refinement checking.

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 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J.-R. Abrial. The B-Book. Cambridge University Press, 1996.

    Google Scholar 

  2. B. Alpern and F. B. Schneider. Defining liveness. Information Processing Letters, 21(4):181–185, October 1985.

    Article  MATH  MathSciNet  Google Scholar 

  3. A. Pnueli. The temporal logic of concurrent programs. Theoretical Computer Science, 13:45–60, 1981.

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  Google Scholar 

  5. M. Butler and C. Morgan. Action systems, unbounded nondeterminism, and infinite traces. Formal Aspects of Computing, 7:37–53, 1995.

    Article  MATH  Google Scholar 

  6. E. Clarke, O. Grumberg, and D. Peled. Model Checking. MIT Press, 1999.

    Google Scholar 

  7. E. M. Clarke, E. A. Emerson, and A. P. Sistla. Automatic verification of finitestate concurrent systems using temporal logic specifications. ACM Transactions on Programming Languages and Systems, 8(2):244–263, 1986.

    Article  MATH  Google Scholar 

  8. E. M. Clarke and J. M. Wing. Formal methods: State of the art and future directions. ACM Computing Surveys, 28(4):626–643, Dec. 1996.

    Article  Google Scholar 

  9. S. J. Creese and A. W. Roscoe. Data independent induction over structured networks. In International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA’ 00), Las Vegas, USA, June 2000.

    Google Scholar 

  10. M. Leuschel, T. Massart, and A. Currie. How to make FDR spin: LTL model checking of CSP by refinement. Technical Report DSSE-TR-2000-10, Department of Electronics and Computer Science, University of Southampton, September 2000.

    Google Scholar 

  11. J. Esparza. Decidability of model-checking for infinite-state concurrent systems. Acta Informatica, 34:85–107, 1997.

    Article  MathSciNet  Google Scholar 

  12. Formal Systems (Europe) Ltd. Failures-Divergence Refinement — FDR2 User Manual.

    Google Scholar 

  13. R. Gerth, D. Peled, M. Y. Vardi, and P. Wolper. Simple on-the-fly automatic verification of linear temporal logic. In Proc. 15th Workshop on Protocol Specification, Testing, and Verification, Warsaw, June 1995. North-Holland.

    Google Scholar 

  14. C. Hoare. Communicating Sequential Processes. Prentice Hall, 1985.

    Google Scholar 

  15. G. Holzmann. Design and Validation of Computer Protocols. Prentice Hall, 1991.

    Google Scholar 

  16. M. Leuschel and T. Massart. In_nite state model checking by abstract interpretation and program specialisation. In A. Bossi, editor, Proceedings of LOPSTR’99, LNCS 1817, pages 63–82, Venice, Italy, September 1999.

    Google Scholar 

  17. J. Magee and J. Kramer. Concurrency: State Models & Java Programs. Wiley, 1999.

    Google Scholar 

  18. K. L. McMillan. Symbolic Model Checking. PhD thesis, Boston, 1993.

    Google Scholar 

  19. A. Roscoe. The Theory and Practice of Concurrency. Prentice Hall, 1997.

    Google Scholar 

  20. A. W. Roscoe and R. S. Lazic. Using logical relations for automated verification of data-independent CSP. In Proceedings of Oxford Workshop on Automated Formal Methods ENTCS, 1996.

    Google Scholar 

  21. R. Sedgewick. Algorithms in C++. Addison-Wesley, 1992.

    Google Scholar 

  22. A. P. Sistla and E. M. Clarke. The complexity of propositional linear temporal logics. Journal of the ACM, 32(3):733–749, July 1985.

    Article  MATH  MathSciNet  Google Scholar 

  23. A. Valmari. On-the-fly veri_cation with stubborn sets. In C. Courcoubetis, editor, Proceedings of CAV’93, LNCS 697, pages 397–408. Springer-Verlag, 1993.

    Google Scholar 

  24. M. Y. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification. In Proceedings of LICS’86, pages 332–344, 1986.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electronics and Computer Science, University of Southampton, Highfield, Southampton, SO17 1BJ, UK

    Michael Leuschel & Thierry Massart

  2. Computer Science Department, University of Brussels ULB - CP 212, Bld du Triomphe, B-1050, Brussels, Belgium

    Andrew Currie

Authors
  1. Michael Leuschel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andrew Currie
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Thierry Massart
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Science Department, University of Minho, Campus de Gualtar, 4700-320, Braga, Portugal

    José Nuno Oliveira

  2. AT&T Laboratories — Research, 180 Park Avenue, Florham Park, New Jersey, 07932, USA

    Pamela Zave

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Leuschel, M., Currie, A., Massart, T. (2001). How to Make FDR Spin LTL Model Checking of CSP by Refinement. In: Oliveira, J.N., Zave, P. (eds) FME 2001: Formal Methods for Increasing Software Productivity. FME 2001. Lecture Notes in Computer Science, vol 2021. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45251-6_6

Download citation

  • DOI: https://doi.org/10.1007/3-540-45251-6_6

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41791-0

  • Online ISBN: 978-3-540-45251-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation