456 search results - page 44 / 92 » A Proof System for Abstract Non-interference |
113
click to vote
APLAS
2001
ACM
15 years 5 months ago
2001
ACM
We verified two versions of the CPS transformation in Isabelle/HOL: one by Plotkin by Danvy and Filinski. We adopted first order abstract syntax so that the formalization is close...
143
click to vote
ICFP
2004
ACM
16 years 1 months ago
2004
ACM
Concurrency, as a useful feature of many modern programming languages and systems, is generally hard to reason about. Although existing work has explored the verification of concu...
118
click to vote
ISOLA
2007
Springer
15 years 7 months ago
2007
Springer
We present a model of the IEEE 1394 Root Contention Protocol with a proof of Safety. This model has real-time properties which are expressed in the language of the event B method: ...
111
click to vote
LPAR
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. Permutative logic (PL) is a noncommutative variant of multiplicative linear logic (MLL) arising from recent investigations concerning the topology of linear proofs. Permu...
113
click to vote
MKM
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. We present a computational origami construction of Morley’s triangles and automated proof of correctness of the generalized Morley’s theorem in a streamlined process ...