317 search results - page 4 / 64 » Reasoning about the Implementation of Concurrency Abstractio... |
PPOPP
2009
ACM
14 years 17 days ago
2009
ACM
Abstract. Transactional memory (TM) promises to simplify construction of parallel applications by allowing programmers to reason about interactions between concurrently executing c...
CASCON
2001
13 years 7 months ago
2001
Automated verification tools vary widely in the types of properties they are able to analyze, the complexity of their algorithms, and the amount of necessary user involvement. In ...
DATE
2006
IEEE
13 years 11 months ago
2006
IEEE
Concurrent programs are difficult to write, reason about, re-use, and maintain. In particular, for system-level ions that use a shared memory abstraction for thread or process syn...
LICS
1994
IEEE
13 years 10 months ago
1994
IEEE
abstract semantics for concurrent graph reduction ALAN JEFFREY This paper presents a fully abstract semantics for a variant of the untyped -calculus with recursive declarations. We...
LANMR
2004
13 years 7 months ago
2004
Abstract. This article describes our implementation in Answer Set Programming of a reasoning system that models the flow of lava in volcanic eruptions. Our system can be employed i...