Skip to main content
SpringerLink
Log in

An approach for machine-assisted verification of Timed CSP specifications

  • Original Paper
  • Published:
Innovations in Systems and Software Engineering Aims and scope Submit manuscript

Abstract

The real-time process calculus Timed CSP is capable of expressing properties such as deadlock-freedom and real-time constraints. It is therefore well-suited to model and verify embedded software. However, proofs about Timed CSP specifications are not ensured to be correct since comprehensive machine-assistance for Timed CSP is not yet available. In this paper, we present our formalization of Timed CSP in the Isabelle/HOL theorem prover, which we have formulated as an operational coalgebraic semantics together with bisimulation equivalences and coalgebraic invariants. This allows for semi-automated and mechanically checked proofs about Timed CSP specifications. Mechanically checked proofs enhance confidence in verification because corner cases cannot be overlooked. We additionally apply our formalization to an abstract specification with real-time constraints. This is the basis for our current work, in which we verify a simple real-time operating system deployed on a satellite. As this operating system has to cope with arbitrarily many threads, we use verification techniques from the area of parameterized systems for which we outline their formalization.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Ballarin C (2006) Interpretation of locales in Isabelle: theories and proof contexts. In: MKM, pp 31–43

  2. Bengtson J, Parrow J (2007) Formalising the pi-calculus using nominal logic. In: FoSSaCS, pp 63–77

  3. Clarke EM, Grumberg O, Jha S (1997) Verifying parameterized networks. ACM Trans Program Lang Syst 19(5): 726–750

    Article  Google Scholar 

  4. Dong JS, Hao P, Sun J, Zhang X (2006) A reasoning method for timed CSP based on constraint solving. In: ICFEM, pp 342–359

  5. de Frutos-Escrig D, López N, Núñez M (1999) Global timed bisimulation: an introduction. In: FORTE XII / PSTV XIX ’99. Kluwer, Dordrecht, pp 401–416

  6. Formal Systems Europe Ltd. (2005) Failures-Divergence Refinement-FDR2 User Manual. URL: http://www.fsel.com/documentation/fdr2/fdr2manual.pdf

  7. Glesner S, Helke S, Jähnichen S (2007) VATES: verifying the core of a flying sensor. In: Proceedings of the Conquest 2007. dpunkt Verlag

  8. Göthel T, Glesner S (2009) Machine-checkable timed CSP. In: Proceedings of the first NASA formal methods symposium, pp 126–135. NASA Conference Publication

  9. Grinchtein O, Leucker M (2008) Network invariants for real-time systems. Formal Aspects Comput 20(6): 619–635

    Article  MATH  Google Scholar 

  10. Hoare CAR (1985) Communicating sequential processes. Prentice Hall International, London. ISBN: 0-131-53271-5

  11. Intemann M (2002) Semantische Codierung von Timed CSP in Isabelle/HOL. Diplomarbeit, Universität Bremen

  12. Isobe Y, Roggenbach M (2005) A generic theorem prover of CSP refinement. In: TACAS, pp 108–123

  13. Jacobs B (1997) Invariants, Bisimulations and the Correctness of Coalgebraic Refinements. In: AMAST ’97: Proceedings of the 6th international conference on algebraic methodology and software technology. Springer, London, pp 276–291

  14. Jacobs B, Rutten J (1997) A tutorial on (co)algebras and (co)induction. Bull Eur Assoc Theor Comput Sci 62: 222–259

    MATH  Google Scholar 

  15. Kammüller F, Wenzel M, Paulson LC (1999) Locales—a sectioning concept for Isabelle. In: TPHOLs ’99: Proceedings of the 12th international conference on theorem proving in higher order logics. Springer, London, pp 149–166

  16. Kurshan RP, McMillan K (1989) A structural induction theorem for processes. In: PODC ’89: Proceedings of the eighth annual ACM Symposium on principles of distributed computing. ACM, New York, pp 239–247

  17. Milner R (1989) Communication and concurrency. Prentice-Hall, Inc., Upper Saddle River

  18. Montenegro S, Briess K, Kayal H (2006) Dependable Software (BOSS) for the BEESAT Pico Satellite. In: DASIA2006, data systems in aerospace—DASIA 2006, Berlin

  19. Nipkow T, Paulson LC, Wenzel M (2002) Isabelle/HOL—a proof assistant for higher-order logic. LNCS, vol 2283. Springer, Berlin

  20. Ouaknine J (2001) Discrete analysis of continuous behaviour in real-time concurrent systems. Ph.D. thesis, Oxford University Computing Laboratory (2001) Technical Report PRG-RR-01-06

  21. Röckl C, Hirschkoff D (2003) A fully adequate shallow embedding of the π-calculus in Isabelle/HOL with mechanized syntax analysis. J Funct Program 13(2): 415–451

    Article  MATH  Google Scholar 

  22. Schneider S (1999) Concurrent and real time systems: the CSP approach. Wiley, New York

    Google Scholar 

  23. Tej H, Wolff B (1997) A corrected failure divergence model for CSP in Isabelle/HOL. In: FME, pp 318–337

  24. Urban C (2008) Nominal techniques in Isabelle/HOL. J Autom Reason 40(4): 327–356

    Article  MATH  MathSciNet  Google Scholar 

  25. Wolper P, Lovinfosse V (1990) Verifying properties of large sets of processes with network invariants. In: Proceedings of the international workshop on automatic verification methods for finite state systems. Springer, London, pp 68–80

Download references

Author information

Authors and Affiliations

  1. Software Engineering for Embedded Systems Group, Berlin Institute of Technology (TU Berlin), Sekr. TEL 12-4, Ernst-Reuter-Platz 7, 10587, Berlin, Germany

    Thomas Göthel & Sabine Glesner

Authors
  1. Thomas Göthel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sabine Glesner
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Thomas Göthel.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Göthel, T., Glesner, S. An approach for machine-assisted verification of Timed CSP specifications. Innovations Syst Softw Eng 6, 181–193 (2010). https://doi.org/10.1007/s11334-010-0126-z

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11334-010-0126-z

Keywords

Search

Navigation