The complexity of coverage
From MaRDI portal
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Multistage and repeated games (91A20) Applications of game theory (91A80)
Recommendations
Cites work
Cited in
(10)- Complexity of node coverage games
- Tester versus bug: a generic framework for model-based testing via games
- Play to Test
- Test coverage estimation using threshold accepting
- Testing restorable systems: formal definition and heuristic solution based on river formation dynamics
- Improvements in coverability analysis
- scientific article; zbMATH DE number 1418465 (Why is no real title available?)
- Probabilistic testing coverage
- Minimal spanning set for coverage testing of interactive systems
- Quantitative projection coverage for testing ML-enabled autonomous systems
This page was built for publication: The complexity of coverage
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2841992)