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
Inference of finite automata using homing sequences
Information and Computation
Checking safety properties using compositional reachability analysis
ACM Transactions on Software Engineering and Methodology (TOSEM)
Concurrency: state models & Java programs
Concurrency: state models & Java programs
Thread-Modular Verification for Shared-Memory Programs
ESOP '02 Proceedings of the 11th European Symposium on Programming Languages and Systems
Compositional State Space Generation from Lotos Programs
TACAS '97 Proceedings of the Third International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Model Checking and Modular Verification
CONCUR '91 Proceedings of the 2nd International Conference on Concurrency Theory
MOCHA: Modularity in Model Checking
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Counterexample-Guided Abstraction Refinement
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Assumption Generation for Software Component Verification
Proceedings of the 17th IEEE international conference on Automated software engineering
Synthesis of interface specifications for Java classes
Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Proceedings of the 10th European software engineering conference held jointly with 13th ACM SIGSOFT international symposium on Foundations of software engineering
Breaking up is hard to do: an investigation of decomposition for assume-guarantee reasoning
Proceedings of the 2006 international symposium on Software testing and analysis
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
Learning assumptions for compositional verification
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
Dynamic component substitutability analysis
FM'05 Proceedings of the 2005 international conference on Formal Methods
Symbolic compositional verification by learning assumptions
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Learning-based symbolic assume-guarantee reasoning with automatic decomposition
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
SPIN'06 Proceedings of the 13th international conference on Model Checking Software
Breaking up is hard to do: An evaluation of automated assume-guarantee reasoning
ACM Transactions on Software Engineering and Methodology (TOSEM)
Learning to divide and conquer: applying the L* algorithm to automate assume-guarantee reasoning
Formal Methods in System Design
Verification of evolving software via component substitutability analysis
Formal Methods in System Design
Three optimizations for Assume---Guarantee reasoning with L*
Formal Methods in System Design
Assume-Guarantee Verification for Interface Automata
FM '08 Proceedings of the 15th international symposium on Formal Methods
Automated Assume-Guarantee Reasoning by Abstraction Refinement
CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
Learning Minimal Separating DFA's for Compositional Verification
TACAS '09 Proceedings of the 15th International Conference on Tools and Algorithms for the Construction and Analysis of Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009,
Automated interface refinement for compositional verification
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
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
SAT-based compositional verification using lazy learning
CAV'07 Proceedings of the 19th international conference on Computer aided verification
Compositional model checking of software product lines using variation point obligations
Automated Software Engineering
Automated assume-guarantee reasoning for omega-regular systems and specifications
Innovations in Systems and Software Engineering
Information and Software Technology
Automated assume-guarantee reasoning through implicit learning
CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
Learning boolean functions incrementally
CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
Symbolic learning of component interfaces
SAS'12 Proceedings of the 19th international conference on Static Analysis
Hybrid learning: interface generation through static, dynamic, and symbolic analysis
Proceedings of the 2013 International Symposium on Software Testing and Analysis
| Hi-index | 0.00 |
Techniques for learning automata have been adapted to automatically infer assumptions in assume-guarantee compositional verification. Learning, in this context, produces assumptions and modifies them using counterexamples obtained by model checking components separately. In this process, the interface alphabets between components, that constitute the alphabets of the assumption automata, are fixed: they include all actions through which the components communicate. This paper introduces alphabet refinement, a novel technique that extends the assumption learning process to also infer interface alphabets. The technique starts with only a subset of the interface alphabet and adds actions to it as necessary until a given property is shown to hold or to be violated in the system. Actions to be added are discovered by counterexample analysis. We show experimentally that alphabet refinement improves the current learning algorithms and makes compositional verification by learning assumptions more scalable than non-compositional verification.