Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Generating Path Conditions for Timed Systems

  • Conference paper
Integrated Formal Methods (IFM 2005)

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

Included in the following conference series:

Abstract

We provide an automatic method for calculating the path condition for programs with real time constraints. This method can be used for the semiautomatic verification of a unit of code in isolation, i.e., without providing the exact values of parameters with which it is called. Our method can also be used for the automatic generation of test cases for unit testing. The current generalization of the calculation of path condition for the timed case turns out to be quite tricky, since not only the selected path contributes to the path condition, but also the timing constraints of alternative choices in the code.

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 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. Alur, R., Dill, D.L.: A Theory of Timed Automata. Theoretical Computer Science 126, 183–235 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  2. Budhiraja, N., Marzullo, K., Schneider, F.B.: Derivation of sequential, real-time process-control programs. Foundations of Real-Time Computing: Formal Specifications and Methods, 39–54 (1991)

    Google Scholar 

  3. Dijkstra, E.W.: Guarded commands, nondeterminacy and formal derivation of programs. Communications of the ACM 18, 453–457 (1975)

    Article  MATH  MathSciNet  Google Scholar 

  4. Dill, D.L.: Timing assumptions and verification of finite-state concurrent systems. In: Sifakis, J. (ed.) CAV 1989. LNCS, vol. 407, pp. 197–212. Springer, Heidelberg (1990)

    Google Scholar 

  5. Floyd, R.W.: Algorithm 97: Shortest Path. Communications of the ACM 5(6), 345 (1962)

    Article  Google Scholar 

  6. Gunter, E., Peled, D.: Unit Checking: Symbolic Model Checking for a Unit of Code. In: Dershowitz, N. (ed.) Verification: Theory and Practice. LNCS, vol. 2772, pp. 548–567. Springer, Heidelberg (2004)

    Google Scholar 

  7. Henzinger, T.A., Manna, Z., Pnueli, A.: Temporal proof methodologies for timed transition systems. Information and Computation 112, 273–337 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  8. Henzinger, T.A., Nicollin, X., Sifakis, J., Yovine, S.: Symbolic model checking for real-time systems. Information and Computation 111, 193–244 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  9. Scholefield, D.J., Zedan, H.S.M.: Weakest Precondition Semantics for Time and Concurrency. Information Processing Letters 43, 301–308 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  10. Warshall, S.: A theorem on boolean matrices. Journal of the ACM 9(1), 11–12 (1962)

    Article  MATH  MathSciNet  Google Scholar 

  11. Yovine, S.: Model checking timed automata. In: Rozenberg, G. (ed.) EEF School 1996. LNCS, vol. 1494, pp. 114–152. Springer, Heidelberg (1998)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Verimag, 2 Avenue de Vignate, 38610, Gieres, France

    Saddek Bensalem & Stavros Tripakis

  2. Department of Computer Science, University of Warwick, Coventry, CV4 7AL, United Kingdom

    Doron Peled & Hongyang Qu

Authors
  1. Saddek Bensalem
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Doron Peled
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hongyang Qu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Stavros Tripakis
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. of Mathematics and Computer Science, Technische Universiteit Eindhoven, P.O. Box 513, 5600, Eindhoven, MB, The Netherlands

    Judi Romijn

  2. School of Information Technology and Electrical Engineering, The University of Queensland, 4072, Australia

    Graeme Smith

  3. Formal Methods and Tools, Department of Computer Science, University of Twente, P.O. Box 217, 7500AE, Enschede, The Netherlands

    Jaco van de Pol

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bensalem, S., Peled, D., Qu, H., Tripakis, S. (2005). Generating Path Conditions for Timed Systems. In: Romijn, J., Smith, G., van de Pol, J. (eds) Integrated Formal Methods. IFM 2005. Lecture Notes in Computer Science, vol 3771. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11589976_2

Download citation

  • DOI: https://doi.org/10.1007/11589976_2

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation