QBF-based formal verification: Experience and perspectives

M Benedetti, H Mangassarian - Journal on Satisfiability …, 2009 - content.iospress.com
Abstract The language of Quantified Boolean Formulas (QBF) has a lot of potential
applications to Formal Verification (FV) tasks, as it captures many of these tasks in a natural …

Reasoning with quantified boolean formulas

E Giunchiglia, P Marin, M Narizzano - Handbook of satisfiability, 2009 - ebooks.iospress.nl
The implementation of effective reasoning tools for deciding the satisfiability of Quantified
Boolean Formulas (QBFs) is an important research issue in Artificial Intelligence and …

[PDF][PDF] Counterexample-guided diagnosis.

H Riener, G Fey - IVSW, 2016 - agra.informatik.uni-bremen.de
In this paper, we propose a counterexample-guided diagnosis approach to identify faults in
circuit designs described as net-lists on the gate-level. Given a faulty net-list and a logic …

[图书][B] Solving Quantified Boolean Formulas

H Samulowitz - 2008 - library-archives.canada.ca
Abstract Abstract Solving Quantified Boolean Formulas Horst Samulowitz Doctor of
Philosophy Graduate Department of Computer Science University of Toronto 2008 Many …

[PDF][PDF] Innovative Verification and Synthesis Techniques for Achieving High-Quality SoC Designs

HZ Chou - 2010 - Citeseer
The increasing popularity of System-on-Chip (SoC) circuits results in many new design
challenges. One major challenge is to ensure the functional correctness of such complicated …

[图书][B] Pseudo-Boolean satisfiability and quantified Boolean formulas in CAD for VLSI

H Mangassarian - 2008 - tspace.library.utoronto.ca
The significant advancements in modern Boolean satisfiability (SAT) solvers have
encouraged the encoding of many computer aided design (CAD) for VLSI problems as SAT …

[引用][C] Machine learning of strategies for efficiently solving QBF with abstraction refinement

RJM dos Santos Silva - 2019 - Master's thesis, Universidade de …