Three optimizations for Assume---Guarantee reasoning with L*
Formal Methods in System Design
Compositional deadlock detection for rendezvous communication
EMSOFT '09 Proceedings of the seventh ACM international conference on Embedded software
On the completeness of compositional reasoning methods
ACM Transactions on Computational Logic (TOCL)
Optimized L*-based assume-guarantee reasoning
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Automated assume-guarantee reasoning for omega-regular systems and specifications
Innovations in Systems and Software Engineering
| Hi-index | 0.00 |
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.