Foundation of Software Science and Computation Structures : Third International Conference, FOSSACAS 2000 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2000 Berlin, Germany, March/April Proceedings

by Tiuryn, Jerzy

• ISBN13: 9783540672579
• ISBN10: 3540672575
• Format: Paperback
• Copyright: 2000-04-01
• Publisher: Springer Verlag

Summary

This volume constitutes the refereed proceedings of the Third International Conference on Foundations of Software Science and Computation Structures, FOSSACS 2000, held as part of ETAPS 2000 in Berlin, Germany in March/April 2000. The 25 revised full papers presented were carefully reviewed and selected from a total of 68 submissions. Among the topics covered are rewriting, pi-calculus, lambda-calculus, formal languages, proof systems, type theory, mobile processes, automata theory, predicate logic, etc.

Table of Contents

Norm Functions for Probabilistic Bisimulations with Delays	1	(16)
Christel Baier
Marielle Stoelinga
Constructor Subtyping in the Calculus of Inductive Constructions	17	(18)
Gilles Barthe
Femke van Raamsdonk
Verifying Performance Equivalence for Timed Basic Parallel Processes	35	(13)
Beatrice Berard
Anne Labroue
Philippe Schnoebelen
On Word Rewriting Systems Having a Rational Derivation	48	(15)
Didier Caucal
Proof Nets and Explicit Substitutions	63	(19)
Roberto Di Cosmo
Delia Kesner
Emmanuel Polonovski
Typing Local Definitions and Conditional Expressions with Rank 2 Intersection	82	(16)
Ferruccio Damiani
Hierarchical Graph Transformation	98	(16)
Frank Drewes
Berthold Hoffmann
Detlef Plump
A Program Refinement Framework Supporting Reasoning about Knowledge and Time	114	(16)
Kai Engelhardt
Ron van der Meyden
Yoram Moses
A Higher-Order Simulation Relation for System F	130	(16)
Jo Erskine Hannay
Probabilistic Asynchronous π-Calculus	146	(15)
Oltea Mihaela Herescu
Catuscia Palamidessi
Constructive Data Refinement in Typed Lambda Calculus	161	(16)
Furio Honsell
John Longley
Donald Sannella
Andrzej Tarlecki
On Recognizable Stable Trace Languages	177	(15)
Jean-Francois Husson
Remi Morin
The State Explosion Problem from Trace to Bisimulation Equivalence	192	(16)
Francois Laroussinie
Philippe Schnoebelen
A Proof System for Timed Automata	208	(15)
Huimin Lin
Wang Yi
Categorical Models for Intuitionistic and Linear Type Theory	223	(15)
Maria Emilia Maietti
Valeria de Paiva
Eike Ritter
Locality and Polyadicity in Asynchronous Name-Passing Calculi	238	(14)
Massimo Merro
On Rational Graphs	252	(15)
Christophe Morvan
Sequential and Concurrent Abstract Machines for Interaction Nets	267	(16)
Jorge Sousa Pinto
On Synchronous and Asynchronous Mobile Processes	283	(14)
Paola Quaglia
David Walker
Type Inference for First-Order Logic	297	(17)
Aleksy Schubert
An Algebraic Foundation for Adaptive Programming	314	(15)
Peter Thiemann
Predicate Logic and Tree Automata with Tests	329	(15)
Ralf Treinen
Compositional Verification in Linear-Time Temporal Logic	344	(15)
Yih-Kuen Tsay
On the Semantics of Refinement Calculi	359	(16)
Hongseok Yang
Uday S. Reddy
Subtyping and Typing Algorithms for Mobile Ambients	375	(16)
Pascal Zimmer
Author Index	391