566 search results - page 62 / 114 » Array Abstractions from Proofs |
133
click to vote
ASIACRYPT
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. The generic (aka. black-box) group model is a valuable methodology for analyzing the computational hardness of number-theoretic problems used in cryptography. Since the p...
137
click to vote
JUCS
2006
15 years 3 months ago
2006
Abstract: We present a novel approach to the verification of functional-logic programs. For our verification purposes, equational reasoning is not valid due to the presence of non-...
128
click to vote
CADE
2005
Springer
16 years 3 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...
113
click to vote
ESORICS
2002
Springer
16 years 2 months ago
2002
Springer
In recent times information flow and non-interference have become very popular concepts for expressing both integrity and privacy properties. We present the first general definitio...
96
Voted
ESOP
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Rely-guarantee is a well-established approach to reasoning about concurrent programs that use parallel composition. However, parallel composition is not how concurrency i...