Formal verification at higher levels of abstraction

IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers, ICCAD

Volumn , Issue , 2007, Pages 572-578

  Kroening, Daniel ^a   Seshia, Sanjit A ^b  

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTION LEVELS; COMPUTER-AIDED DESIGN; FORMAL VERIFICATION TOOLS; FORMAL VERIFICATIONS; HIGH-LEVEL MODELING; INTERNATIONAL CONFERENCES; LEVEL MODEL; LEVELS OF ABSTRACTION; MODULO THEORIES; PREDICATE ABSTRACTIONS; REGISTER-TRANSFER LEVEL; SATISFIABILITY; TUTORIAL SURVEYS;

DESIGN; DISPENSERS;

ABSTRACTING;

EID: 50249092797     PISSN: 10923152     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCAD.2007.4397326     Document Type: Conference Paper

References (36)

1. Z. S. Andraus, M. H. Liffiton, and K. A. Sakallah. Refinement strategies for verification methods based on datapath abstraction. In Asia South Pacific Design Automation Conference (ASP-DAC), pages 19-24, 2006.
2. Z. S. Andraus and K. A. Sakallah. Automatic abstraction and verification of Verilog models. In Design Automation Conference (DAC), pages 218-223. ACM Press, 2004.
3. D. Babić and M. Musuvathi. Modular Arithmetic Decision Procedure. Technical report. Microsoft Research, Redmond. 2005.
4. T. Ball and S. K. Rajamani. Automatically validating temporal safety properties of interfaces. In SPIN Workshop, pages 103-122, 2001.
5. C. W. Barrett, D. L. Dill, and J. R. Levitt, A decision procedure for bit-vector arithmetic. In Design Automation Conference (DAC), pages 522-527, ACM Press, 1998.
6. S. Berezin, V. Ganesh, and D. Dill. A decision procedure for fixed-width bit-vectors. Technical report, Computer Science Department, Stanford University, April 2005.
7. A. Biere, A. Cimatti, E. Clarke, and Y. Yhu. Symbolic model checking without BDDs. In TACAS, pages 193-207, 1999.
8. A. Biere, A. Cimatti, E. M. Clarke, M. Fujita, and Y. Zhu, Symbolic model checking using SAT procedures instead of BDDs. In Design Automation Conference (DAC), 1999.
9. R. Brinkmann and R. Drechsler. RTL-datapath verification using integer linear programming. In Proceedings of VLSI Design, pages 741-746, 2002.
10. R. Bruttomesso, A. Cimatti, A. Franzen, A. Griggio, Z. Hanna, A. Nadel, A. Palti, and R. Sebastiani. A lazy and layered SMT(BV) solver for hard industrial verification problems. In Computer Aided Verification (CAV), LNCS. Springer, 2007.
11. R. E. Bryant, D. Kroening, J. Ouaknine, S. A. Seshia, O. Strichman, and B. Brady. Deciding bit-vector arithmetic with abstraction. In O. Grumberg and M. Huth, editors, Tools and Algorithms for the Construction and Analysis of Systems (TACAS). volume 4424 of LNCS, pages 358-372. Springer. 2007.
12. R. E. Bryant, S. K. Lahiri, and S. A. Seshia. Modeling and verifying systems using a logic of counter arithmetic with lambda expressions and uninterpreted functions. In CAV. pages 78-92, 2002.
13. C. Cadar, V. Ganesh, P. M. Pawlowski, D. L. Dill, and D. R. Engler. EXE: Automatically generating inputs of death. In 13th ACM Conference on Computer and Communications Security (CCS), pages 322-335, ACM, 2006.
14. E. Clarke, O. Grumberg, S. Jha, Y. Lu, and V. H. Counterexample-guided abstraction refinement. In CAV, pages 154-169. Springer, 2000.
15. E. Clarke, O. Grumberg, and D. Long. Model checking and abstraction. In POPL, pages 342-354, 1992.
16. E. Clarke, O. Grumberg, and D. Peled. Model Checking. MIT Press, 1999.
17. E. Clarke, D. Kroening, N. Sharygina, and K. Yorav. Predicate abstraction of ANSI-C programs using SAT. Formal Methods in System Design (FMSD), 25:105-127, 2004.
18. E. Clarke, M. Talupur, and D. Wang. SAT based predicate abstraction for hardware verification. In SAT, 2003.
19. E. M. Clarke and E. A. Emerson. Synthesis of synchronization skeletons for branching time temporal logic. In Logic of Programs: Workshop. volume 131 of LNCS. Springer, 1981.
20. E. M. Clarke and H. Veith. Counterexamples revisited: Principles, algorithms, applications. In Verification: Theory and Practice, pages 208-224. Springer, 2003.
21. B. Cook, D. Kroening, and N. Sharygina. Cogent: Accurate theorem proving for program verification. In Proceedings of CAV 2005, pages 296-300. Springer, 2005.
22. Cadence SMV, http://www.kenmemil.com/smv.html.
23. D. Cyrluk, M. O. Möller, and H. Rueß. An efficient decision procedure for the theory of fixed-sized bit-vectors. In Computer-Aided Verification (CAV '97), pages 60-71, 1997.
24. B. Dutertre and L. de Moura. The Yices SMT solver. Available at http://yices.csl.sri.com/tool-paper, pdf. September 2006.
25. V. Ganesh and D. Dill. A decision procedure for bit-vectors and arrays. In Computer Aided Verification (CAV), LNCS. Springer. 2007.
26. S. Graf and H. Saïdi. Construction of abstract state graphs with PVS. In Computer Aided Verification (CAV), volume 1254, pages 72-83, 1997.
27. C.-Y. Huang and K.-T. Cheng. Assertion checking by combined wordlevel ATPG and modular arithmetic constraint-solving techniques. In Design Automation Conference (DAC), pages 118-123, 2000.
28. H. Jain, D. Kroening, N. Sharygina, and E. M. Clarke. Word level predicate abstraction and refinement for verifying RTL Verilog. In Design Automation Conference (DAC), pages 445-450. ACM, 2005.
29. D. Kroening and O. Strichman. Efficient computation of recurrence diameters. In 4th International Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI), volume 2575 of LNCS, pages 298-309. Springer. 2003.
30. R. Kurshan. Computer-aided verification of coordinating processes: the automata-theoretic approach. Princeton University Press, 1994.
31. S. K. Lahiri, S. A. Seshia, and R. E. Bryant. Modeling and verification of out-of-order microprocessors in UCLID. In Formal Methods in Computer-Aided Design (FMCAD), volume 2517 of LNCS, pages 142-159, Springer, 2002.
32. P. Manolios, S. K. Srinivasan, and D. Vroon. Automatic memory reductions for rtl model verification. In International Conference on Computer-Aided Design (ICCAD), pages 786-793. ACM, 2006.
33. K. L. McMillan. An interpolating theorem prover. In TACAS, pages 16-30, Springer, 2004.
34. MiniSat. http://www.cs.chalmers.se/Cs/Research/FormalMethods/MiniSat/.
35. G. Parthasarathy, M. K. Iyer, K.-T. Cheng, and L.-C. Wang. An efficient finite-domain constraint solver for circuits. In Design Automation Conference (DAC), pages 212-217. 2004.
36. M. Wedler, D. Stoffel, and W Kunz. Normalization at the arithmetic bit level. In Design Automation Conference (DAC), pages 457-462. ACM Press, 2005.