7109 search results - page 453 / 1422 » Process Algebra with Combinators |
178
click to vote
ESORICS
2003
Springer
16 years 3 days 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...
194
click to vote
GI
1997
Springer
15 years 11 months ago
1997
Springer
Object-Gofer is a small, practical extension of the functional programming language Gofer incorporating the following ideas from the object-oriented community: objects and toplevel...
206
click to vote
COMPGEOM
1994
ACM
15 years 11 months ago
1994
ACM
Let F be a collection of n d-variate, possibly partially defined, functions, all algebraic of some constant maximum degree. We present a randomized algorithm that computes the vert...
190
click to vote
FPCA
1989
15 years 11 months ago
1989
Parametric polymorphism constrains the behavior of pure functional programs in a way that allows the derivation of interesting theorems about them solely from their types, i.e., v...
184
click to vote
CCS
2008
ACM
15 years 8 months ago
2008
ACM
In the Horn theory based approach for cryptographic protocol analysis, cryptographic protocols and (Dolev-Yao) intruders are modeled by Horn theories and security analysis boils d...