LearnLib: a library for automata learning and experimentation

In this paper we present the LearnLib, a library for automata learning and experimentation. Its modular structure allows users to configure their tailored learning scenarios, which exploit specific properties of the envisioned applications. As has been shown earlier, exploiting application-specific structural features enables optimizations that may lead to performance gains of several orders of magnitude, a necessary precondition to make automata learning applicable to realistic scenarios.

[1]  Michael D. Ernst,et al.  Automatic generation of program specifications , 2002, ISSTA '02.

[2]  Tiziana Margaria,et al.  Analyzing second-order effects between optimizations for system-level test-based model generation , 2005, IEEE International Conference on Test, 2005..

[3]  T. Margaria,et al.  Test-based model generation for legacy systems , 2003, International Test Conference, 2003. Proceedings. ITC 2003..

[4]  Tiziana Margaria,et al.  Library-Based Design and Consistency Checking of System-Level Industrial Test Cases , 2001, FASE.

[5]  T. Margaria,et al.  Efficient Regression Testing of CTI-Systems : Testing a complex Call-Center Solution , 2001 .

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

[7]  Ferhat Khendek,et al.  Test Selection Based on Finite State Models , 1991, IEEE Trans. Software Eng..

[8]  Hardi Hungar,et al.  Model Generation by Moderated Regular Extrapolation , 2002, FASE.

[9]  Jianping Wu,et al.  Formal Methods for Protocol Engineering and Distributed Systems , 1999, IFIP Advances in Information and Communication Technology.

[10]  Tiziana Margaria,et al.  System level testing of virtual switch (re-)configuration over IP , 2002, Proceedings The Seventh IEEE European Test Workshop.

[11]  David Notkin,et al.  Mutually Enhancing Test Generation and Specification Inference , 2003, FATES.

[12]  William G. Griswold,et al.  Quickly detecting relevant program invariants , 2000, Proceedings of the 2000 International Conference on Software Engineering. ICSE 2000 the New Millennium.

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

[14]  L WolfAlexander,et al.  Discovering models of software processes from event-based data , 1998 .

[15]  Leonardo Mariani,et al.  A Technique for Verifying Component-Based Software , 2005, Electron. Notes Theor. Comput. Sci..

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

[17]  Anna Philippou,et al.  Tools and Algorithms for the Construction and Analysis of Systems , 2018, Lecture Notes in Computer Science.

[18]  Tiziana Margaria,et al.  jETI: A Tool for Remote Tool Integration , 2005, TACAS.

[19]  Fabrizio Lombardi,et al.  Protocol conformance testing using multiple UIO sequences , 1989, IEEE Trans. Commun..

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

[21]  David Lee,et al.  Principles and methods of testing finite state machines-a survey , 1996, Proc. IEEE.

[22]  Yuriy Brun,et al.  Finding latent code errors via machine learning over program executions , 2004, Proceedings. 26th International Conference on Software Engineering.

[23]  Tiziana Margaria,et al.  Remote integration and coordination of verification tools in jETI , 2005, 12th IEEE International Conference and Workshops on the Engineering of Computer-Based Systems (ECBS'05).

[24]  Hubert Garavel,et al.  OPEN/CÆSAR: An OPen Software Architecture for Verification, Simulation, and Testing , 1998, TACAS.

[25]  Hardi Hungar,et al.  Behavior-Based Model Construction , 2003, VMCAI.

[26]  Giuseppe Scollo,et al.  Proceedings of the IFIP WG6.1 Ninth International Symposium on Protocol Specification, Testing and Verification IX , 1989 .

[27]  Tiziana Margaria,et al.  Efficient test-based model generation for legacy reactive systems , 2004, Proceedings. Ninth IEEE International High-Level Design Validation and Test Workshop (IEEE Cat. No.04EX940).

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