Demonstrating learning of register automata

Authors:
Maik Merten;Falk Howar;Bernhard Steffen;Sofia Cassel;Bengt Jonsson
Affiliations:
Chair for Programming Systems, Technical University Dortmund, Dortmund, Germany;Chair for Programming Systems, Technical University Dortmund, Dortmund, Germany;Chair for Programming Systems, Technical University Dortmund, Dortmund, Germany;Dept. of Information Technology, Uppsala University, Sweden;Dept. of Information Technology, Uppsala University, Sweden
Venue:
TACAS'12 Proceedings of the 18th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Year:
2012

Citing 7
Cited 3

Learning regular sets from queries and counterexamples

Information and Computation
A Unifying Approach to Data-Independence

CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
CONNECT Challenges: Towards Emergent Connectors for Eternal Networked Systems

ICECCS '09 Proceedings of the 2009 14th IEEE International Conference on Engineering of Complex Computer Systems
Inference and abstraction of the biometric passport

ISoLA'10 Proceedings of the 4th international conference on Leveraging applications of formal methods, verification, and validation - Volume Part I
Next generation learnlib

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
A succinct canonical register automaton model

ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
Inferring canonical register automata

VMCAI'12 Proceedings of the 13th international conference on Verification, Model Checking, and Abstract Interpretation

LearnLib tutorial: from finite automata to register interface programs

ISoLA'12 Proceedings of the 5th international conference on Leveraging Applications of Formal Methods, Verification and Validation: technologies for mastering change - Volume Part I
Automated learning setups in automata learning

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

We will demonstrate the impact of the integration of our most recently developed learning technology for inferring Register Automata into the LearnLib, our framework for active automata learning. This will not only illustrate the unique power of Register Automata, which allows one to faithfully model data independent systems, but also the ease of enhancing the LearnLib with new functionality.