Learning regular sets from queries and counterexamples
Information and Computation
The concurrency workbench: a semantics-based tool for the verification of concurrent systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
Memory-efficient algorithms for the verification of temporal properties
Formal Methods in System Design - Special issue on computer-aided verification: general methods
FORTE XII / PSTV XIX '99 Proceedings of the IFIP TC6 WG6.1 Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols (FORTE XII) and Protocol Specification, Testing and Verification (PSTV XIX)
Counterexample-Guided Abstraction Refinement
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Testing Software Design Modeled by Finite-State Machines
IEEE Transactions on Software Engineering
Behavior-Based Model Construction
VMCAI 2003 Proceedings of the 4th International Conference on Verification, Model Checking, and Abstract Interpretation
AMC: An Adaptive Model Checker
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
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
Breaking up is hard to do: An evaluation of automated assume-guarantee reasoning
ACM Transactions on Software Engineering and Methodology (TOSEM)
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
Failure-free coordinators synthesis for component-based architectures
Science of Computer Programming
Architecting Dependable Systems V
Using formal specifications to support testing
ACM Computing Surveys (CSUR)
Interface Generation and Compositional Verification in JavaPathfinder
FASE '09 Proceedings of the 12th International Conference on Fundamental Approaches to Software Engineering: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Inference of Timed Transition Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Adaptive Verification using Forced Simulation
Electronic Notes in Theoretical Computer Science (ENTCS)
Insights to Angluin's Learning
Electronic Notes in Theoretical Computer Science (ENTCS)
Model checking and testing combined
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
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
FMCO'06 Proceedings of the 5th international conference on Formal methods for components and objects
Regular inference for state machines using domains with equality tests
FASE'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Fundamental approaches to software engineering
Learning of event-recording automata
Theoretical Computer Science
Representing, learning and extracting temporal knowledge from neural networks: a case study
ICANN'10 Proceedings of the 20th international conference on Artificial neural networks: Part II
Generating models of infinite-state communication protocols using regular inference with abstraction
ICTSS'10 Proceedings of the 22nd IFIP WG 6.1 international conference on Testing software and systems
Inferring compact models of communication protocol entities
ISoLA'10 Proceedings of the 4th international conference on Leveraging applications of formal methods, verification, and validation - Volume Part I
Scientific Theories of Computational Systems in Model Checking
Minds and Machines
Iterative refinement of specification for component based embedded systems
Proceedings of the 2011 International Symposium on Software Testing and Analysis
Learning finite cover automata from queries
Journal of Computer and System Sciences
Assume-guarantee software verification based on game semantics
ICFEM'06 Proceedings of the 8th international conference on Formal Methods and Software Engineering
FORTE'06 Proceedings of the 26th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Dynamic component substitutability analysis
FM'05 Proceedings of the 2005 international conference on Formal Methods
On the correspondence between conformance testing and regular inference
FASE'05 Proceedings of the 8th international conference, held as part of the joint European Conference on Theory and Practice of Software conference on Fundamental Approaches to Software Engineering
libalf: the automata learning framework
CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
Automated assume-guarantee reasoning for simulation conformance
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Minimization, learning, and conformance testing of boolean programs
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Inference of event-recording automata using timed decision trees
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Regular inference for state machines with parameters
FASE'06 Proceedings of the 9th international conference on Fundamental Approaches to Software Engineering
SPIN'06 Proceedings of the 13th international conference on Model Checking Software
Learning-Based test programming for programmers
ISoLA'12 Proceedings of the 5th international conference on Leveraging Applications of Formal Methods, Verification and Validation: technologies for mastering change - Volume Part I
| Hi-index | 0.00 |
We consider the case where inconsistencies are present between a system and its corresponding model, used for automatic verification. Such inconsistencies can be the result of modeling errors or recent modifications of the system. Despite such discrepancies we can still attempt to perform automatic verification. In fact, as we show, we can sometimes exploit the verification results to assist in automatically learning the required updates to the model. In a related previous work, we have suggested the idea of black box checking, where verification starts without any model, and the model is obtained while repeated verification attempts are performed. Under the current assumptions, an existing inaccurate (but not completely obsolete) model is used to expedite the updates. We use techniques from black box testing and machine learning. We present an implementation of the proposed methodology called AMC (for Adaptive Model Checking). We discuss some experimental results, comparing various tactics of updating a model while trying to perform model checking.