| HAL-Inria | Publications, software ... of Inria's scientists |
Conference papers
Precise deadlock detection for polychronous data-flow specifications
Abstract : 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.
Cited literature [19 references]
https://hal.inria.fr/hal-01086843
Contributor : van Chan Ngo <>
Submitted on : Tuesday, November 25, 2014 - 10:07:19 AM
Last modification on : Tuesday, June 15, 2021 - 4:28:00 PM
Long-term archiving on: : Thursday, February 26, 2015 - 10:50:50 AM
Contributor : van Chan Ngo <>
Submitted on : Tuesday, November 25, 2014 - 10:07:19 AM
Last modification on : Tuesday, June 15, 2021 - 4:28:00 PM
Long-term archiving on: : Thursday, February 26, 2015 - 10:50:50 AM
File
ESLSYN14.pdf
Files produced by the author(s)