2272 search results - page 344 / 455 » A Calculus for |
CONCUR
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. An impure language is one that combines functional and imperative constructs. We propose a method for ensuring termination of impure concurrent languages that makes it po...
114
click to vote
ESORICS
2010
Springer
15 years 1 months ago
2010
Springer
We present a formal, symbolic definition of election verifiability for electronic voting protocols in the context of the applied pi calculus. Our definition is given in terms of bo...
115
Voted
GPCE
2008
Springer
15 years 1 months ago
2008
Springer
Building complex component-based software architectures can lead to subtle assemblage errors. In this paper, we introduce a typesystem-based approach to avoid message handling err...
74
Voted
CORR
2010
Springer
15 years 25 days ago
2010
Springer
In our paper "Uniformity and the Taylor expansion of ordinary lambda-terms" (with Laurent Regnier), we studied a translation of lambda-terms as infinite linear combinati...
CORR
2008
Springer
15 years 25 days ago
2008
Springer
We present a new technique for verifying correspondences in security protocols. In particular, correspondences can be used to formalize authentication. Our technique is fully auto...