Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
Software testing techniques (2nd ed.)
Software testing techniques (2nd ed.)
Design and validation of computer protocols
Design and validation of computer protocols
Investigations of the software testing coupling effect
ACM Transactions on Software Engineering and Methodology (TOSEM)
Cost-effective generation of minimal test sets for stuck-at faults in combinational logic circuits
DAC '93 Proceedings of the 30th international Design Automation Conference
The craft of software testing: subsystem testing including object-based and object-oriented testing
The craft of software testing: subsystem testing including object-based and object-oriented testing
DAC '96 Proceedings of the 33rd annual Design Automation Conference
RuleBase: an industry-oriented formal verification tool
DAC '96 Proceedings of the 33rd annual Design Automation Conference
Coverage estimation for symbolic model checking
Proceedings of the 36th annual ACM/IEEE Design Automation Conference
Model checking
Symbolic Model Checking
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Automatically Generating Test Data from a Boolean Specification
IEEE Transactions on Software Engineering
ICCD '95 Proceedings of the 1995 International Conference on Computer Design: VLSI in Computers and Processors
Protocol verification: the first ten years, the next ten years; some personal observations
Proceedings of the IFIP WG6.1 Tenth International Symposium on Protocol Specification, Testing and Verification X
A Methodology for Processor Implementation Verification
FMCAD '96 Proceedings of the First International Conference on Formal Methods in Computer-Aided Design
Coverage-Directed Test Generation Using Symbolic Techniques
FMCAD '96 Proceedings of the First International Conference on Formal Methods in Computer-Aided Design
Coverability Analysis Using Symbolic Model Checking
CHARME '01 Proceedings of the 11th IFIP WG 10.5 Advanced Research Working Conference on Correct Hardware Design and Verification Methods
FoCs: Automatic Generation of Simulation Checkers from Formal Specifications
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Methodology and System for Practical Formal Verification of Reactive Hardware
CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
RuleBase: Model Checking at IBM
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Compacting regression-suites on-the-fly
APSEC '97 Proceedings of the Fourth Asia-Pacific Software Engineering and International Computer Science Conference
An optimal test compression procedure for combinational circuits
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
An extensible open-source compiler infrastructure for testing
HVC'05 Proceedings of the First Haifa international conference on Hardware and Software Verification and Testing
IFM'12 Proceedings of the 9th international conference on Integrated Formal Methods
Hi-index | 0.00 |
In simulation-based verification users are faced with the challenge of maximizing test coverage while minimizing testing costs. Sophisticated techniques are used to generate clever test cases and to determine the quality attained by the tests. The latter activity, which is essential for locating areas of the design that need to have more tests, is called test coverage analysis.We have previously introduced the notion of coverability, which refers to the degree to which a model can be covered when subjected to testing. We showed how a coverability analyzer enables naive users to take advantage of the power of symbolic model checking with a 'one-button' interface for coverability analysis. In this work, we present several heuristics, based on static program analysis and on simulation of counter examples, for improving the efficiency of coverability analysis by symbolic model checking. We explain each heuristic independently and suggest a way to combine them. We present an experiment that shows improvements based on using random simulation in the analysis of coverability.