2272 search results - page 209 / 455 » A Calculus for |
118
click to vote
ICFP
2003
ACM
16 years 4 months ago
2003
ACM
The shift and reset operators, proposed by Danvy and Filinski, are powerful control primitives for capturing delimited continuations. Delimited continuation is a similar concept a...
124
click to vote
MKM
2009
Springer
15 years 11 months ago
2009
Springer
This paper presents a proof language based on the work of Sacerdoti Coen [1,2], Kirchner [3] and Autexier [4] on ¯λµ˜µ, a calculus introduced by Curien and Herbelin [5,6]. Jus...
131
click to vote
CSFW
2008
IEEE
15 years 11 months ago
2008
IEEE
We investigate the composition of protocols that share a common secret. This situation arises when users employ the same password on different services. More precisely we study w...
136
click to vote
CSFW
2007
IEEE
15 years 11 months ago
2007
IEEE
There has been excellent progress on languages for rigorously describing key exchange protocols and techniques for proving that the network security tunnels they establish preserv...
152
click to vote
LICS
2007
IEEE
15 years 11 months ago
2007
IEEE
d abstract) Marcin Jurdzi´nski and Ranko Lazi´c∗ Department of Computer Science, University of Warwick, UK An alternation-free modal µ-calculus over data trees is introduced ...