default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID7th FoSSaCS 2004: Barcelona, Spain
- Igor Walukiewicz:
Foundations of Software Science and Computation Structures, 7th International Conference, FOSSACS 2004, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2004, Barcelona, Spain, March 29 - April 2, 2004, Proceedings. Lecture Notes in Computer Science 2987, Springer 2004, ISBN 3-540-21298-1
Invited Constributions
- Hubert Comon-Lundh:
Intruder Theories (Ongoing Work). 1-4 - Robin Milner:
Theories for the Global Ubiquitous Computer. 5-11
Constributed Papers
- Martín Abadi, Georges Gonthier, Benjamin Werner:
Choice in Dynamic Linking. 12-26 - Patrick Baillot, Virgile Mogbil:
Soft lambda-Calculus: A Language for Polynomial Time Computation. 27-41 - Liana Bozga, Cristian Ene, Yassine Lakhnech:
On the Existence of an Effective and Complete Inference System for Cryptographic Protocols. 42-57 - Antonio Bucciarelli, Benjamin Leperchey:
Hypergraphs and Degrees of Parallelism: A Completeness Result. 58-71 - Luís Caires:
Behavioral and Spatial Observations in a Logic for the pi-Calculus. 72-89 - Jérémie Chalopin, Yves Métivier:
Election and Local Computations on Edges. 90-104 - Giovanni Conforti, Giorgio Ghelli:
Decidability of Freshness, Undecidability of Revelation. 105-120 - Stéphane Demri:
LTL over Integer Periodicity Constraints: (Extended Abstract). 121-135 - Pietro Di Gianantonio, Marino Miculan:
Unifying Recursive and Co-recursive Definitions in Sheaf Categories. 136-150 - Hartmut Ehrig, Barbara König:
Deriving Bisimulation Congruences in the DPO Approach to Graph Rewriting. 151-166 - Andrzej Filinski, Henning Korsholm Rohde:
A Denotational Account of Untyped Normalization by Evaluation. 167-181 - Wan J. Fokkink, Sumit Nain:
On Finite Alphabets and Infinite Bases: From Ready Pairs to Possible Worlds. 182-194 - Blaise Genest, Marius Minea
, Anca Muscholl, Doron A. Peled:
Specifying and Verifying Partial Order Properties Using Template MSCs. 195-210 - Dan R. Ghica, Andrzej S. Murawski:
Angelic Semantics of Fine-Grained Concurrency. 211-225 - Pablo Giambiagi, Gerardo Schneider, Frank D. Valencia:
On the Expressiveness of Infinite Behavior and Name Scoping in Process Calculi. 226-240 - Matthew Hennessy, Julian Rathke, Nobuko Yoshida:
safeDpi: A Language for Controlling Mobile Code. 241-256 - Daniel Kirsten:
Distance Desert Automata and the Star Height One Problem. 257-272 - Stephen Lack, Pawel Sobocinski:
Adhesive Categories. 273-288 - James Laird:
A Game Semantics of Local Names and Good Variables. 289-303 - Daniel Leivant:
Partial Correctness Assertions Provable in Dynamic Logics. 304-317 - Salvador Lucas:
Polynomials for Proving Termination of Context-Sensitive Rewriting. 318-332 - Gerald Lüttgen, Walter Vogler:
Bisimulation on Speed: Lower Time Bounds. 333-347 - Oded Maler, Amir Pnueli:
On Recognizable Timed Languages. 348-362 - Sebastian Maneth, Giorgio Busatto:
Tree Transducers and Tree Compressions. 363-377 - Antoine Meyer:
On Term Rewriting Systems Having a Rational Derivation. 378-392 - Michael W. Mislove, Joël Ouaknine, Dusko Pavlovic, James Worrell:
Duality for Labelled Markov Processes. 393-407 - Iain Phillips, Maria Grazia Vigliotti:
Electoral Systems in Ambient Calculi. 408-422 - Emmanuel Polonowski:
Strong Normalization of lambda-mu-mu/tilde-Calculus with Explicit Substitutions. 423-437 - John Power:
Canonical Models for Computational Effects. 438-452 - Riccardo Pucella, Vicky Weissman:
Reasoning about Dynamic Policies. 453-467 - Ajith Ramanathan, John C. Mitchell, Andre Scedrov, Vanessa Teague:
Probabilistic Bisimulation and Equivalence for Security Analysis of Network Protocols. 468-483 - Lucian Wischik, Philippa Gardner:
Strong Bisimulation for the Explicit Fusion Calculus. 484-498 - Wieslaw Zielonka:
Perfect-Information Stochastic Parity Games. 499-513 - Roberto Zunino, Pierpaolo Degano:
A Note on the Perfect Encryption Assumption in a Process Calculus. 514-528
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-06-09 22:38 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
