Coverability analysis using symbolic model checking

DOI10.1007/3-540-44798-9_13MaRDI QIDQ4787226zbMATH OpenFDO

Authors Gil Ratzaby, Shmuel Ur, Yaron Wolfsthal

Publication date 9 January 2003

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/2144/21440155

Mathematics Subject Classification ID

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

Recommendations

• Improvements in coverability analysis
• A practical approach to coverage in model checking
• Coverage metrics for temporal logic model checking
• Coverage metrics for temporal logic model checking
• scientific article; zbMATH DE number 1418465

Cited in

(7)

• Model Checking Coverability Graphs of Vector Addition Systems
• Efficient mutation-analysis coverage for constrained random verification
• Improvements in coverability analysis
• scientific article; zbMATH DE number 1418465 (Why is no real title available?)
• Probabilistic testing coverage
• Coverage-based testing with symbolic transition systems
• Coverage metrics for temporal logic model checking

This page was built for publication: Coverability analysis using symbolic model checking

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