Fault localization and correction with QBF

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

Volumn 4501 LNCS, Issue , 2007, Pages 355-368

  Staber, Stefan ^a   Bloem, Roderick ^a  

^a GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

PROBLEM SOLVING; SEQUENTIAL CIRCUITS;

QUANTIFIED BOOLEAN FORMULAS; SATISFIABILITY-BASED APPROACH;

BOOLEAN ALGEBRA;

EID: 38049188203     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72788-0_34     Document Type: Conference Paper

References (17)

1. R. Alur and T. A. Henzinger. Reactive modules. Formal Methods in System Design, 15:7-48, 1999.
2. R. Alur and S. La Torre. Deterministic generators and games for LTL fragments. ACM Transactions on Computational Logic, 5(1): 1-25, January 2004.
3. M. Ali, S. Safarpour, A. Veneris, M. Abadir, and R. Drechsler. Post-verification debugging of hierarchical designs. In Proc. IEEE International Conference on Computer Aided Design (ICCAD 2005), pages 871-876, San Jose, California, USA, 2005.
4. R. K. Brayton et al. VIS: A system for verification and synthesis. In T. Henzinger and R. Alur, editors, Eighth Conference on Computer Aided Verification (CAV'96), pages 428-432. Springer-Verlag, Rutgers University, 1996. LNCS 1102.
5. A. Biere, A. Cimatti, E. Clarke, and Y. Zhu. Symbolic model checking without BDDs. In Fifth International Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS'99), pages 193-207, March 1999. LNCS 1579.
6. M. Benedetti. Extracting certificates from quantified Boolean formulas. In International Joint Conference on Artificial Intelligence (IJCAI'05), pages 47-53, 2005.
7. M. Benedetti. sKizzo: a suite to evaluate and certify QBFs. In Proc. of 20th International Conference on Automated Deduction (CADE05), 2005. LNCS 3632.
8. R. Bloem, H. N. Gabow, and F. Somenzi. An algorithm for strongly connected component analysis in n log n symbolic steps. Formal Methods in System Design, 28:37-56, 2006.
9. U. Egly, H. Tompits, and S. Woltran. On quantifier shifting for quantified boolean formulas. In Proceedings of the SAT-02 Workshop on Theory and Applications of Quantified Boolean Formulas (QBF-02), pages 48-61, 2002.
10. A. Griesmayer, S. Staber, and R. Bloem. Automated fault localization for C programs. In Workshop on Verification and Debugging (V&D'06), 2006. To Appear.
11. B. Jobstmann, A. Griesmayer, and R. Bloem. Program repair as a game. In K. Etessami and S. K. Rajamani, editors, 17th Conference on Computer Aided Verification (CAV'05), pages 226-238. Springer-Verlag, 2005. LNCS 3576.
12. M. Maidl. The common fragment of CTL and LTL. In Proc. 41th Annual Symposium on Foundations of Computer Science, pages 643-652, 2000.
13. H. Samulowitz and F Bacchus. Binary clause reasoning in QBF. In Proc. 9th Intern. Conf. on Theory and Applications of Satisfiability Testing (SAT'06), 2006.
14. S. Staber, G. Fey, R. Bloem, and R. Drechsler. Automatic fault localization for property checking. In Second Haifa Verification Conference, 2006.
15. S. Staber, B. Jobstmann, and R. Bloem. Finding and fixing faults. In D. Borrione and W. Paul, editors, 13th Conference on Correct Hardware Design and Verification Methods (CHARME '05), pages 35-49. Springer-Verlag, 2005. LNCS 3725.
16. W. Thomas. On the synthesis of strategies in infinite games. In 12th Annual Symposium on Theoretical Aspects of Computer Science, pages 1-13. 1995. LNCS 900.
17. Y. Yu and S. Malik. Validating the result of a quantified Boolean formula (QBF) solver: Theory and practice. In Asia and South Pacific Design Automation Conference (ASPDAC'05), pages 1047-1051, 2005.