San Jose, CA
Nov. 12, 2006 to Nov. 16, 2006
Sagar Chaki , Software Engineering Institute
Nishant Sinha , Carnegie Mellon University
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/FMCAD.2006.8
We extend the learning-based automated assume guarantee paradigm to perform compositional deadlock detection. We define Failure Automata, a generalization of finite automata that accept regular failure sets. We develop a learning algorithm L^F that constructs the minimal deterministic failure automaton accepting any unknown regular failure set using a minimally adequate teacher. We show how L^F can be used for compositional regular failure language containment, and deadlock detection, using non-circular and circular assume guarantee rules. We present an implementation of our techniques and encouraging experimental results on several non-trivial benchmarks.
Sagar Chaki, Nishant Sinha, "Assume-Guarantee Reasoning for Deadlock", FMCAD, 2006, 2006 Formal Methods in Computer-Aided Design, 2006 Formal Methods in Computer-Aided Design 2006, pp. 134-144, doi:10.1109/FMCAD.2006.8