POPL
2004
ACM
14 years 8 months ago
2004
ACM
POPL
2004
ACM
14 years 8 months ago
2004
ACM
POPL
2004
ACM
14 years 8 months ago
2004
ACM
POPL
2004
ACM
14 years 8 months ago
2004
ACM
We show how some classical static analyses for imperative programs, and the optimizing transformations which they enable, may be expressed and proved correct using elementary logi...
POPL
2004
ACM
14 years 8 months ago
2004
ACM
We present a notion of -long ? -normal term for the typed lambda calculus with sums and prove, using Grothendieck logical relations, that every term is equivalent to one in norm...
POPL
2005
ACM
14 years 8 months ago
2005
ACM
This paper presents a new approach for verifying confidenfor programs, based on abstract interpretation. The framework is formally developed and proved correct in the theorem prov...
POPL
2005
ACM
14 years 8 months ago
2005
ACM
We present PEAR (Protocol Extendable AnalyzeR), a tool automating the two static analyses for authentication protocols presented in [7, 8]. These analyses are based on a tagging s...
POPL
2005
ACM
14 years 8 months ago
2005
ACM
POPL
2005
ACM
14 years 8 months ago
2005
ACM
Network protocol design is usually an informal process where debugging is based on successive iterations of a prototype implementation. The feedback provided by a prototype can be...
POPL
2005
ACM
14 years 8 months ago
2005
ACM
Several formal languages have been proposed to encode privacy policies, ranging from the Platform for Privacy Preferences (P3P), intended for communicating privacy policies to con...