Efficient mutation-analysis coverage for constrained random verification

DOI10.1007/978-3-642-15234-4_12MaRDI QIDQ3163925zbMATH OpenOpenAlexFDO

Authors

Publication date 27 October 2010

Published in Distributed, Parallel and Biologically Inspired Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-15234-4_12

zbMATH Keywords

constrained random verificationmutation analysisverification coverage

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• scientific article; zbMATH DE number 2090129
• Automated Technology for Verification and Analysis
• scientific article; zbMATH DE number 1852156
• On Bridging Simulation and Formal Verification
• Efficient techniques for automatic verification-oriented test set optimization

Cited in

(4)

• Efficient techniques for automatic verification-oriented test set optimization
• scientific article; zbMATH DE number 2090129 (Why is no real title available?)
• Automated Technology for Verification and Analysis
• Achieving high coverage in hardware equivalence checking via concolic verification

This page was built for publication: Efficient mutation-analysis coverage for constrained random verification

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