1206 search results - page 106 / 242 » Concurrent Abstract Predicates |
105
click to vote
ENTCS
2000
15 years 2 months ago
2000
The language MSR has successfully been used in the past to prove undecidability about security protocols modeled according to the Dolev-Yao abstraction. In this paper, we revise t...
131
click to vote
CORR
2011
Springer
14 years 9 months ago
2011
Springer
We take a fresh look at the logics of informational dependence and independence of Hintikka and Sandu and V¨a¨an¨anen, and their compositional semantics due to Hodges. We show h...
107
click to vote
HPDC
1998
IEEE
15 years 6 months ago
1998
IEEE
Abstract Metacomputing is the seamless application of geographically-separated distributed computing resources to user applications. We consider the scheduling of metaapplications;...
131
Voted
CONCUR
2012
Springer
13 years 4 months ago
2012
Springer
Abstract. Linearizability is a commonly accepted notion of correctness for libraries of concurrent algorithms. Unfortunately, it assumes a complete isolation between a library and ...
104
Voted
FMCAD
2009
Springer
15 years 9 months ago
2009
Springer
Abstract—Several successful approaches to software verificabased on the construction and analysis of an abstract reachability tree (ART). The ART represents unwindings of the co...