Learning register automata: from languages to program structures

DOI10.1007/S10994-013-5419-7zbMATH Open1317.68097OpenAlexW2046160374MaRDI QIDQ479461FDOQ479461

Authors: Malte Isberner, Falk Howar, 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

Recommendations

• Inferring canonical register automata
• Demonstrating Learning of Register Automata
• A fresh approach to learning register automata
• Combining black-box and white-box techniques for learning register automata
• Learning register automata with fresh value generation

zbMATH Keywords

formal methodssoftware engineeringactive automata learningalphabet abstraction refinementregister automata

Mathematics Subject Classification ID

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

Cites Work

• The Daikon system for dynamic detection of likely invariants
• Sigma*
• A theory of timed automata
• Learning regular sets from queries and counterexamples
• A theory of history dependent abstractions for learning interface automata
• Title not available (Why is that?)
• Title not available (Why is that?)
• Refining Interface Alphabets for Compositional Verification
• Symbolic execution and program testing
• Testing Software Design Modeled by Finite-State Machines
• Mining specifications
• On the learnability of infinitary regular sets
• Grammatical inference. Learning automata and grammars.
• Title not available (Why is that?)
• Learning I/O automata
• Inference of finite automata using homing sequences
• Title not available (Why is that?)
• Domain-specific optimization in automata learning.
• Linear Automaton Transformations
• Inferring canonical register automata
• Automata learning with automated alphabet abstraction refinement
• A Succinct Canonical Register Automaton Model
• Automata Learning through Counterexample Guided Abstraction Refinement
• A succinct canonical register automaton model for data domains with binary relations
• Title not available (Why is that?)
• Learning of event-recording automata

Cited In (24)

• Efficient active automata learning via mutation testing
• Compositional learning for interleaving parallel automata
• Grey-Box Learning of Register Automata
• Never-stop context-free learning
• Efficiency in the identification in the limit learning paradigm
• From languages to behaviors and back
• Latent semantic analysis of game models using LSTM
• Active learning for extended finite state machines
• A novel learning algorithm for Büchi automata based on family of DFAs and classification trees
• A novel learning algorithm for Büchi automata based on family of DFAs and classification trees
• Demonstrating Learning of Register Automata
• A Myhill-Nerode theorem for register automata and symbolic trace languages
• Efficient unlinkable sanitizable signatures from signatures with re-randomizable keys
• A Context-Free Symbiosis of Runtime Verification and Automata Learning
• Active learning for sound negotiations
• A taxonomy and reductions for common register automata formalisms
• Combining black-box and white-box techniques for learning register automata
• Title not available (Why is that?)
• On monitoring linear temporal properties
• Validating streaming JSON documents with learned VPAs
• Timed automata verification and synthesis via finite automata learning
• Inferring canonical register automata
• LARS: a learning algorithm for rewriting systems
• Learning register automata with fresh value generation

Uses Software

• Daikon
• Sigma*

This page was built for publication: Learning register automata: from languages to program structures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q479461)