Back to Results
First PageMeta Content
Logic in computer science / Model theory / Complexity classes / Boolean algebra / Electronic design automation / Boolean satisfiability problem / Presburger arithmetic / Quantifier elimination / Decision problem / Theoretical computer science / Computational complexity theory / Applied mathematics


Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic Viktor Kuncak1 and Martin Rinard2 1 Ecole Politechnique F´ed´erale de Lausanne, Lausanne, VD, Switzerland
Add to Reading List

Document Date: 2007-12-05 11:59:40

Open Document

File Size: 307,00 KB

Share Result on Facebook

City

Lausanne / Cambridge / /

Country

Switzerland / /

Facility

Massachusetts Institute of Technology / /

IndustryTerm

sparse solutions / binary search / cardinality operator / software verification / /

Organization

Ecole Politechnique F´ed´erale de Lausanne / Massachusetts Institute of Technology / /

ProvinceOrState

Massachusetts / Pennsylvania / /

Technology

previous QFBAPA algorithms / 2 Massachusetts Institute of Technology / /

SocialTag