174
Voted
POPL
2001
ACM
15 years 11 months ago
2001
ACM
We propose a general, powerful framework of type systems for the -calculus, and show that we can obtain as its instances a variety of type systems guaranteeing non-trivial propert...
155
Voted
POPL
2001
ACM
15 years 11 months ago
2001
ACM
154
Voted
POPL
2001
ACM
15 years 11 months ago
2001
ACM
Current verification condition (VC) generation algorithms, such as weakest preconditions, yield a VC whose size may be exponential in the size of the code fragment being checked. ...
185
Voted
POPL
2001
ACM
15 years 11 months ago
2001
ACM
Secure Safe Ambients (SSA) are a typed variant of Safe Ambients [9], whose type system allows behavioral invariants of ambients to be expressed and verified. The most significant a...
214
Voted
POPL
2001
ACM
15 years 11 months ago
2001
ACM
We study the interaction of the "new" construct with a rich but common form of (first-order) communication. This interaction is crucial in security protocols, which are ...
