Sciweavers

187 search results - page 25 / 38
» Limits and Possibilities of BDDs in State Space Search
Sort
View
CORR
2010
Springer
162views Education» more  CORR 2010»
14 years 8 months ago
Backward Reachability of Array-based Systems by SMT solving: Termination and Invariant Synthesis
The safety of infinite state systems can be checked by a backward reachability procedure. For certain classes of systems, it is possible to prove the termination of the procedure ...
Silvio Ghilardi, Silvio Ranise
83
Voted
INFOSCALE
2006
ACM
15 years 3 months ago
Storage load balancing via local interactions among peers in unstructured P2P networks
— The present paper introduces a replication method that is meant to balance the storage load of peers in unstructured peer-to-peer (P2P) networks for file sharing and to provid...
Kei Ohnishi, Hiroshi Yamamoto, Kento Ichikawa, Mas...
PPOPP
2005
ACM
15 years 3 months ago
Scaling model checking of dataraces using dynamic information
Dataraces in multithreaded programs often indicate severe bugs and can cause unexpected behaviors when different thread interleavings are executed. Because dataraces are a cause f...
Ohad Shacham, Mooly Sagiv, Assaf Schuster
AIPS
2009
14 years 10 months ago
Structural-Pattern Databases
abstraction heuristics, notably pattern-database and merge-and-shrink heuristics, are employed by some state-ofthe-art optimal heuristic-search planners. The major limitation of t...
Michael Katz, Carmel Domshlak
HIPC
2009
Springer
14 years 7 months ago
Three scalable approaches to improving many-core throughput for a given peak power budget
Recently proposed techniques for peak power management [18] involve centralized decisionmaking and assume quick evaluation of the various power management states. These techniques...
John Sartori, Rakesh Kumar