scientific article; zbMATH DE number 1418458
From MaRDI portal
Publication:4942015
Recommendations
- scientific article; zbMATH DE number 1916673
- Grey-Box Checking
- Formal Approaches to Software Testing
- A Note on an Anomaly in Black-Box Testing
- Black-box testing based on colorful taint analysis
- Information gain of black-box testing
- scientific article; zbMATH DE number 3909748
- Computational Methods in Systems Biology
Cited in
(36)- Testing nonlinear operators
- Probabilistic black-box reachability checking (extended version)
- Generating models of infinite-state communication protocols using regular inference with abstraction
- A new fair multi-secret sharing scheme based on asymmetric bivariate polynomial
- A graph based semantics for logical functional diagrams in power plant controllers
- Concurrent Kleene algebra with observations: from hypotheses to completeness
- Efficient active automata learning via mutation testing
- Conformance testing in the presence of multiple faults
- Incremental learning-based testing for reactive systems
- Testing Systems of Concurrent Black-Boxes—An Automata-Theoretic and Decompositional Approach
- Learning Meets Verification
- Grey-Box Checking
- scientific article; zbMATH DE number 3909748 (Why is no real title available?)
- Testing probabilistic equivalence through reinforcement learning
- Black-box testing based on colorful taint analysis
- scientific article; zbMATH DE number 2080060 (Why is no real title available?)
- Active learning of nondeterministic finite state machines
- Learning register automata: from languages to program structures
- scientific article; zbMATH DE number 1916673 (Why is no real title available?)
- Tests and refutation
- Polynomial identification of \(\omega \)-automata
- Complete model-based equivalence class testing for nondeterministic systems
- Zero-knowledge blackbox testing: where are the faults?
- Computational Methods in Systems Biology
- Computer Aided Verification
- On monitoring linear temporal properties
- Active learning for deterministic bottom-up nominal tree automata
- Information gain of black-box testing
- A Context-Free Symbiosis of Runtime Verification and Automata Learning
- Reverse Engineering Through Automata Learning
- Active learning of deterministic timed automata with Myhill-Nerode style characterization
- Active learning of symbolic Mealy automata
- Learning closed signal flow graphs
- Constructing concise characteristic samples for acceptors of omega regular languages
- DKL: an efficient algorithm for learning deterministic Kripke structures
- Three optimizations for assume-guarantee reasoning with \(L^{*}\)
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 Q4942015)
