Back to Results
First PageMeta Content
Model theory / Predicate logic / Electronic design automation / Logic in computer science / NP-complete problems / Satisfiability Modulo Theories / Boolean satisfiability problem / True quantified Boolean formula / Skolem normal form / Logic / Theoretical computer science / Mathematical logic


Efficiently Solving Quantified Bit-Vector Formulas Christoph M. Wintersteiger Youssef Hamadi Leonardo de Moura
Add to Reading List

Document Date: 2010-07-29 11:34:28


Open Document

File Size: 339,18 KB

Share Result on Facebook

City

Constraint / /

Company

CNF / Cambridge University Press / Pergamon Press / Oracle / Ge / sKizzo Hardware / QF BV / Bendix / AMD / RTL / Microsoft / /

Country

United States / /

/

Facility

Satisfiability Modulo Theories Library / /

IndustryTerm

software design / model finding algorithm / software verification problems / model refinement algorithm / synthesis applications / search space using templates / synthesis tool / software benchmarks / bit-manipulating algorithms / synthesis algorithms / synthesis tools / software verification / bit-level analysis tool / natural solution / function applications / possible solution / software applications / e-matching / search space / /

OperatingSystem

Microsoft Windows / /

Organization

Cambridge University / Ecole Polytechnique / /

Person

A. Goultiaeva / V / Youssef Hamadi Leonardo de Moura / Christoph M. Wintersteiger Youssef Hamadi / /

/

Position

model for the original formula / model for φ modulo TB / model for this formula / model for {F } ∪ BitVec / /

Product

Athlon 2 GHz / /

ProgrammingLanguage

R / C / C++ / /

Technology

model refinement algorithm / synthesis algorithms / model finding algorithm / bit-manipulating algorithms / integrated circuits / verilog / System-on-Chip / QBVF solving algorithm / CAD / /

URL

www.SMT-LIB.org / http /

SocialTag