Sciweavers

428 search results - page 76 / 86
» FPGA-Based SAT Solver
Sort
View
POPL
2010
ACM
14 years 5 months ago
Structuring the verification of heap-manipulating programs
Most systems based on separation logic consider only restricted forms of implication or non-separating conjunction, as full support for these connectives requires a non-trivial no...
Aleksandar Nanevski, Josh Berdine, Viktor Vafeiadi...
FPGA
2009
ACM
180views FPGA» more  FPGA 2009»
14 years 2 months ago
Scalable don't-care-based logic optimization and resynthesis
We describe an optimization method for combinational and sequential logic networks, with emphasis on scalability and the scope of optimization. The proposed resynthesis (a) is cap...
Alan Mishchenko, Robert K. Brayton, Jie-Hong Rolan...
ICTAI
2009
IEEE
14 years 2 months ago
Local Autarkies Searching for the Dynamic Partition of CNF Formulae
In this paper an original dynamic partition of formulae in Conjunctive Normal Form (CNF) is presented. It is based on the autarky concept first introduced by Monien and Speckenme...
Éric Grégoire, Bertrand Mazure, Lakh...
IPPS
2009
IEEE
14 years 2 months ago
Combining multiple heuristics on discrete resources
—In this work we study the portfolio problem which is to find a good combination of multiple heuristics to solve given instances on parallel resources in minimum time. The resou...
Marin Bougeret, Pierre-François Dutot, Alfr...
SACMAT
2009
ACM
14 years 2 months ago
Safety in discretionary access control for logic-based publish-subscribe systems
Publish-subscribe (pub-sub) systems are useful for many applications, including pervasive environments. In the latter context, however, great care must be taken to preserve the pr...
Kazuhiro Minami, Nikita Borisov, Carl A. Gunter