Improvements in coverability analysis

DOI10.1007/3-540-45614-7_3MaRDI QIDQ4808821zbMATH OpenFDO

Authors Gil Ratsaby, Baruch Sterin, Shmuel Ur

Publication date 12 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2391/23910041.htm

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Coverability analysis using symbolic model checking
• Test coverage estimation using threshold accepting
• Efficient mutation-analysis coverage for constrained random verification
• The complexity of coverage
• A practical approach to coverage in model checking

Cited in

(5)

• Efficient mutation-analysis coverage for constrained random verification
• Test coverage estimation using threshold accepting
• Coverability analysis using symbolic model checking
• Numerical coverage estimation for the symbolic simulation of real-time systems
• A Set-Covering Approach to Customized Coverage Instrumentation

This page was built for publication: Improvements in coverability analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4808821)