906 search results - page 28 / 182 » Linking Theories of Concurrency |
KBSE
1999
IEEE
15 years 1 months ago
1999
IEEE
Modularization and abstraction are the keys to practical verification and analysis of large and complex systems. We present in an incremental methodology for the automatic analysi...
ISOLA
2010
Springer
14 years 8 months ago
2010
Springer
This article comprehensively surveys the work accomplished during the past decade on an approach to analyze concurrent systems qualitatively and quantitatively, by combining functi...
WDAG
2004
Springer
15 years 3 months ago
2004
Springer
We apply the classic theory of linearizability to operations that must wait for some other thread to establish a precondition. We model such an operation as a request and a follow-...
105
click to vote
CORR
2008
Springer
14 years 9 months ago
2008
Springer
Milner's bigraphs [1] are a general framework for reasoning about distributed and concurrent programming languages. Notably, it has been designed to encompass both the -calcul...
FOSSACS
2005
Springer
15 years 3 months ago
2005
Springer
The idea of composition and decomposition to obtain computability results is particularly relevant for true-concurrency. In contrast to the interleaving world, where composition an...