A practical approach to coverage in model checking

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2102, Issue , 2001, Pages 66-78

  Chockler, Hana ^a   Kupferman, Orna ^a   Kurshan, Robert P ^b   Vardi, Moshe Y ^c  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b LUCENT TECHNOLOGIES   (United States)

^c Rice University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; AUTOMATA THEORY; COMPUTATION THEORY; COMPUTER AIDED ANALYSIS; FORMAL VERIFICATION; SPECIFICATIONS;

AUTOMATA-BASED MODEL; COVERAGE METRICS; COVERAGE PROBLEM; INFINITE WORD; LINEAR TEMPORAL LOGIC; MODEL CHECKING PROBLEM; MODEL CHECKING TOOLS; VERIFICATION PROCESS;

MODEL CHECKING;

EID: 84958778315     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44585-4_7     Document Type: Conference Paper

References (36)

1. B. Banieqbal and H. Barringer. Temporal logic with fixed points. In Temporal Logic in Specification, LNCS 398, pp. 62-74, 1987.
2. D. Beaty and R. Bryant. Formally verifying a microprocessor using a simulation methodology. In Proc. 31st DAC, pp. 596-602. IEEE Computer Society, 1994.
3. I. Beer, S. Ben-David, C. Eisner, and Y. Rodeh. Efficient detection of vacuity in ACTL formulas. In Proc. 9th CAV, LNCS 1254, pp. 279-290, 1997.
4. G. Bhat and R. Cleaveland. Efficient local model-checking for fragments of the modal μ-calculus. In Proc. TACAS, LNCS 1055, 1996.
5. R. Bloem, H.N. Gabow, and F. Somenzi. An algorithm for strongly connected component analysis in n log n symbolic steps. In FMCAD, LNCS,2000.
6. J.P. Bergmann and M.A. Horowitz. Improving coverage analysis and test generation for large designs. In Proc 11th CAD, pp. 580-584, November 1999.
7. R. Bloem, K. Ravi, and F. Somenzi. Efficient decision procedures for model checking of linear time logic properties. In Proc. 11th CAV, LNCS 1633, pp. 222-235, 1999.
8. J.R. Buchi. On a decision method in restricted second order arithmetic. In Proc. Internat. Congr. Logic, Method. and Philos. Sci. 1960, pp. 1-12, Stanford, 1962. Stanford University Press.
9. E.M. Clarke and E.A. Emerson. Design and synthesis of synchronization skeletons using branching time temporal logic. In Proc. Workshop on Logic of Programs, LNCS 131, pp. 52-71, 1981.
10. E.M. Clarke, O. Grumberg, K.L. McMillan, and X. Zhao. Efficient generation of counterexamples and witnesses in symbolic model checking. In Proc. 32nd DAC, pp. 427-432. IEEE Computer Society, 1995.
11. E.M. Clarke, O. Grumberg, and D. Peled. Model Checking. MIT Press, 1999.
12. H. Chockler, O. Kupferman, and M.Y. Vardi. Coverage metrics for temporal logic model checking. In TACAS, LNCS 2031, pp. 528-542, 2001.
13. R. Cleaveland and B. Steffen. A linear-time model-checking algorithm for the alternation-free modal μ-calculus. In Proc. 3rd CAD, LNCS 575, pp. 48-58, 1991.
14. S. Devadas, A. Ghosh, and K. Keutzer. An observability-based code coverage metric for functional simulation. In Proc. 8th CAD, pp. 418-425, 1996.
15. E.A. Emerson and C.-L. Lei. Efficient model checking in fragments of the propositional μ-calculus. In Proc. 1st LICS, pp. 267-278, Cambridge, June 1986.
16. F. Fallah, P. Ashar, and S. Devadas. Simulation vector generation from HDL descriptions for observability enhanced-statement coverage. In Proc. of the 36th DAC, pp. 666-671, June 1999.
17. F. Fallah, S. Devadas, and K. Keutzer. OCCOM: efficient computation of observability-based code coverage metrics for functional simulation. In Proc. of the 35th DAC, pp. 152-157, June 1998.
18. R.C. Ho and M.A. Horowitz. Validation coverage analysis for complex digital designs. In Proc 8th CAD, pp. 146-151, November 1996.
19. R.H. Hardin, Z. Har’el, and R.P. Kurshan. COSPAN. In Proc. 8th CAV LNCS 1102, pp. 423-427, 1996.
20. Y. Hoskote, T. Kam, P.-H Ho, and X. Zhao. Coverage estimation for symbolic model checking. In Proc. 36th DAC, pp. 300-305, 1999.
21. T.A. Henzinger, O. Kupferman, and S. Qadeer. From pre-historic to post-modern symbolic model checking. In Proc 10th CAV, LNCS 1427, 1998.
22. Y. Hoskote, D. Moundanos, and J. Abraham. Automatic extraction of the control flow machine and application to evaluating coverage of verification vectors. In Proc. of ICDD, pp. 532-537, October 1995.
23. R. Ho, C. Yang, M. Horowitz, and D. Dill. Architecture validation for processors. In Proc. of the 22nd Annual Symp. on Comp. Arch., pp. 404-413, June 1995.
24. S. Katz, D. Geist, and O. Grumberg. “Have I written enough properties ?” a method of comparison between specification and implementation. In 10th CHARME, LNCS 1703, pp. 280-297, 1999.
25. M. Kantrowitz and L. Noack. I’m done simulating: Now what? verification coverage analysis and correctness checking of the DEC chip 21164 alpha microprocessor. In Proc. 33th DAC, pp. 325-330, June 1996.
26. D. Kozen. Results on the propositional μ-calculus. Theoretical Computer Science, 27:333-354, 1983.
27. O. Kupferman and A. Pnueli. Once and for all. In Proc. 10th IEEE Symp. on Logic in Comp. Sci., pp. 25-35, San Diego, June 1995.
28. R.P. Kurshan. FormalCheck User’s Manual. Cadence Design, Inc., 1998.
29. O. Kupferman and M.Y. Vardi. Relating linear and branching model checking. In IFIP Work. Conf. on Programming Concepts and Methods, pp. 304-326, New York, June 1998. Chapman & Hall.
30. O. Kupferman and M.Y. Vardi. Vacuity detection in temporal model checking. In 10th CHARME, LNCS 1703, pp. 82-96, 1999.
31. O. Kupferman, M.Y. Vardi, and P. Wolper. An automata-theoretic approach to branching-time model checking. Journal of the ACM, 47(2):312-360, March 2000.
32. O. Lichtenstein and A. Pnueli. Checking that finite state concurrent programs satisfy their linear specification. In Proc. 12th POPL, pp. 97-107, 1985.
33. D. Moumdanos, J.A. Abraham, and Y.V. Hoskote. Abstraction techniques for validation coverage analysis and test generation. IEEE Trans. on Computers, 1998.
34. J.P. Queille and J. Sifakis. Specification and verification of concurrent systems in Cesar. In Proc. 5th Int. Symp. on Programming, LNCS 137, pp. 337-351, 1981.
35. A.P. Sistla. Satefy, liveness and fairness in temporal logic. Formal Aspects of Computing, 6:495-511, 1994.
36. M.Y. Vardi and P. Wolper. Reasoning about infinite computations. Information and Computation, 115(1):1-37, November 1994.