224 search results - page 28 / 45 » Algorithms for Solving Boolean Satisfiability in Combination... |
144
Voted
ICCAD
2002
IEEE
16 years 18 days ago
2002
IEEE
In this paper we present an advanced functional extraction tool for automatic generation of high-level RTL from switch-level circuit netlist representation. The tool is called FEV...
183
click to vote
SIAMCOMP
2011
14 years 10 months ago
2011
Abstract. In the 2nd Annual FOCS (1961), Chao-Kong Chow proved that every Boolean threshold function is uniquely determined by its degree-0 and degree-1 Fourier coefficients. These...
158
click to vote
CAV
2008
Springer
15 years 5 months ago
2008
Springer
We present CSIsat, an interpolating decision procedure for the quantifier-free theory of rational linear arithmetic and equality with uninterpreted function symbols. Our implementa...
155
click to vote
JAIR
2010
14 years 10 months ago
2010
The Hamiltonian cycle problem (HCP) is an important combinatorial problem with applications in many areas. It is among the first problems used for studying intrinsic properties, i...
148
Voted
EDCC
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. We present the PathCrawler prototype tool for the automatic generation of test-cases satisfying the rigorous all-paths criterion, with a user-defined limit on the number...