Sciweavers

933 search results - page 183 / 187
» Extending Forward Checking
Sort
View
ICCAD
1999
IEEE
148views Hardware» more  ICCAD 1999»
14 years 21 days ago
SAT based ATPG using fast justification and propagation in the implication graph
In this paper we present new methods for fast justification and propagation in the implication graph (IG) which is the core data structure of our SAT based implication engine. As ...
Paul Tafertshofer, Andreas Ganz
PEPM
1999
ACM
14 years 20 days ago
Certifying Compilation and Run-Time Code Generation
A certifying compiler takes a source language program and produces object code, as well as a certi cate" that can be used to verify that the object code satis es desirable pr...
Luke Hornof, Trevor Jim
CLUSTER
2004
IEEE
14 years 4 days ago
Rolls: modifying a standard system installer to support user-customizable cluster frontend appliances
The Rocks toolkit [9], [7], [10] uses a graph-based framework to describe the configuration of all node types (termed appliances) that make up a complete cluster. With hundreds of...
Greg Bruno, Mason J. Katz, Federico D. Sacerdoti, ...
CCS
2006
ACM
14 years 4 days ago
Safety and consistency in policy-based authorization systems
In trust negotiation and other distributed proving systems, networked entities cooperate to form proofs that are justified by collections of certified attributes. These attributes...
Adam J. Lee, Marianne Winslett
COCO
2010
Springer
186views Algorithms» more  COCO 2010»
13 years 11 months ago
Derandomized Parallel Repetition of Structured PCPs
A PCP is a proof system for NP in which the proof can be checked by a probabilistic verifier. The verifier is only allowed to read a very small portion of the proof, and in return ...
Irit Dinur, Or Meir