238 search results - page 6 / 48 » Compositional Proof Methods for Concurrency: A Semantic Appr... |
112
click to vote
CALCO
2007
Springer
15 years 10 months ago
2007
Springer
We motivate and present a logical semantic approach to types for concurrency and to the soundness of related systems. The approach is illustrated by the development of a generic ty...
128
Voted
CADE
2008
Springer
16 years 4 months ago
2008
Springer
Abstract. A proof method is described which combines compositional proofs of interleaved parallel programs with the intuitive and highly automatic strategy of symbolic execution. A...
131
Voted
AICOM
2010
15 years 3 months ago
2010
This paper presents an interactive proof method for the verification of temporal properties of concurrent systems based on symbolic execution. Symbolic execution is a well known a...
115
Voted
JLP
2011
14 years 6 months ago
2011
A Concurrent Kleene Algebra offers two composition operators, related by a weak version of an exchange law: when applied in a trace model of program semantics, one of them stands...
124
click to vote
CCS
2001
ACM
15 years 8 months ago
2001
ACM
The events of a security protocol and their causal dependency can play an important role in the analysis of security properties. This insight underlies both strand spaces and the ...