Sciweavers

727 search results - page 87 / 146
» A Calculus of Bounded Capacities
Sort
View
CCS
2005
ACM
14 years 4 months ago
Deciding security of protocols against off-line guessing attacks
We provide an effective procedure for deciding the existence of off-line guessing attacks on security protocols, for a bounded number of sessions. The procedure consists of a co...
Mathieu Baudet
FOSSACS
2005
Springer
14 years 4 months ago
A Simpler Proof Theory for Nominal Logic
Abstract. Nominal logic is a variant of first-order logic equipped with a “freshname quantifier” N and other features useful for reasoning about languages with bound names. I...
James Cheney
LICS
2002
IEEE
14 years 4 months ago
Complete Problems for Dynamic Complexity Classes
We present the first complete problems for dynamic complexity classes including the classes Dyn-FO and Dyn-ThC ¢ , the dynamic classes corresponding to relational calculus and (...
William Hesse, Neil Immerman
CLUSTER
2000
IEEE
14 years 3 months ago
A Concurrent Programming Environment with Support for Distributed Computations and Code Mobility
We propose a programming model for distributed concurrent systems with mobile objects in the context of a process calculus. Code mobility is induced by lexical scoping on names. O...
Luís M. B. Lopes, Álvaro Reis Figuei...
LICS
1999
IEEE
14 years 3 months ago
Subtyping Recursive Types in Kernel Fun
The problem of defining and checking a subtype relation between recursive types was studied in [3] for a first order type system, but for second order systems, which combine subty...
Dario Colazzo, Giorgio Ghelli