scientific article; zbMATH DE number 2080060
From MaRDI portal
Publication:4472253
Recommendations
Cited in
(15)- Probabilistic black-box reachability checking (extended version)
- Generating models of infinite-state communication protocols using regular inference with abstraction
- Learning from positive and negative examples: dichotomies and parameterized algorithms
- Adaptive Model Checking
- Learning Meets Verification
- Grey-Box Checking
- Learning finite cover automata from queries
- Active learning of nondeterministic finite state machines
- Learning register automata: from languages to program structures
- scientific article; zbMATH DE number 1903377 (Why is no real title available?)
- Learning of event-recording automata
- Learning from positive and negative examples: new proof for binary alphabets
- Reverse Engineering Through Automata Learning
- Three optimizations for assume-guarantee reasoning with \(L^{*}\)
- Verification of evolving software via component substitutability analysis
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4472253)