Automatic generation of path conditions for concurrent timed systems

Authors:
Saddek Bensalem;Doron Peled;Hongyang Qu;Stavros Tripakis
Affiliations:
Verimag, 2 Avenue de Vignate, 38610 Gieres, France;Deptment of Computer Science, Bar-Ilan University, Ramat Gan 52900, Israel;Department of Computing, Imperial College London, London SW7 2RH, UK;Verimag, 2 Avenue de Vignate, 38610 Gieres, France
Venue:
Theoretical Computer Science
Year:
2008

Citing 10
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
Partial Order Reductions for Timed Systems

CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
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	5.26

Visualization

Abstract

This paper presents an automatic method for calculating the path condition for programs with real time constraints. We model concurrent systems using timed transition systems and translate them into extended timed automata. Then an acyclic extended timed automaton is constructed and the path condition is calculated backwards over it. This method can be used for semiautomatic verification of a unit of code in isolation, i.e., without providing the exact values of parameters with which it is called. It can also be used for test case generation for real-time systems. Such a symbolic model checking algorithm was implemented previous in the PET system [E. Gunter, D. Peled, Unit checking: Symbolic model checking for a unit of code, Verification: Theory and Practice 2003, Essays Dedicated to Zohar Manna on the Occasion of his 64th Birthday, Lecture Notes in Computer Science, vol. 2772, Springer, 548-567] for untimed systems. 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 timing constraints of alternative choices in the code.