The complexity of coverage

DOI10.1142/S0129054113400066MaRDI QIDQ2841992zbMATH OpenOpenAlexFDO

Authors Krishnendu Chatterjee, Luca De Alfaro, Rupak Majumdar

Publication date 30 July 2013

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0129054113400066

zbMATH Keywords

computational complexitycoverage problemgraph gamestimed and pushdown systems

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25) Applications of game theory (91A80) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60) Multistage and repeated games (91A20)

Recommendations

• Publication:3487357
• scientific article; zbMATH DE number 9246
• Covering Problems
• Covering Problems
• scientific article; zbMATH DE number 482640
• The complexity of the covering radius problem
• The covering problem
• Complexity of the Cover Polynomial

Cites work

• Discrete-time control for rectangular hybrid automata
• Proof verification and the hardness of approximation problems
• Pushdown processes: Games and model-checking
• The complexity of probabilistic verification
• The complexity of two-player games of incomplete information

Cited in

(10)

• scientific article; zbMATH DE number 7447738 (Why is no real title available?)
• Complexity of node coverage games
• scientific article; zbMATH DE number 2090129 (Why is no real title available?)
• Testing restorable systems: formal definition and heuristic solution based on river formation dynamics
• Play to Test
• Theoretical Aspects of Computing - ICTAC 2004
• Test coverage estimation using threshold accepting
• scientific article; zbMATH DE number 1418465 (Why is no real title available?)
• Quantitative projection coverage for testing ML-enabled autonomous systems
• Probabilistic testing coverage

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)