Learning Meets Verification
From MaRDI portal
Recommendations
Cites work
- A Logical Characterisation of Event Clock Automata
- A structural induction theorem for processes
- A survey of regular model checking
- A theory of timed automata
- Actively learning to verify safety for FIFO automata
- Adaptive model checking
- Algorithmic improvements in regular model checking.
- Automated assume-guarantee reasoning for simulation conformance
- Bridging the gap between fair simulation and trace inclusion
- Complexity of automaton identification from given data
- Control and data abstraction: The cornerstones of practical formal verification
- Domain-specific optimization in automata learning.
- Efficient algorithms for the inference of minimum size DFAs
- Fundamental approaches to software engineering. 9th international conference, FASE 2006, held as part of the joint European conferences on theory and practice of software, ETAPS 2006, Vienna, Austria, March 27--28, 2006. Proceedings
- scientific article; zbMATH DE number 3427224 (Why is no real title available?)
- scientific article; zbMATH DE number 1008506 (Why is no real title available?)
- scientific article; zbMATH DE number 1142314 (Why is no real title available?)
- scientific article; zbMATH DE number 1418458 (Why is no real title available?)
- Inference of Event-Recording Automata Using Timed Decision Trees
- Inferring Network Invariants Automatically
- Insights to Angluin's learning
- Language identification in the limit
- Learning a regular tree language from a teacher
- Learning assumptions for compositional verification
- Learning of event-recording automata
- Learning regular sets from queries and counterexamples
- Liveness and acceleration in parameterized verification
- Model-based testing of reactive systems. Advanced lectures.
- NuSMV 2: An OpenSource tool for symbolic model checking
- On Reasoning About Rings
- On the completeness of compositional reasoning
- On the correspondence between conformance testing and regular inference
- On the learnability of infinitary regular sets
- On the Synthesis of Finite-State Machines from Samples of Their Behavior
- Reducing model checking of the many to the few
- Regular model checking using inference of regular languages
- Replaying Play In and Play Out: Synthesis of Design Models from Scenarios by Learning
- Symbolic compositional verification by learning assumptions
- Synthesis of interface specifications for Java classes
- Testing Software Design Modeled by Finite-State Machines
- Transitive closures of regular relations for verifying infinite-state systems
- Using language inference to verify omega-regular properties
- Verification by network decomposition
- Verification, Model Checking, and Abstract Interpretation
Cited in
(23)- Inferring regular languages and \(\omega\)-languages
- Learning deterministic probabilistic automata from a model checking perspective
- Regular \(\omega\)-languages with an informative right congruence
- Learning algorithms
- Learning infinite-word automata with loop-index queries
- Learning pomset automata
- Learning regular omega languages
- scientific article; zbMATH DE number 7447748 (Why is no real title available?)
- Polynomial-time equivalence testing for deterministic fresh-register automata
- Query learning algorithm for residual symbolic finite automata
- CALF: categorical automata learning framework
- Learning Algorithms and Formal Verification (Invited Tutorial)
- Extending Automated Compositional Verification to the Full Class of Omega-Regular Languages
- Actively learning to verify safety for FIFO automata
- Active learning for deterministic bottom-up nominal tree automata
- Benchmarks for automata learning and conformance testing
- A Context-Free Symbiosis of Runtime Verification and Automata Learning
- Learning automata and transducers: a categorical approach
- Passive learning of regular data languages in polynomial time and data
- Feasability of learning weighted automata on a semiring
- Learning deterministic multi-clock timed automata
- Benchmarking combinations of learning and testing algorithms for automata learning
- DKL: an efficient algorithm for learning deterministic Kripke structures
This page was built for publication: Learning Meets Verification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3525110)
