SAT-based assistance in abstraction refinement for symbolic trajectory evaluation

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

Volumn 4144 LNCS, Issue , 2006, Pages 175-189

  Roorda, Jan Willem ^a   Claessen, Koen ^a  

^a CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; ALGORITHMS; COMPUTER PROGRAMMING LANGUAGES;

ABSTRACTION REFINEMENT; STE SPECIFICATION; SYMBOLIC TRAJECTORY EVALUATION;

DATA PROCESSING;

EID: 33749861544     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11817963_19     Document Type: Conference Paper

References (14)

1. M. Aagaard, R. B. Jones, T. F. Melham, J. W. O'Leary, and C.-J. H. Seger. A methodology for large-scale hardware verification. In FMCAD, 2000.
2. P. Bjesse, T. Leonard, and A. Mokkedem. Finding bugs in an Alpha microprocessor using satisfiability solvers. In CAV 2001, volume 2102 of LNCS. Springer-Verlag, 2001.
3. N. Eén and N. Sörensson. An extensible SAT-solver. In Proceedings of the 6th International Conference on Theory and Applications of Satisfiability Testing (SAT2003), 2003.
4. FORTE. http://www.intel.com/software/products/opensource/tools1/ verification.
5. B. Li, C. Wang, and F. Somenzi. Abstraction refinement in symbolic model checking using satisfiability as the only decision procedure. Journal on STTT, 7(2): 143-155, Apr. 2005.
6. T. F. Melham and R. B. Jones. Abstraction by symbolic indexing transformations. In Formal Methods in Computer-Aided Design FMCAD, volume 2517 of LNCS, 2002.
7. M. Pandey, R. Raimi, R. E. Bryant, and M. S. Abadir. Formal verification of content addressable memories using symbolic trajectory evaluation. In DAC'97, 1997.
8. J.-W. Roorda. Symbolic trajectory evaluation using a satisfiability solver. Licentiate thesis, Computing Science, Chalmers University of Technology, 2005.
9. J.-W. Roorda and K. Claessen. A new SAT-based Algorithm for Symbolic Trajectory Evaluation. In Correct Hardware Design and Verification Methods (CHARME), 2005.
10. J.-W. Roorda and K. Claessen. Explaining Symbolic Trajectory Evaluation by Giving it a Faithful Semantics. In International Computer Science Symposium in Russia (CSR), volume 3967 of LNCS, 2006.
11. T. Schubert. High level formal verification of next-generation microprocessors. In Proceedings of the 40th conference on Design automation, pages 1-6. ACM Press, 2003.
12. C.-J. H. Seger and R. E. Bryant. Formal verification by symbolic evaluation of partially-ordered trajectories. Formal Methods in System Design, 6(2), 1995.
13. R. Tzoref and O. Grumberg. Automatic Refinement and Vacuity Detection for Symbolic Trajectory Evaluation. In Computer Aided Verification (CAV), 2006.
14. J. Yang, R. Gil, and E. Singerman. satGSTE: Combining the abstraction of GSTE with the capacity of a SAT solver. In Designing Correct Circuits (DCC'04), 2004.