Sciweavers

1137 search results - page 160 / 228
» Partial Program Admission
Sort
View
FM
2009
Springer
110views Formal Methods» more  FM 2009»
14 years 4 months ago
Reduced Execution Semantics of MPI: From Theory to Practice
Abstract: There is growing need to develop formal verification tools for Message Passing Interface (MPI) programs, to eliminate bugs such as deadlocks and local assertion violatio...
Sarvani S. Vakkalanka, Anh Vo, Ganesh Gopalakrishn...
CONCUR
2007
Springer
14 years 3 months ago
Asynchronous Games: Innocence Without Alternation
The notion of innocent strategy was introduced by Hyland and Ong in order to capture the interactive behaviour of λ-terms and PCF programs. An innocent strategy is defined as an ...
Paul-André Melliès, Samuel Mimram
CP
2007
Springer
14 years 3 months ago
Constructive Interval Disjunction
Shaving and constructive disjunction are two main refutation principles used in constraint programming. The shaving principle allows us to compute the singleton arc-consistency (SA...
Gilles Trombettoni, Gilles Chabert
WAOA
2007
Springer
158views Algorithms» more  WAOA 2007»
14 years 3 months ago
Deterministic Algorithms for Rank Aggregation and Other Ranking and Clustering Problems
We consider ranking and clustering problems related to the aggregation of inconsistent information. Ailon, Charikar, and Newman [1] proposed randomized constant factor approximatio...
Anke van Zuylen, David P. Williamson
ISCA
2006
IEEE
158views Hardware» more  ISCA 2006»
14 years 3 months ago
Memory Model = Instruction Reordering + Store Atomicity
We present a novel framework for defining memory models in terms of two properties: thread-local Instruction Reordering axioms and Store Atomicity, which describes inter-thread c...
Arvind, Jan-Willem Maessen