Learning Meets Verification

In this paper, we give an overview on some algorithms for learning automata. Starting with Biermann's and Angluin's algorithms, we describe some of the extensions catering for specialized or richer classes of automata. Furthermore, we survey their recent application to verification problems.

[1]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[2]  Helmut Veith,et al.  Environment Abstraction for Parameterized Verification , 2006, VMCAI.

[3]  Randal E. Bryant,et al.  Symbolic Manipulation of Boolean Functions Using a Graphical Representation , 1985, 22nd ACM/IEEE Design Automation Conference.

[4]  T. Kanade.  Model-Based Testing of Reactive Systems , 2005 .

[5]  Aleksandar Dimovski,et al.  Assume-Guarantee Software Verification Based on Game Semantics , 2006, ICFEM.

[6]  Kedar S. Namjoshi,et al.  On the Competeness of Compositional Reasoning , 2000, CAV.

[7]  Marco Pistore,et al.  Nusmv version 2: an opensource tool for symbolic model checking , 2002, CAV 2002.

[8]  M. P. Vasilevskii.  Failure diagnosis of automata , 1973 .

[9]  Boris A. Trakhtenbrot,et al.  Finite automata : behavior and synthesis , 1973 .

[10]  E. Mark Gold,et al.  Language Identification in the Limit , 1967, Inf. Control..

[11]  Jerome A. Feldman,et al.  On the Synthesis of Finite-State Machines from Samples of Their Behavior , 1972, IEEE Transactions on Computers.

[12]  Manfred Broy,et al.  Model-Based Testing of Reactive Systems: Advanced Lectures (Lecture Notes in Computer Science) , 2005 .

[13]  Marcus Nilsson,et al.  Transitive Closures of Regular Relations for Verifying Infinite-State Systems , 2000, TACAS.

[14]  Joseph Sifakis,et al.  Automatic Verification Methods for Finite State Systems , 1989, Lecture Notes in Computer Science.

[15]  Kevin J. Lang.  Random DFA's can be approximately learned from sparse uniform examples , 1992, COLT '92.

[16]  Amir Pnueli,et al.  On the learnability of infinitary regular sets , 1991, COLT '91.

[17]  Hardi Hungar,et al.  Domain-Specific Optimization in Automata Learning , 2003, CAV.

[18]  Frank Drewes,et al.  Learning a Regular Tree Language from a Teacher , 2003, Developments in Language Theory.

[19]  E. Mark Gold,et al.  Complexity of Automaton Identification from Given Data , 1978, Inf. Control..

[20]  Helmut Veith,et al.  Verification by Network Decomposition , 2004, CONCUR.

[21]  Pierre Wolper,et al.  Verifying Properties of Large Sets of Processes with Network Invariants , 1990, Automatic Verification Methods for Finite State Systems.

[22]  Parosh Aziz Abdulla,et al.  A Survey of Regular Model Checking , 2004, CONCUR.

[23]  José L. Balcázar,et al.  Algorithms for Learning Finite Automata from Queries: A Unified View , 1997, Advances in Algorithms, Languages, and Complexity.

[24]  Mahesh Viswanathan,et al.  Using Language Inference to Verify Omega-Regular Properties , 2005, TACAS.

[25]  Martin Leucker,et al.  Inferring Network Invariants Automatically , 2006, IJCAR.

[26]  Bengt Jonsson,et al.  On the Correspondence Between Conformance Testing and Regular Inference , 2005, FASE.

[27]  J. Oncina,et al.  INFERRING REGULAR LANGUAGES IN POLYNOMIAL UPDATED TIME , 1992 .

[28]  Rajeev Alur,et al.  Symbolic Compositional Verification by Learning Assumptions , 2005, CAV.

[29]  Marco Pistore,et al.  NuSMV 2: An OpenSource Tool for Symbolic Model Checking , 2002, CAV.

[30]  Tomás Vojnar,et al.  Regular Model Checking Using Inference of Regular Languages , 2004, INFINITY.

[31]  Mahesh Viswanathan,et al.  Actively Learning to Verify Safety for FIFO Automata , 2004, FSTTCS.

[32]  Amir Pnueli,et al.  Bridging the gap between fair simulation and trace inclusion , 2005, Inf. Comput..

[33]  Bengt Jonsson,et al.  Inference of Timed Transition Systems , 2004, INFINITY.

[34]  Wolfgang Thomas,et al.  Automata on Infinite Objects , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[35]  AngluinDana.  Learning regular sets from queries and counterexamples , 1987 .

[36]  Harald Raffelt,et al.  LearnLib: a library for automata learning and experimentation , 2005, FMICS '05.

[37]  Alex Groce,et al.  Adaptive Model Checking , 2006, Log. J. IGPL.

[38]  A. Pnueli,et al.  On the learnability of infinitary regular sets , 1991, COLT 1991.

[39]  Tsun S. Chow,et al.  Testing Software Design Modeled by Finite-State Machines , 1978, IEEE Transactions on Software Engineering.

[40]  Sagar Chaki,et al.  Automated Assume-Guarantee Reasoning for Simulation Conformance , 2005, CAV.

[41]  Parosh Aziz Abdulla,et al.  Algorithmic Improvements in Regular Model Checking , 2003, CAV.

[42]  Benedikt Bollig,et al.  Replaying Play In and Play Out: Synthesis of Design Models from Scenarios by Learning , 2007, TACAS.

[43]  Dana Angluin,et al.  Learning Regular Sets from Queries and Counterexamples , 1987, Inf. Comput..

[44]  Deepak D'Souza.  A Logical Characterisation of Event Clock Automata , 2003, Int. J. Found. Comput. Sci..

[45]  Corina S. Pasareanu,et al.  Learning Assumptions for Compositional Verification , 2003, TACAS.

[46]  Kedar S. Namjoshi,et al.  Reasoning about rings , 1995, POPL '95.

[47]  Rajeev Alur,et al.  A Theory of Timed Automata , 1994, Theor. Comput. Sci..

[48]  Robert P. Kurshan,et al.  A structural induction theorem for processes , 1989, PODC.

[49]  Bengt Jonsson,et al.  Insights to Angluin's Learning , 2005, SVV@ICLP.

[50]  Arlindo L. Oliveira,et al.  A new algorithm for the reduction of incompletely specified finite state machines , 1998, ICCAD.

[51]  Manfred Broy,et al.  Model-Based Testing of Reactive Systems, Advanced Lectures , 2005 .

[52]  Joao Marques-Silva,et al.  Efficient Algorithms for the Inference of Minimum Size DFAs , 2001, Machine Learning.

[53]  Stephan Merz,et al.  Model Checking , 2000 .

[54]  Bengt Jonsson,et al.  Inference of Event-Recording Automata Using Timed Decision Trees , 2006, CONCUR.

[55]  Perdita Stevens,et al.  Modelling Recursive Calls with UML State Diagrams , 2003, FASE.

[56]  Mihalis Yannakakis,et al.  Black Box Checking , 1999, FORTE.

[57]  Pavol Cerný,et al.  Synthesis of interface specifications for Java classes , 2005, POPL '05.

[58]  Bengt Jonsson,et al.  Learning of event-recording automata , 2010, Theor. Comput. Sci..

[59]  Mahesh Viswanathan,et al.  Learning to Verify Safety Properties , 2004, ICFEM.

[60]  Mahesh Viswanathan,et al.  Learning to verify branching time properties , 2007, Formal Methods Syst. Des..

[61]  Bengt Jonsson,et al.  Regular Inference for State Machines with Parameters , 2006, FASE.

[62]  Amir Pnueli,et al.  Liveness and Acceleration in Parameterized Verification , 2000, CAV.

[63]  Amir Pnueli,et al.  Network Invariants in Action , 2002, CONCUR.

[64]  Amir Pnueli,et al.  Control and data abstraction: the cornerstones of practical formal verification , 2000, International Journal on Software Tools for Technology Transfer.

[65]  Krzysztof R. Apt,et al.  Limits for Automatic Verification of Finite-State Concurrent Systems , 1986, Inf. Process. Lett..

[66]  Vineet Kahlon,et al.  Reducing Model Checking of the Many to the Few , 2000, CADE.