Learning register automata: from languages to program structures

DOI10.1007/s10994-013-5419-7zbMath1317.68097OpenAlexW2046160374MaRDI QIDQ479461

Falk Howar, Malte Isberner, Bernhard Steffen

Publication date: 5 December 2014

Published in: Machine Learning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10994-013-5419-7

zbMATH Keywords

formal methodssoftware engineeringregister automataactive automata learningalphabet abstraction refinement

Mathematics Subject Classification ID

Computational learning theory (68Q32) Formal languages and automata (68Q45)

Related Items

Never-stop context-free learning, A taxonomy and reductions for common register automata formalisms, On monitoring linear temporal properties, Compositional learning for interleaving parallel automata, Latent semantic analysis of game models using LSTM, From languages to behaviors and back, Efficiency in the Identification in the Limit Learning Paradigm, Unnamed Item, A Novel Learning Algorithm for Büchi Automata Based on Family of DFAs and Classification Trees, Efficient Unlinkable Sanitizable Signatures from Signatures with Re-randomizable Keys, Active learning for extended finite state machines, A novel learning algorithm for Büchi automata based on family of DFAs and classification trees, Efficient active automata learning via mutation testing

Uses Software

• Daikon
• Sigma*

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Learning of event-recording automata
• Learning regular sets from queries and counterexamples
• A theory of timed automata
• On the learnability of infinitary regular sets
• Inference of finite automata using homing sequences
• The Daikon system for dynamic detection of likely invariants
• Inferring Canonical Register Automata
• A Theory of History Dependent Abstractions for Learning Interface Automata
• Sigma*
• Automata Learning with Automated Alphabet Abstraction Refinement
• A Succinct Canonical Register Automaton Model
• Linear Automaton Transformations
• Learning I/O Automata
• Symbolic execution and program testing
• Testing Software Design Modeled by Finite-State Machines
• Automata Learning through Counterexample Guided Abstraction Refinement
• A Succinct Canonical Register Automaton Model for Data Domains with Binary Relations
• Mining specifications
• Refining Interface Alphabets for Compositional Verification
• Computer Aided Verification