317 search results - page 41 / 64 » Reasoning about the Implementation of Concurrency Abstractio... |
107
click to vote
CADE
2005
Springer
16 years 1 months ago
2005
Springer
Abstract This paper describes a formalisation of the lambda-calculus in a HOL-based theorem prover using nominal techniques. Central to the formalisation is an inductive set that i...
106
click to vote
DAIS
2006
15 years 2 months ago
2006
To maintain availability and responsiveness, mobile applications sharing data often work on their own copy and transmit local changes to other participants. Existing systems for re...
111
click to vote
IFM
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. We present a framework for model checking concurrent software systems which incorporates both states and events. Contrary to other state/event approaches, our work also i...
123
click to vote
CCS
2005
ACM
15 years 7 months ago
2005
ACM
We study formal security properties of network-attached storage (NAS) in an applied pi calculus. We model NAS as an implementation of a specification based on traditional central...
120
click to vote
ICFP
2008
ACM
16 years 1 months ago
2008
ACM
We describe an axiomatic extension to the Coq proof assistant, that supports writing, reasoning about, and extracting higher-order, dependently-typed programs with side-effects. C...