Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Compositionality

COMPOS 1997: Compositionality: The Significant Difference pp 276–300Cite as

Compositional Verification of Real-Time Applications

  • Conference paper
  • First Online:

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

Abstract

To support top-down design of distributed real-time systems, a framework of mixed terms has been incorporated in the verification system PVS. Programs and assertional specifications are treated in a uniform way. We focus on the timed behaviour of parallel composition and hiding, presenting several alternatives for the definition of a denotational semantics. This forms the basis of compositional proof rules for parallel composition and hiding. The formalism is applied to an example of a hybrid system, which also serves to illustrate our ideas on platform-independent programming.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. Alur and T. Henzinger. Modularity for timed and hybrid systems. In Proc. Conf. on Concurrency Theory (CONCUR’ 97), pages 74–88. LNCS 1243, Springer-Verlag, 1997.

    Google Scholar 

  2. W.P. de Roever. The quest for compositionality-a survey of assertion-based proof systems for concurrent programs, Part I: Concurrency based on shared variables. In Proc. IFIP Working Conference 1985: The role of abstract models in computer science, pages 181–207. North-Holland, 1985.

    Google Scholar 

  3. J. Hooman and W.P. de Roever. The quest goes on: a survey of proof systems for partial correctness of CSP. In Current Trends in Concurrency, pages 343–395. LNCS 224, Springer-Verlag, 1986.

    Chapter  Google Scholar 

  4. C.A.R. Hoare. Communicating Sequential Processes. Prentice Hall, 1985.

    Google Scholar 

  5. J. Hooman. Correctness of real time systems by construction. In Formal Techniques in Real-Time and Fault-Tolerant Systems, pages 19–40. LNCS 863, Springer-Verlag, 1994.

    Google Scholar 

  6. J. Hooman. Verifying part of the ACCESS.bus protocol using PVS. In Proceedings 15th Conference on the Foundations of Software Technology and Theoretical Computer Science, pages 96–110. LNCS 1026, Springer-Verlag, 1995.

    Google Scholar 

  7. J. Hooman. Verification of distributed real-time and fault-tolerant protocols. In Algebraic Methodology and Software Technology (AMAST’97), to appear. LNCS 1349, Springer-Verlag, 1997.

    Chapter  Google Scholar 

  8. J. Hooman and O. van Roosmalen. Platform-independent verification of real-time programs. In Proceedings of the Joint Workshop on Parallel and Distributed Real-Time Systems, pages 183–192. IEEE Computer Society Press, 1997.

    Google Scholar 

  9. M. Joseph, editor. Real-time Systems: Specification, Verification and Analysis. Prentice Hall, 1996.

    Google Scholar 

  10. E.-R. Olderog. Process theory: Semantics, specification and verification. In Current Trends in Concurrency, pages 442–509. LNCS 224, Springer-Verlag, 1985.

    Chapter  Google Scholar 

  11. E.-R. Olderog. Nets, Terms and Formulas, volume 23 of Camebridge Tracts in Theoretical Computer Science. Camebridge University Press, 1991.

    Google Scholar 

  12. S. Owre, J. Rushby, and N. Shankar. PVS: A prototype verification system. In 11th Conference on Automated Deduction, volume 607 of Lecture Notes Artificial Intelligence, pages 748–752. Springer-Verlag, 1992.

    Google Scholar 

  13. S. Owre, J. Rushby, N. Shankar, and F. von Henke. Formal verification for fault-tolerant architectures: Prolegomena to the design of PVS. IEEE Transactions on Software Engineering, 21(2):107–125, 1995.

    Article  Google Scholar 

  14. N. Shankar. Machine-assisted verification using theorem proving and model checking. In M. Broy, editor, Mathematical Programming Methodology, to appear. 1998.

    Google Scholar 

  15. M. Schenke and E.-R. Olderog. Transformational design of real-time systems-Part I: From requirements to program specification. Acta Informatica, to appear, 1998.

    Google Scholar 

  16. J. Vitt and J. Hooman. Assertional specification and verification using PVS of the steam boiler control system. In J.-R. Abrial, E. Börger, and H. Langmaack, editors, Formal Methods for Industrial Applications: Specifying and Programming the Steam Boiler Control, pages 453–472. LNCS 1165, Springer-Verlag, 1996.

    Google Scholar 

  17. J. Zwiers. Compositionality, Concurrency and Partial Correctness. LNCS 321, Springer-Verlag, 1989.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computing Science, Eindhoven University of Technology, P.O. Box 513, 5600, MB Eindhoven, The Netherlands

    Jozef Hooman

Authors
  1. Jozef Hooman
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Informatics and Applied Mathematics, Christian Albrechts University at Kiel, Preußerstr. 1-9, D-24105, Kiel, Germany

    Willem-Paul de Roever  & Hans Langmaack  & 

  2. Department of Applied Mathematics and Computer Science, Weizmann Institute of Science, P.O. Box 26, Rehovot, 76100, Israel

    Amir Pnueli

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hooman, J. (1998). Compositional Verification of Real-Time Applications. In: de Roever, WP., Langmaack, H., Pnueli, A. (eds) Compositionality: The Significant Difference. COMPOS 1997. Lecture Notes in Computer Science, vol 1536. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49213-5_10

Download citation

  • DOI: https://doi.org/10.1007/3-540-49213-5_10

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65493-3

  • Online ISBN: 978-3-540-49213-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation