Generating path conditions for timed systems

Authors:
Saddek Bensalem;Doron Peled;Hongyang Qu;Stavros Tripakis
Affiliations:
Verimag, Gieres, France;Department of Computer Science, University of Warwick, Coventry, United Kingdom;Department of Computer Science, University of Warwick, Coventry, United Kingdom;Verimag, Gieres, France
Venue:
IFM'05 Proceedings of the 5th international conference on Integrated Formal Methods
Year:
2005

Citing 9
Cited 0

Weakest precondition semantics for time and concurrency

Information Processing Letters
A theory of timed automata

Theoretical Computer Science
Temporal proof methodologies for timed transition systems

Information and Computation
Symbolic model checking for real-time systems

Information and Computation
A Theorem on Boolean Matrices

Journal of the ACM (JACM)
Guarded commands, nondeterminacy and formal derivation of programs

Communications of the ACM
Algorithm 97: Shortest path

Communications of the ACM
Timing Assumptions and Verification of Finite-State Concurrent Systems

Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems
Model Checking Timed Automata

Lectures on Embedded Systems, European Educational Forum, School on Embedded Systems

Quantified Score

Hi-index	0.00

Visualization

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.