Skip to Main content Skip to Navigation
Journal articles

Analyzing Conflict Freedom For Multi-threaded Programs With Time Annotations

Jingshu Chen 1 Marie Duflot 1 Stephan Merz 1
1 VERIDIS - Modeling and Verification of Distributed Algorithms and Systems
MPII - Max-Planck-Institut für Informatik, Inria Nancy - Grand Est, LORIA - FM - Department of Formal Methods
Abstract : Avoiding access conflicts is a major challenge in the design of multi-threaded programs. In the context of real-time systems, the absence of conflicts can be guaranteed by ensuring that no two potentially conflicting accesses are ever scheduled concurrently.In this paper, we analyze programs that carry time annotations specifying the time for executing each statement. We propose a technique for verifying that a multi-threaded program with time annotations is free of access conflicts. In particular, we generate constraints that reflect the possible schedules for executing the program and the required properties. We then invoke an SMT solver in order to verify that no execution gives rise to concurrent conflicting accesses. Otherwise, we obtain a trace that exhibits the access conflict.
Complete list of metadatas

Cited literature [19 references]  Display  Hide  Download
Contributor : Stephan Merz <>
Submitted on : Thursday, November 27, 2014 - 2:41:07 AM
Last modification on : Tuesday, February 19, 2019 - 3:40:03 PM
Document(s) archivé(s) le : Monday, March 2, 2015 - 9:16:36 AM


Files produced by the author(s)


Distributed under a Creative Commons Attribution - NonCommercial 4.0 International License


  • HAL Id : hal-01087871, version 1
  • ARXIV : 1412.0961



Jingshu Chen, Marie Duflot, Stephan Merz. Analyzing Conflict Freedom For Multi-threaded Programs With Time Annotations. Electronic Communications of the EASST, 2014, Automated Verification of Critical Systems 2014, 70, pp.14. ⟨hal-01087871⟩



Record views


Files downloads