238 search results - page 7 / 48 » Compositional Proof Methods for Concurrency: A Semantic Appr... |
67
Voted
COLING
2010
14 years 4 months ago
2010
In distributional semantics studies, there is a growing attention in compositionally determining the distributional meaning of word sequences. Yet, compositional distributional mo...
118
click to vote
HASKELL
2009
ACM
15 years 4 months ago
2009
ACM
We address the problem of reasoning about Haskell programs that use Software Transactional Memory (STM). As a motivating example, we consider Haskell code for a concurrent non-det...
61
Voted
CONCUR
2010
Springer
14 years 10 months ago
2010
Springer
This paper proposes a geometric solution to the problem of prime decomposability of concurrent processes first explored by R. Milner and F. Moller in [MM93]. Concurrent programs ar...
ECBS
2000
IEEE
15 years 2 months ago
2000
IEEE
The design of a large component-based software system typically involves the composition of different components. Instead of relying on a free composition of components, we advoca...
CSFW
2006
IEEE
15 years 3 months ago
2006
IEEE
We develop a compositional method for proving cryptographically sound security properties of key exchange protocols, based on a symbolic logic that is interpreted over conventiona...