113 search results - page 4 / 23 » Semantic Reduction of Thread Interleavings in Concurrent Pro... |
ISCA
2009
IEEE
13 years 11 months ago
2009
IEEE
Shared-memory multi-threaded programming is inherently more difficult than single-threaded programming. The main source of complexity is that, the threads of an application can in...
CAV
2009
Springer
14 years 5 months ago
2009
Springer
Abstract. We present a new technique called Monotonic Partial Order Reduction (MPOR) that effectively combines dynamic partial order reduction with symbolic state space exploration...
JFP
2000
13 years 5 months ago
2000
Indeterminism is typical for concurrent computation. If several concurrent actors compete for the same resource then at most one of them may succeed, whereby the choice of the suc...
PPDP
1999
Springer
13 years 9 months ago
1999
Springer
Curry is a multi-paradigm declarative language covering functional, logic, and concurrent programming paradigms. Curry’s operational semantics is based on lazy reduction of expre...
CAV
2010
Springer
2010
Springer
Universal Causality Graphs: A Precise Happens-Before Model for Detecting Bugs in Concurrent Programs
13 years 7 months ago
Triggering errors in concurrent programs is a notoriously difficult task. A key reason for this is the behavioral complexity resulting from the large number of interleavings of op...