Communicating sequential processes
Communicating sequential processes
Learning regular sets from queries and counterexamples
Information and Computation
Proceedings of the Fourth Annual Symposium on Logic in computer science
In transition from global to modular temporal reasoning about programs
Logics and models of concurrent systems
Model checking and modular verification
ACM Transactions on Programming Languages and Systems (TOPLAS)
Inference of finite automata using homing sequences
Information and Computation
On the learnability of infinitary regular sets
Information and Computation
Decomposing refinement proofs using assume-guarantee reasoning
Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design
Ultimately Periodic Words of Rational w-Languages
Proceedings of the 9th International Conference on Mathematical Foundations of Programming Semantics
Assume-Guarantee Reasoning for Deadlock
FMCAD '06 Proceedings of the Formal Methods in Computer Aided Design
Proofs of Networks of Processes
IEEE Transactions on Software Engineering
Automated Compositional Reasoning of Intuitionistically Closed Regular Properties
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
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
Refining interface alphabets for compositional verification
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Learning assumptions for compositional verification
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
SAT-based compositional verification using lazy learning
CAV'07 Proceedings of the 19th international conference on Computer aided verification
Extending automated compositional verification to the full class of omega-regular languages
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Automated assume-guarantee reasoning for simulation conformance
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Symbolic compositional verification by learning assumptions
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Automatic derivation of compositional rules in automated compositional reasoning
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Hi-index | 0.00 |
We develop a learning-based automated assume-guarantee (AG) reasoning framework for verifying 驴-regular properties of concurrent systems. We study the applicability of non-circular (AG-NC) and circular (AG-C) AG proof rules in the context of systems with infinite behaviors. In particular, we show that AG-NC is incomplete when assumptions are restricted to strictly infinite behaviors, while AG-C remains complete. We present a general formalization, called LAG, of the learning based automated AG paradigm. We show how existing approaches for automated AG reasoning are special instances of LAG. We develop two learning algorithms for a class of systems, called 驴-regular systems, that combine finite and infinite behaviors. We show that for 驴-regular systems, both AG-NC and AG-C are sound and complete. Finally, we show how to instantiate LAG to do automated AG reasoning for 驴-regular, and 驴-regular, systems using both AG-NC and AG-C as proof rules.