74 search results - page 11 / 15 » Local Proofs for Linear-Time Properties of Concurrent Progra... |
IFIP
2009
Springer
14 years 1 months ago
2009
Springer
We present an abstract language for distributed systems of processes with local memory and private communication channels. Communication between processes is done via messaging. Th...
ICFP
2010
ACM
13 years 9 months ago
2010
ACM
Reasoning about program equivalence is one of the oldest problems in semantics. In recent years, useful techniques have been developed, based on bisimulations and logical relation...
DC
2010
13 years 8 months ago
2010
Model checking software transactional memories (STMs) is difficult because of the unbounded number, length, and delay of concurrent transactions and the unbounded size of the memo...
ATVA
2006
Springer
14 years 9 days ago
2006
Springer
Ping-pong protocols with recursive definitions of agents, but without any active intruder, are a Turing powerful model. We show that under the environment sensitive semantics (i.e....
POPL
2007
ACM
14 years 9 months ago
2007
ACM
In this paper, we propose a new algorithm for proving the validity or invalidity of a pre/postcondition pair for a program. The algorithm is motivated by the success of the algori...