ETAPS 2004 was the seventh instance of the European Joint Conferences on Theory and Practice of Software. ETAPS is an annual federated conference that was established in 1998 by combining a number of existing and new conferences. This year it comprised ?ve conferences (FOSSACS, FASE, ESOP, CC, TACAS), 23 satellite workshops, 1 tutorial, and 7 invited lectures (not including those that are speci?c to the satellite events). The events that comprise ETAPS address various aspects of the system - velopment process, including speci?cation, design, implementation, analysis and improvement. The languages, methodologies and tools that support these - tivities are all well within its scope. Di?erent blends of theory and practice are represented, with an inclination towards theory with a practical motivation on the one hand and soundly based practice on the other. Many of the issues inv- ved in software design apply to systems in general, including hardware systems, and the emphasis on software is not intended to be exclusive.
Author(s): Hubert Comon-Lundh (auth.), Igor Walukiewicz (eds.)
Series: Lecture Notes in Computer Science 2987
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2004
Language: English
Pages: 530
Tags: Logics and Meanings of Programs; Software Engineering; Programming Languages, Compilers, Interpreters; Computation by Abstract Devices; Mathematical Logic and Formal Languages
Front Matter....Pages -
Intruder Theories (Ongoing Work)....Pages 1-4
Theories for the Global Ubiquitous Computer....Pages 5-11
Choice in Dynamic Linking....Pages 12-26
Soft lambda-Calculus: A Language for Polynomial Time Computation....Pages 27-41
On the Existence of an Effective and Complete Inference System for Cryptographic Protocols....Pages 42-57
Hypergraphs and Degrees of Parallelism: A Completeness Result....Pages 58-71
Behavioral and Spatial Observations in a Logic for the π -Calculus....Pages 72-89
Election and Local Computations on Edges....Pages 90-104
Decidability of Freshness, Undecidability of Revelation....Pages 105-120
LTL over Integer Periodicity Constraints....Pages 121-135
Unifying Recursive and Co-recursive Definitions in Sheaf Categories....Pages 136-150
Deriving Bisimulation Congruences in the DPO Approach to Graph Rewriting....Pages 151-166
A Denotational Account of Untyped Normalization by Evaluation....Pages 167-181
On Finite Alphabets and Infinite Bases: From Ready Pairs to Possible Worlds....Pages 182-194
Specifying and Verifying Partial Order Properties Using Template MSCs....Pages 195-210
Angelic Semantics of Fine-Grained Concurrency....Pages 211-225
On the Expressiveness of Infinite Behavior and Name Scoping in Process Calculi....Pages 226-240
safeDpi : A Language for Controlling Mobile Code....Pages 241-256
Distance Desert Automata and the Star Height One Problem....Pages 257-272
Adhesive Categories....Pages 273-288
A Game Semantics of Local Names and Good Variables....Pages 289-303
Partial Correctness Assertions Provable in Dynamic Logics....Pages 304-317
Polynomials for Proving Termination of Context-Sensitive Rewriting....Pages 318-332
Bisimulation on Speed: Lower Time Bounds....Pages 333-347
On Recognizable Timed Languages....Pages 348-362
Tree Transducers and Tree Compressions....Pages 363-377
On Term Rewriting Systems Having a Rational Derivation....Pages 378-392
Duality for Labelled Markov Processes....Pages 393-407
Electoral Systems in Ambient Calculi....Pages 408-422
Strong Normalization of $\overline{\lambda}\mu\widetilde{\mu}$ -Calculus with Explicit Substitutions....Pages 423-437
Canonical Models for Computational Effects....Pages 438-452
Reasoning about Dynamic Policies....Pages 453-467
Probabilistic Bisimulation and Equivalence for Security Analysis of Network Protocols....Pages 468-483
Strong Bisimulation for the Explicit Fusion Calculus....Pages 484-498
Perfect-Information Stochastic Parity Games....Pages 499-513
A Note on the Perfect Encryption Assumption in a Process Calculus....Pages 514-528
Back Matter....Pages -
