Inferring Canonical Register Automata
From MaRDI portal
Publication:2891417
DOI10.1007/978-3-642-27940-9_17zbMath1326.68168OpenAlexW100976464MaRDI QIDQ2891417
Bernhard Steffen, Sofia Cassel, Falk Howar, Bengt Jonsson
Publication date: 15 June 2012
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-27940-9_17
Related Items
Learning One-Clock Timed Automata, Inferring regular languages and \(\omega\)-languages, Model checking, synthesis, and learning, Never-stop context-free learning, Active automata learning as black-box search and lazy partition refinement, Concurrent Kleene algebra with observations: from hypotheses to completeness, A succinct canonical register automaton model, Learning register automata: from languages to program structures, Generative program analysis and beyond: the power of domain-specific languages (invited paper), A Novel Learning Algorithm for Büchi Automata Based on Family of DFAs and Classification Trees, Polynomial Identification of $$\omega $$-Automata, Learning Transparent Data Automata, 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
Uses Software
Cites Work
- Unnamed Item
- Learning regular sets from queries and counterexamples
- Deciding bisimulation equivalences for a class of non-finite-state programs
- Finite-memory automata
- Inference of finite automata using homing sequences
- The Daikon system for dynamic detection of likely invariants
- Model-based testing of reactive systems. Advanced lectures.
- Automata Learning with Automated Alphabet Abstraction Refinement
- A Succinct Canonical Register Automaton Model
- Mining specifications
- Computer Aided Verification
