On the correspondence between conformance testing and regular inference
From MaRDI portal
Recommendations
- On conformance testing of non-deterministic systems
- Conformance Tests as Checking Experiments for Partial Nondeterministic FSM
- A formal logic approach to constrained combinatorial testing
- Concolic testing in logic programming
- Testing for a conformance relation based on acceptance
- FM 2005: Formal Methods
- Testing confluence of nonterminating rewriting systems
- On the completeness of selective unification in concolic testing of logic programs
Cited in
(17)- Generating models of infinite-state communication protocols using regular inference with abstraction
- Efficient active automata learning via mutation testing
- The geometry of electron wave functions
- Conformance Tests as Checking Experiments for Partial Nondeterministic FSM
- Learning Meets Verification
- Evaluation and Comparison of Inferred Regular Grammars
- Improving active Mealy machine learning for protocol conformance testing
- Model checking, synthesis, and learning
- Learning of event-recording automata
- Never-stop context-free learning
- Inferring Symbolic Automata
- Learning deterministic one-clock timed automata via mutation testing
- Benchmarks for automata learning and conformance testing
- A Context-Free Symbiosis of Runtime Verification and Automata Learning
- A new approach for active automata learning based on apartness
- Learning communicating state machines
- Benchmarking combinations of learning and testing algorithms for automata learning
This page was built for publication: On the correspondence between conformance testing and regular inference
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5316435)
