When Ambients Cannot Be Opened

rized Verification by Probabilistic Abstraction . . . . . . . . . . . . . . . . 87 Tamarah Arons, Amir Pnueli, Lenore Zuck Genericity and the π-Calculus . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 103 Martin Berger, Kohei Honda, Nobuko Yoshida Model Checking Lossy Channels Systems Is Probably Decidable . . . . . . . . 120 Nathalie Bertrand, Philippe Schnoebelen Verification of Cryptographic Protocols: Tagging Enforces Termination . . 136 Bruno Blanchet, Andreas Podelski A Normalisation Result for Higher-Order Calculi with Explicit Substitutions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 153 Eduardo Bonelli When Ambients Cannot be Opened . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 169 Iovka Boneva, Jean-Marc Talbot Computability over an Arbitrary Structure. Sequential and Parallel Polynomial Time . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ....

• Type: Conference
• Year: 2003
• Where: FOSSACS
• Authors: Iovka Boneva, Jean-Marc Talbot
• Keywords: Applied Computing, FOSSACS 2003, Lenore Zuck Genericity, Nobuko Yoshida Model, Philippe Schnoebelen Verification