2137 search results - page 272 / 428 » Proving Abstract Non-interference |
134
click to vote
MICS
2010
15 years 2 months ago
2010
Abstract. There is something of a discontinuity at the heart of popular tactical theorem provers. Low-level, fully-checked mechanical proofs are large trees consisting of primitive...
150
Voted
POPL
2010
ACM
16 years 1 months ago
2010
ACM
The method of logical relations is a classic technique for proving the equivalence of higher-order programs that implement the same observable behavior but employ different intern...
121
Voted
VMCAI
2007
Springer
15 years 10 months ago
2007
Springer
Abstraction frameworks use under-approximating transitions in order to prove existential properties of concrete systems. Under-approximating transifer to the concrete states that c...
132
click to vote
ESORICS
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. Proofs of security protocols typically employ simple abstractions of cryptographic operations, so that large parts of such proofs pendent of cryptographic details. The ty...
131
click to vote
TAPSOFT
1995
Springer
15 years 7 months ago
1995
Springer
Abstract. Binding-time analyses based on flow analysis have been presented by Bondorf, Consel, Bondorf and Jørgensen, and Schwartzbach and the present author. The analyses are fo...