Learning Meets Verification
From MaRDI portal
Publication:3525110
DOI10.1007/978-3-540-74792-5_6zbMath1147.68541OpenAlexW1883237636MaRDI QIDQ3525110
Publication date: 17 September 2008
Published in: Formal Methods for Components and Objects (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-74792-5_6
Computational learning theory (68Q32) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items
Learning infinite-word automata with loop-index queries ⋮ DKL: an efficient algorithm for learning deterministic Kripke structures ⋮ Learning regular omega languages ⋮ Inferring regular languages and \(\omega\)-languages ⋮ Learning deterministic probabilistic automata from a model checking perspective ⋮ Active learning for deterministic bottom-up nominal tree automata ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Polynomial-time equivalence testing for deterministic fresh-register automata ⋮ Regular \(\omega\)-languages with an informative right congruence ⋮ Learning algorithms
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Learning regular sets from queries and counterexamples
- A theory of timed automata
- Control and data abstraction: The cornerstones of practical formal verification
- A structural induction theorem for processes
- On the learnability of infinitary regular sets
- 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
- Bridging the gap between fair simulation and trace inclusion
- Model-based testing of reactive systems. Advanced lectures.
- Inferring Network Invariants Automatically
- Complexity of automaton identification from given data
- Testing Software Design Modeled by Finite-State Machines
- Synthesis of interface specifications for Java classes
- CONCUR 2004 - Concurrency Theory
- CONCUR 2004 - Concurrency Theory
- Fundamental Approaches to Software Engineering
- Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- On the Synthesis of Finite-State Machines from Samples of Their Behavior
- Language identification in the limit
- On Reasoning About Rings
- A Logical Characterisation of Event Clock Automata
- Tools and Algorithms for the Construction and Analysis of Systems
- Computer Aided Verification
- Computer Aided Verification
- Inference of Event-Recording Automata Using Timed Decision Trees
- Replaying Play In and Play Out: Synthesis of Design Models from Scenarios by Learning
- Verification, Model Checking, and Abstract Interpretation
- Computer Aided Verification
- Computer Aided Verification
- Efficient algorithms for the inference of minimum size DFAs
This page was built for publication: Learning Meets Verification
