61 search results - page 11 / 13 » A Clause-Based Heuristic for SAT Solvers |
198
click to vote
POPL
2008
ACM
15 years 12 months ago
2008
ACM
Relevance heuristics allow us to tailor a program analysis to a particular property to be verified. This in turn makes it possible to improve the precision of the analysis where n...
102
click to vote
CPAIOR
2006
Springer
15 years 3 months ago
2006
Springer
Recently, Linear Programming (LP)-based relaxations have been shown promising in boosting the performance of exact MAX-SAT solvers. We compare Semidefinite Programming (SDP) based ...
105
click to vote
FMCAD
2007
Springer
15 years 3 months ago
2007
Springer
Parameterized heuristics abound in computer aided design and verification, and manual tuning of the respective parameters is difficult and time-consuming. Very recent results from ...
93
Voted
CADE
2006
Springer
15 years 12 months ago
2006
Springer
Abstract. Verification by network invariants is a heuristic to solve uniform verification of parameterized systems. Given a system P, a network invariant for P is that abstracts th...
70
Voted
ICCAD
2005
IEEE
15 years 8 months ago
2005
IEEE
— In this paper we propose an exact algorithm that maximizes the sharing of partial terms in Multiple Constant Multiplication (MCM) operations. We model this problem as a Boolean...