Efficient Algorithms for the Inference of Minimum Size DFAs
Machine Learning
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
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
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
LearnLib: a framework for extrapolating behavioral models
International Journal on Software Tools for Technology Transfer (STTT) - Special Section on FMICS 05
Regular Model Checking Using Inference of Regular Languages
Electronic Notes in Theoretical Computer Science (ENTCS)
Learning Communicating Automata from MSCs
IEEE Transactions on Software Engineering
Antichains: a new algorithm for checking universality of finite automata
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Reachability games on automatic graphs
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
TACAS'11/ETAPS'11 Proceedings of the 17th international conference on Tools and algorithms for the construction and analysis of systems: part of the joint European conferences on theory and practice of software
Automated learning of probabilistic assumptions for compositional reasoning
FASE'11/ETAPS'11 Proceedings of the 14th international conference on Fundamental approaches to software engineering: part of the joint European conferences on theory and practice of software
Small strategies for safety games
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
PETRI NETS'10 Proceedings of the 31st international conference on Applications and Theory of Petri Nets
Fundamenta Informaticae - Applications and Theory of Petri Nets and Other Models of Concurrency, 2010
Asynchronous learning for service composition
ICSOC'11 Proceedings of the 2011 international conference on Service-Oriented Computing
Learning stochastic timed automata from sample executions
ISoLA'12 Proceedings of the 5th international conference on Leveraging Applications of Formal Methods, Verification and Validation: technologies for mastering change - Volume Part I
BULL: a library for learning algorithms of boolean functions
TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Learning universally quantified invariants of linear data structures
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
| Hi-index | 0.00 |
This paper presents libalf, a comprehensive, open-source library for learning formal languages libalf covers various well-known learning techniques for finite automata (e.g Angluin's L*, Biermann, RPNI etc.) as well as novel learning algorithms (such as for NFA and visibly one-counter automata) libalf is flexible and allows facilely interchanging learning algorithms and combining domain-specific features in a plug-and-play fashion Its modular design and C++ implementation make it a suitable platform for adding and engineering further learning algorithms for new target models (e.g., Büchi automata).