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 ...
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...
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...
Although shared memory programming models show good programmability compared to message passing programming models, their implementation by page-based software distributed shared m...
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...