Learning regular sets from queries and counterexamples
Information and Computation
Inference of finite automata using homing sequences
Information and Computation
An introduction to computational learning theory
An introduction to computational learning theory
Proceedings of the 16th IEEE international conference on Automated software engineering
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
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
Formal Methods in System Design
FMCO'06 Proceedings of the 5th international conference on Formal methods for components and objects
LEVER: a tool for learning based verification
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Hi-index | 0.00 |
We present a new model checking algorithm for verifying computation tree logic (CTL) properties. To our knowledge, this is the first CTL model checking algorithm for infinite state systems that can also handle fairness constraints. Our technique is based on using language inference to learn the fixpoints necessary for checking a CTL formula instead of computing them iteratively as is done in traditional model checking. This allows us to analyze infinite or large state-space systems where the traditional iterations may not converge or may take too long to converge. Our procedure is guaranteed to terminate with the correct answer if fixpoints needed for all subformulas of the CTL property are regular. We have extended our LEVER tool to use the technique presented in this paper and demonstrate its effectiveness by verifying a number of parametric and integer systems.