4426 search results - page 84 / 886 » Concurrent Constraint Programming |
161
click to vote
ESOP
2010
Springer
16 years 1 months ago
2010
Springer
Formal reasoning about concurrent programs is usually done with the assumption that the underlying memory model is sequentially consistent, i.e. the execution outcome is equivalen...
134
click to vote
PPOPP
2009
ACM
16 years 4 months ago
2009
ACM
Researchers in transactional memory (TM) have proposed open nesting as a methodology for increasing the concurrency of transactional programs. The idea is to ignore "low-leve...
147
click to vote
CAV
2009
Springer
16 years 4 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...
131
click to vote
POPL
2011
ACM
14 years 6 months ago
2011
ACM
Shared-memory concurrency in C and C++ is pervasive in systems programming, but has long been poorly defined. This motivated an ongoing shared effort by the standards committees ...
139
click to vote
COORDINATION
2009
Springer
15 years 10 months ago
2009
Springer
Joins or chords is a concurrency construct that seems to fit well with the object oriented paradigm. Chorded languages are presented with implicit assumptions regarding the fair t...