This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Formal Methods in Computer Aided Design (FMCAD'06)
Assume-Guarantee Reasoning for Deadlock
San Jose, California, USA
November 12-November 16
ISBN: 0-7695-2707-8
Sagar Chaki, Software Engineering Institute
Nishant Sinha, Carnegie Mellon University
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.
Citation:
Sagar Chaki, Nishant Sinha, "Assume-Guarantee Reasoning for Deadlock," fmcad, pp.134-144, Formal Methods in Computer Aided Design (FMCAD'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.