Detecting whether a finite execution trace (or a computation) of a distributed program satisfies a given predicate, called predicate detection, is a fundamental problem in distr...
Abstract. We study the problem of global predicate detection in presence of permanent and transient failures. We term the transient failures as small faults. We show that it is imp...
ion Benjamin Van Durme, Phillip Michalak and Lenhart K. Schubert Department of Computer Science University of Rochester Rochester, NY 14627, USA Existing work in the extraction of...
Benjamin Van Durme, Phillip Michalak, Lenhart Schu...
Following results are sketched in this extended abstract: (1) Datalog recursive programs where each rule has at most one subgoal called unit recursions are shown to be bounded, wit...
Abstract. In the constraint satisfaction problem (CSP), the aim is to find an assignment of values to a set of variables subject to specified constraints. In the minimum cost hom...