Today’s shared-memory parallel programming models are complex and error-prone. While many parallel programs are intended to be deterministic, unanticipated thread interleavings ...
Robert L. Bocchino Jr., Vikram S. Adve, Danny Dig,...
We use the notion of boundary points to study resolution proofs. Given a CNF formula F, a lit(x)-boundary point is a complete assignment falsifying only clauses of F having the sam...
Dual Consistency (DC) is a property of Constraint Networks (CNs) which is equivalent, in its unrestricted form, to Path Consistency (PC). The principle is to perform successive sin...
Abstract. We present a “memory-model-sensitive” approach to validating correctness properties for multithreaded programs. Our key insight is that by specifying both the inter-t...
Based on the coherence principle of de Finetti and a related notion of generalized coherence (g-coherence), we adopt a probabilistic approach to uncertainty based on conditional p...
Veronica Biazzo, Angelo Gilio, Giuseppe Sanfilippo