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.
https://hal.inria.fr/hal-01086843
Contributeur : Van Chan Ngo
<>
Soumis le : mardi 25 novembre 2014 - 10:07:19
Dernière modification le : mercredi 11 avril 2018 - 02:00:53
Document(s) archivé(s) le : jeudi 26 février 2015 - 10:50:50
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. 2014, 〈10.1109/ESLsyn.2014.6850379〉. 〈hal-01086843〉
