Precise deadlock detection for polychronous data-flow specifications - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2014

Precise deadlock detection for polychronous data-flow specifications


Dependency graphs are a commonly used data structure to encode the streams of values in data-flow programs and play a central role in scheduling instructions during auto-mated code generation from such specifications. In this work, we propose a precise and effective method that combines a structure of dependency graph and first order logic formulas to check whether multi-clocked data-flow specifications are deadlock free before generating code from them. We represent the flow of values in the source programs by means of a dependency graph and attach first-order logic formulas to condition these dependencies. We use an SMT solver to effectively reason about the implied formulas and check deadlock freedom.
Fichier principal
Vignette du fichier
ESLSYN14.pdf (154.29 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-01086843 , version 1 (25-11-2014)



van Chan Ngo, Jean-Pierre Talpin, Thierry Gautier. Precise deadlock detection for polychronous data-flow specifications. ESLsyn - DAC 2014, May 2014, San Francisco, United States. ⟨10.1109/ESLsyn.2014.6850379⟩. ⟨hal-01086843⟩
454 View
320 Download



Gmail Mastodon Facebook X LinkedIn More