Learning register automata: from languages to program structures
From MaRDI portal
(Redirected from Publication:479461)
Recommendations
Cites work
- A Succinct Canonical Register Automaton Model
- A succinct canonical register automaton model for data domains with binary relations
- A theory of history dependent abstractions for learning interface automata
- A theory of timed automata
- Automata Learning through Counterexample Guided Abstraction Refinement
- Automata learning with automated alphabet abstraction refinement
- Domain-specific optimization in automata learning.
- Grammatical inference. Learning automata and grammars.
- scientific article; zbMATH DE number 1956591 (Why is no real title available?)
- scientific article; zbMATH DE number 2080060 (Why is no real title available?)
- scientific article; zbMATH DE number 1517989 (Why is no real title available?)
- scientific article; zbMATH DE number 2087513 (Why is no real title available?)
- scientific article; zbMATH DE number 1418458 (Why is no real title available?)
- Inference of finite automata using homing sequences
- Inferring canonical register automata
- Learning I/O automata
- Learning of event-recording automata
- Learning regular sets from queries and counterexamples
- Linear Automaton Transformations
- Mining specifications
- On the learnability of infinitary regular sets
- Refining Interface Alphabets for Compositional Verification
- Sigma*
- Symbolic execution and program testing
- Testing Software Design Modeled by Finite-State Machines
- The Daikon system for dynamic detection of likely invariants
Cited in
(27)- A novel learning algorithm for Büchi automata based on family of DFAs and classification trees
- Combining black-box and white-box techniques for learning register automata
- Efficient active automata learning via mutation testing
- LARS: a learning algorithm for rewriting systems
- Latent semantic analysis of game models using LSTM
- Learning register automata with fresh value generation
- Efficient unlinkable sanitizable signatures from signatures with re-randomizable keys
- Inferring canonical register automata
- Demonstrating Learning of Register Automata
- Efficiency in the identification in the limit learning paradigm
- A novel learning algorithm for Büchi automata based on family of DFAs and classification trees
- Query learning algorithm for residual symbolic finite automata
- A Myhill-Nerode theorem for register automata and symbolic trace languages
- 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
- From languages to behaviors and back
- Grey-Box Learning of Register Automata
- A Context-Free Symbiosis of Runtime Verification and Automata Learning
- Validating streaming JSON documents with learned VPAs
- Timed automata verification and synthesis via finite automata learning
- Active learning for sound negotiations
- Passive learning of regular data languages in polynomial time and data
- Unsupervised automata learning via discrete optimization
- FlexFringe: modeling software behavior by learning probabilistic automata
- Active learning for extended finite state machines
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)
