Learning regular sets from queries and counterexamples
Information and Computation
Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations
Theoretical Computer Science
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Well-abstracted transition systems: application to FIFO automata
Information and Computation
Actively learning to verify safety for FIFO automata
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Learning to verify branching time properties
Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering
Learning to verify branching time properties
Formal Methods in System Design
Automatic symbolic compositional verification by learning assumptions
Formal Methods in System Design
Hybrid test of web applications with webtest
TAV-WEB '08 Proceedings of the 2008 workshop on Testing, analysis, and verification of web services and applications
A machine learning approach for statistical software testing
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
FMCO'06 Proceedings of the 5th international conference on Formal methods for components and objects
Structural statistical software testing with active learning in a graph
ILP'07 Proceedings of the 17th international conference on Inductive logic programming
On (Omega-)regular model checking
ACM Transactions on Computational Logic (TOCL)
Iterative refinement of specification for component based embedded systems
Proceedings of the 2011 International Symposium on Software Testing and Analysis
LEVER: a tool for learning based verification
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Inferring network invariants automatically
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Using language inference to verify omega-regular properties
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Symbolic compositional verification by learning assumptions
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Actively learning to verify safety for FIFO automata
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Minimization, learning, and conformance testing of boolean programs
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
| Hi-index | 0.00 |
We apply machine learning techniques to verify safety properties of finite state machines which communicate over unbounded FIFO channels. Instead of attempting to iteratively compute the reachable states, we use Angluin’s L* algorithm to learn these states symbolically as a regular language. The learnt set of reachable states is then used either to prove that the system is safe, or to produce a valid execution of the system that leads to an unsafe state (i.e. to produce a counterexample). Specifically, we assume that we are given a model of the system and we provide a novel procedure which answers both membership and equivalence queries for a representation of the reachable states. We define a new encoding scheme for representing reachable states and their witness execution; this enables the learning algorithm to analyze a larger class of FIFO systems automatically than a naive encoding would allow. We show the upper bounds on the running time and space for our method. We have implemented our approach in Java, and we demonstrate its application to a few case studies.