Foundation of Software Science and Computation Structures

ETAPS2000wasthethirdinstanceoftheEuropeanJointConferencesonTheory 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 comprisedv e conferences (FOSSACS, FASE, ESOP,CC, TACAS), ve satellite workshops (CBS, CMCS, CoFI, GRATRA, INT), seven invited lectures, a panel discussion, and ten tutorials. The events that comprise ETAPS address various aspects of the system - velopmentprocess,includingspeci cation,design,implementation,analysis,and improvement. The languages, methodologies, and tools which support these - tivities are all well within its scope. Die rent blends of theory and practice are represented, with an inclination towards theory with a practical motivation on one hand and soundly-based practice on the other. Many of the issues involved in software design apply to systems in general, including hardware systems, and the emphasis on software is not intended to be exclusive. ETAPS is a loose confederation in which each event retains its own identity, with a separate program committee and independent proceedings. Its format is open-ended, allowing it to grow and evolve as time goes by. Contributed talks and system demonstrations are in synchronized parallel sessions, with invited lectures in plenary sessions. Two of the invited lectures are reserved for \u- fying" talks on topics of interest to the whole range of ETAPS attendees.

Includes supplementary material: sn.pub/extras

Inhalt
Norm Functions for Probabilistic Bisimulations with Delays.- Constructor Subtyping in the Calculus of Inductive Constructions.- Verifying Performance Equivalence for Timed Basic Parallel Processes.- On Word Rewriting Systems Having a Rational Derivation.- Proof Nets and Explicit Substitutions.- Typing Local Definitions and Conditional Expressions with Rank 2 Intersection (Extended Abstract).- Hierarchical Graph Transformation.- A Program Refinement Framework Supporting Reasoning about Knowledge and Time.- A Higher-Order Simulation Relation for System F.- Probabilistic Asynchronous ?-Calculus.- Constructive Data Refinement in Typed Lambda Calculus.- On Recognizable Stable Trace Languages.- The State Explosion Problem from Trace to Bisimulation Equivalence.- A Proof System for Timed Automata.- Categorical Models for Intuitionistic and Linear Type Theory.- Locality and Polyadicity in Asynchronous Name-Passing Calculi.- On Rational Graphs.- Sequential and Concurrent Abstract Machines for Interaction Nets.- On Synchronous and Asynchronous Mobile Processes.- Type Inference for First-Order Logic.- An Algebraic Foundation for Adaptive Programming.- Predicate Logic and Tree Automata with Tests.- Compositional Verification in Linear-Time Temporal Logic.- On the Semantics of Refinement Calculi.- Subtyping and Typing Algorithms for Mobile Ambients.