238 search results - page 21 / 48 » Compositional Proof Methods for Concurrency: A Semantic Appr... |
ESOP
2004
Springer
15 years 3 months ago
2004
Springer
t) Peter W. O’Hearn Queen Mary, University of London In the 1960s Dijkstra suggested that, in order to limit the complexity of potential process interactions, concurrent programs...
93
Voted
WWW
2004
ACM
15 years 10 months ago
2004
ACM
Complex Semantic Web (SW) services may have intricate data state, autonomous process behavior and concurrent interactions. The design of such SW service systems requires precise a...
173
click to vote
ICDE
2007
IEEE
15 years 11 months ago
2007
IEEE
Entity matching (a.k.a. record linkage) plays a crucial role in integrating multiple data sources, and numerous matching solutions have been developed. However, the solutions have...
FM
2009
Springer
15 years 1 months ago
2009
Springer
Abstract. Linearizability is an important correctness criterion for implementations of concurrent objects. Automatic checking of linearizability is challenging because it requires ...
100
Voted
DAC
1994
ACM
15 years 1 months ago
1994
ACM
Current asynchronous tools are focussed mainly on the design of a single interface module. In many applications, one must design interacting interface modules that potentially comm...