Foundations of Software Science and Computation Structures : 5th International Conference, FOSSACS 2002, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2002, Grenoble, France, April 2002, Proceedings

by Nielsen, Mogens; Engberg, Uffe; Engberg, Uffe; FOSSACS 2002 (2002 : Grenoble, France); Nielsen, Mogens

• ISBN13: 9783540433668
• ISBN10: 354043366X
• Format: Paperback
• Copyright: 2002-05-01
• Publisher: Springer Verlag

Summary

Viele Dinge sind schön. Viele Dinge sind nützlich. Aber nur wenige schreiben schon kurz nach ihrem Erscheinen Geschichte. Die Bücher der Reihe 'Design-Klassiker' widmen sich ausgewählten Produkten, die in Form, Funktion und Markenkommunikation neue Maßstäbe setzten. Jeder Band informiert mit zahlreichen Fotos und kurzen, aufschlussreichen Texten über die Geschichte des jeweiligen Kult-Objekts sowie über die Personen, die sie entworfen haben.

Table of Contents

Invited Paper
Semantical Evaluations as Monadic Second-Order Compatible Structure Transformations	1	(4)
Bruno Courcelle
Contributed Papers
Verification for Java's Reentrant Multithreading Concept	5	(16)
Erika Abraham-Mumm
Frank S. de Boer
Willem-Paul de Roever
Martin Steffen
On the Integration of Observability and Reachability Concepts	21	(16)
Michel Bidoit
Rolf Hennicker
Proving Correctness of Timed Concurrent Constraint Programs	37	(15)
Frank S. de Boer
Maurizio Gabbrielli
Maria Chiara Meo
Generalised Regular MSC Languages	52	(15)
Benedikt Bollig
Martin Leucker
Thomas Noll
On Compositional Reasoning in the Spi-calculus	67	(15)
Michele Boreale
Daniele Gorla
On Specification Logics for Algebra-Coalgebra Structures: Reconciling Reachability and Observability	82	(16)
Corina Cirstea
A First-Order One-Pass CPS Transformation	98	(16)
Olivier Danvy
Lasse R. Nielsen
The Demonic Product of Probabilistic Relations	114	(15)
Ernst-Erich Doberkat
Minimizing Transition Systems for Name Passing Calculi: A Co-algebraic Formulation	129	(15)
Gianluigi Ferrari
Ugo Montanari
Marco Pistore
Varieties of Effects	144	(15)
Carsten Fuhrmann
A Characterization of Families of Graphs in Which Election Is Possible	159	(13)
Emmanuel Godard
Yves Metivier
Equivalence-Checking with One-Counter Automata: A Generic Method for Proving Lower Bounds	172	(15)
Petr Jancar
Antonin Kucera
Faron Moller
Zdenek Sawa
Efficient Type Matching	187	(18)
Somesh Jha
Jens Palsberg
Tian Zhao
Higher-Order Pushdown Tees Are Easy	205	(18)
Teodor Knapik
Damian Niwinski
Pawel Urzyczyn
Conflict Detection and Resolution in Access Control Policy Specifications	223	(15)
Manuel Koch
Luigi V. Mancini
Francesco Parisi-Presicce
Logics Admitting Final Semantics	238	(12)
Alexander Kurz
Model Checking Fixed Point Logic with Chop	250	(14)
Martin Lange
Colin Stirling
On Model Checking Durational Kripke Structures	264	(16)
Francois Laronssinie
Nicolas Markey
Philippe Schnoebelen
Model-Checking Infinite Systems Generated by Ground Tree Rewriting	280	(15)
Christof Loding
Bounded MSC Communication	295	(15)
Markus Lohrey
Anca Muscholl
The Informatic Derivative at a Compact Element	310	(16)
Keye Martin
Heterogeneous Development Graphs and Heterogeneous Borrowing	326	(16)
Till Mossakowski
Notions of Computation Determine Monads	342	(15)
Gordon Plotkin
John Power
A Calculus of Circular Proofs and Its Categorical Semantics	357	(15)
Luigi Santocanale
Verifying Temporal Properties Using Explicit Approximants: Completeness for Context-free Processes	372	(15)
Ulrich Schopp
Alex Simpson
Note on the Tableau Technique for Commutative Transition Systems	387	(15)
Jiri Srba
A Semantic Basis for Local Reasoning	402	(15)
Hongseok Yang
Peter O'Hearn
Linearity and Bisimulation	417	(18)
Nobuko Yoshida
Kohei Honda
Martin Berger
Author Index	435