On combining 01X-logic and QBF

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

Volumn 4739 LNCS, Issue , 2007, Pages 531-538

  Herbstritt, Marc ^a   Becker, Bernd ^a  

^a UNIVERSITY OF FREIBURG   (Germany)

Author keywords

01X; Blackbox designs; Bounded model checking; QBF

Indexed keywords

BOOLEAN ALGEBRA; COMPUTATIONAL METHODS; MATHEMATICAL MODELS;

BLACKBOX DESIGNS; QUANTIFIED BOOLEAN FORMULAS (QBF);

FORMAL LOGIC;

EID: 38449103127     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-75867-9_67     Document Type: Conference Paper

References (16)

1. Biere, A., Cimatti, A., Clarke, E., Strichman, O., Zhu, Y.: Bounded Model Checking. Advances in Computers 58 (2003)
2. Herbstritt, M., Becker, B., Scholl, C.: Advanced SAT-Techniques for Bounded Model Checking of Blackbox Designs. In: Proc. of MTV, pp. 37-44. IEEE CS, Los Alamitos (2006)
3. Herbstritt, M., Becker, B.: On SAT-based Bounded Invariant Checking of Blackbox Designs. In: Proc. of MTV, pp. 23-28. IEEE CS, Los Alamitos (2005)
4. Jain, A., et al.: Testing, Verification, and Diagnosis in the Presence of Unknowns. In: VLSI Test Symp., pp. 263-269 (2000)
5. Nopper, T., Scholl, C.: Flexible modeling of unknowns in model checking for incomplete designs. In: GI/ITG/GMM Methoden und Beschreibungssprachen zur Modellierung und Verifikation von Schaltungen und Systemen (2005)
6. Brand, D.: Verification of large synthesized designs. In: Proc. of ICCAD (1993)
7. Tseitin, G.: On the complexity of derivations in propositional calculus. Studies in Constructive Mathematics and Mathematical Logics (1968)
8. Marques-Silva, J., Sakallah, K.: Boolean Satisfiability in Electronic Design Automation. In: Proc. of DAC, pp. 675-680 (2000)
9. Marques-Silva, J., Sakallah, K.: GRASP: A Search Algorithm for Propositional Satisfiability. IEEE Trans. on Comp. 48(5), 506-521 (1999)
10. Moskewicz, M., Madigan, C., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engeneering an Efficient SAT Solver. In: Proc. of DAC (2001)
11. Lewis, M., Schubert, T., Becker, B.: Multithreaded SAT Solving. In: Proc. of ASPDAC (2007)
12. Giunchiglia, E., Narizzano, M., Tacchella, A.: QuBE++: An Efficient QBF Solver. In: Hu, A.J., Martin, A.K. (eds.) FMCAD 2004. LNCS, vol. 3312, pp. 201-213. Springer, Heidelberg (2004)
13. Biere, A.: Resolve and Expand. In: Hoos, H.H., Mitchell, D.G. (eds.) SAT 2004. LNCS, vol. 3542, pp. 59-70. Springer, Heidelberg (2005)
14. Samulowitz, H., Bacchus, F.: Using SAT in QBF. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 578-592. Springer, Heidelberg (2005)
15. Narizzano, M., Pulina, L., Tacchella, A.: QBF Evaluation 2006 (2006) [2006-08-02], Available on-line at www.qbflib.org/qbfeval
16. The VIS Group: VIS: A system for verification and synthesis. In: Alur, R., Henzinger, T.A. (eds.) CAV 1996. LNCS, vol. 1102, Springer, Heidelberg (1996)