Abstract is missing.
- Intruder Theories (Ongoing Work)Hubert Comon-Lundh. 1-4 [doi]
- Theories for the Global Ubiquitous ComputerRobin Milner. 5-11 [doi]
- Choice in Dynamic LinkingMartín Abadi, Georges Gonthier, Benjamin Werner. 12-26 [doi]
- Soft lambda-Calculus: A Language for Polynomial Time ComputationPatrick Baillot, Virgile Mogbil. 27-41 [doi]
- On the Existence of an Effective and Complete Inference System for Cryptographic ProtocolsLiana Bozga, Cristian Ene, Yassine Lakhnech. 42-57 [doi]
- Hypergraphs and Degrees of Parallelism: A Completeness ResultAntonio Bucciarelli, Benjamin Leperchey. 58-71 [doi]
- Behavioral and Spatial Observations in a Logic for the pi-CalculusLuís Caires. 72-89 [doi]
- Election and Local Computations on EdgesJérémie Chalopin, Yves Métivier. 90-104 [doi]
- Decidability of Freshness, Undecidability of RevelationGiovanni Conforti, Giorgio Ghelli. 105-120 [doi]
- LTL over Integer Periodicity Constraints: (Extended Abstract)Stéphane Demri. 121-135 [doi]
- Unifying Recursive and Co-recursive Definitions in Sheaf CategoriesPietro Di Gianantonio, Marino Miculan. 136-150 [doi]
- Deriving Bisimulation Congruences in the DPO Approach to Graph RewritingHartmut Ehrig, Barbara König. 151-166 [doi]
- A Denotational Account of Untyped Normalization by EvaluationAndrzej Filinski, Henning Korsholm Rohde. 167-181 [doi]
- On Finite Alphabets and Infinite Bases: From Ready Pairs to Possible WorldsWan Fokkink, Sumit Nain. 182-194 [doi]
- Specifying and Verifying Partial Order Properties Using Template MSCsBlaise Genest, Marius Minea, Anca Muscholl, Doron Peled. 195-210 [doi]
- Angelic Semantics of Fine-Grained ConcurrencyDan R. Ghica, Andrzej S. Murawski. 211-225 [doi]
- On the Expressiveness of Infinite Behavior and Name Scoping in Process CalculiPablo Giambiagi, Gerardo Schneider, Frank D. Valencia. 226-240 [doi]
- safeDpi: A Language for Controlling Mobile CodeMatthew Hennessy, Julian Rathke, Nobuko Yoshida. 241-256 [doi]
- Distance Desert Automata and the Star Height One ProblemDaniel Kirsten. 257-272 [doi]
- Adhesive CategoriesStephen Lack, Pawel Sobocinski. 273-288 [doi]
- A Game Semantics of Local Names and Good VariablesJames Laird. 289-303 [doi]
- Partial Correctness Assertions Provable in Dynamic LogicsDaniel Leivant. 304-317 [doi]
- Polynomials for Proving Termination of Context-Sensitive RewritingSalvador Lucas. 318-332 [doi]
- Bisimulation on Speed: Lower Time BoundsGerald Lüttgen, Walter Vogler. 333-347 [doi]
- On Recognizable Timed LanguagesOded Maler, Amir Pnueli. 348-362 [doi]
- Tree Transducers and Tree CompressionsSebastian Maneth, Giorgio Busatto. 363-377 [doi]
- On Term Rewriting Systems Having a Rational DerivationAntoine Meyer. 378-392 [doi]
- Duality for Labelled Markov ProcessesMichael W. Mislove, Joël Ouaknine, Dusko Pavlovic, James Worrell. 393-407 [doi]
- Electoral Systems in Ambient CalculiIain Phillips, Maria Grazia Vigliotti. 408-422 [doi]
- Strong Normalization of lambda-mu-mu/tilde-Calculus with Explicit SubstitutionsEmmanuel Polonovski. 423-437 [doi]
- Canonical Models for Computational EffectsJohn Power. 438-452 [doi]
- Reasoning about Dynamic PoliciesRiccardo Pucella, Vicky Weissman. 453-467 [doi]
- Probabilistic Bisimulation and Equivalence for Security Analysis of Network ProtocolsAjith Ramanathan, John C. Mitchell, Andre Scedrov, Vanessa Teague. 468-483 [doi]
- Strong Bisimulation for the Explicit Fusion CalculusLucian Wischik, Philippa Gardner. 484-498 [doi]
- Perfect-Information Stochastic Parity GamesWieslaw Zielonka. 499-513 [doi]
- A Note on the Perfect Encryption Assumption in a Process CalculusRoberto Zunino, Pierpaolo Degano. 514-528 [doi]