17 search results - page 2 / 4 » A Coq Library for Verification of Concurrent Programs |
PEPM
2010
ACM
13 years 6 months ago
2010
ACM
Software engineering, automated reasoning, rule-based programming or specifications often use rewriting systems for which termination, among other properties, may have to be ensur...
CAV
2008
Springer
13 years 6 months ago
2008
Springer
Program verification for relaxed memory models is hard. The high degree of nondeterminism in such models challenges standard verification techniques. This paper proposes a new veri...
ICFP
2008
ACM
14 years 4 months ago
2008
ACM
Transactional events (TE) are an approach to concurrent programming that enriches the first-class synchronous message-passing of Concurrent ML (CML) with a combinator that allows ...
POPL
2010
ACM
14 years 2 months ago
2010
ACM
We address the verification problem of finite-state concurrent programs running under weak memory models. These models capture the reordering of program (read and write) operation...
POPL
2009
ACM
14 years 5 months ago
2009
ACM
This work develops an integrated approach to the verification of behaviourally rich programs, founded directly on operational semantics. The power of the approach is demonstrated ...