Sciweavers

107 search results - page 20 / 22
» Fault Localization with Non-parametric Program Behavior Mode...
Sort
View
IJCAI
2003
13 years 6 months ago
A Fast and Simple Algorithm for Bounds Consistency of the AllDifferent Constraint
In constraint programming one models a problem by stating constraints on acceptable solutions. The constraint model is then usually solved by interleaving backtracking search and ...
Alejandro López-Ortiz, Claude-Guy Quimper, ...
IJRR
2008
106views more  IJRR 2008»
13 years 5 months ago
Cooperative Cleaners: A Study in Ant Robotics
Abstract. In the world of living creatures, "simple minded" animals often cooperate to achieve common goals with amazing performance. One can consider this idea in the co...
Israel A. Wagner, Yaniv Altshuler, Vladimir Yanovs...
POPL
2010
ACM
14 years 2 months ago
A Relational Modal Logic for Higher-Order Stateful ADTs
The method of logical relations is a classic technique for proving the equivalence of higher-order programs that implement the same observable behavior but employ different intern...
Derek Dreyer, Georg Neis, Andreas Rossberg, Lars B...
CCGRID
2010
IEEE
13 years 6 months ago
Region-Based Prefetch Techniques for Software Distributed Shared Memory Systems
Although shared memory programming models show good programmability compared to message passing programming models, their implementation by page-based software distributed shared m...
Jie Cai, Peter E. Strazdins, Alistair P. Rendell
PLDI
2012
ACM
11 years 7 months ago
Speculative linearizability
Linearizability is a key design methodology for reasoning about tations of concurrent abstract data types in both shared memory and message passing systems. It provides the illusi...
Rachid Guerraoui, Viktor Kuncak, Giuliano Losa