48 search results - page 7 / 10 » A Logical Characterisation of Static Equivalence |
IANDC
2006
14 years 9 months ago
2006
We study three operational models of name-passing process calculi: coalgebras on (pre)sheaves, indexed labelled transition systems, and history dependent automata. The coalgebraic...
FSTTCS
1999
Springer
15 years 1 months ago
1999
Springer
We present a (the rst?) sound and relatively complete Hoare logic for a simple imperative programming language including mutually recursive procedures with call-by-value parameters...
103
click to vote
LICS
2007
IEEE
15 years 3 months ago
2007
IEEE
The combination of first-order epistemic logic and formal cryptography offers a potentially very powerful framework for security protocol verification. In this article, we addre...
167
click to vote
POPL
2004
ACM
15 years 9 months ago
2004
ACM
We define seal, an untyped call-by-value -calculus with primitives for protecting abstract data by sealing, and develop a bisimulation proof method that is sound and complete with...
97
Voted
ICFP
2003
ACM
15 years 9 months ago
2003
ACM
FreshML extends ML with elegant and practical constructs for declaring and manipulating syntactical data involving statically scoped binding operations. User-declared FreshML data...