Sciweavers

9 search results - page 2 / 2
» A Novel SAT All-Solutions Solver for Efficient Preimage Comp...
Sort
View
119
Voted
ICCAD
2009
IEEE
147views Hardware» more  ICCAD 2009»
14 years 10 months ago
SAT-based protein design
Computational protein design can be formulated as an optimization problem, where the objective is to identify the sequence of amino acids that minimizes the energy of a given prot...
Noah Ollikainen, Ellen Sentovich, Carlos Coelho, A...
126
Voted
FM
2008
Springer
152views Formal Methods» more  FM 2008»
15 years 1 months ago
Constraint Prioritization for Efficient Analysis of Declarative Models
The declarative modeling language Alloy and its automatic analyzer provide an effective tool-set for building designs of systems and checking their properties. The Alloy Analyzer p...
Engin Uzuncaova, Sarfraz Khurshid
100
Voted
ICCAD
2009
IEEE
159views Hardware» more  ICCAD 2009»
14 years 10 months ago
First steps towards SAT-based formal analog verification
Boolean satisfiability (SAT) based methods have traditionally been popular for formally verifying properties for digital circuits. We present a novel methodology for formulating a...
Saurabh K. Tiwary, Anubhav Gupta, Joel R. Phillips...
DAC
2004
ACM
16 years 1 months ago
A SAT-based algorithm for reparameterization in symbolic simulation
Parametric representations used for symbolic simulation of circuits usually use BDDs. After a few steps of symbolic simulation, state set representation is converted from one para...
Pankaj Chauhan, Edmund M. Clarke, Daniel Kroening