Titel : 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 8-12, 2002 ; Proceedings
Dokumenttyp : Kongresswerk
ISBN : 354043366X
Erscheinungsjahr : 2002
Herausgeber : Nielsen, Mogens Engberg, Uffe
Serientitel : Lecture Notes in Computer Science / LNCS
Bandnummer : 2303
Erste Seite : 1
Letzte Seite : 433
Tagungsname : The 5th International Conference FOSSACS 2002 on Foundations of
Software Science and Computation Structures & Joint European
Conferences ETAPS 2002 on Theory and Practice of Software April 8-12,
2002
Tagungsort : Grenoble, France
Verlag : Springer, Berlin
Bemerkung : ISSN 03029743
Standort : 0105 (Serien)
Signatur : 09.2002F69
Archiviert am : 15.4.2002
Neuerwerbungsregal : von 16.4.2002 bis 22.4.2002
Inhaltsverzeichnis:
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 8-12, 2002 ; Proceedings
Hrsg.: Mogens Nielsen Uffe Engberg
Springer, Berlin, 2002, 433 S.
ISBN 354043366X
( Lecture Notes in Computer Science / LNCS ; 2303 )
ISSN 03029743
Table of Contents
Invited Paper
Semantical Evaluations
as Monadic Second-Order Compatible Structure Transformations 1
Bruno Courcelle
Contributed Papers
Verification for Java's Reentrant Multithreading Concept 5
Erika Abraham-Mumm, Frank S. de Boer, Willem-Paul de Roever,
Martin Steffen
On the Integration of Observability and Reachability Concepts 21
Michel Bidoit, Rolf Hennicker
Proving Correctness of Timed Concurrent Constraint Programs 37
Frank S. de Boer, Maurizio Gabbrielli, Maria Chiara Meo
Generalised Regular MSC Languages 52
Benedikt Bollig, Martin Leucker, Thomas Noll
On Compositional Reasoning in the Spi-calculus 67
Michele Boreale, Daniele Gorla
On Specification Logics for Algebra-Coalgebra Structures:
Reconciling Reachability and Observability 82
Corina Cirstea
A First-Order One-Pass CPS Transformation 98
Olivier Danvy, Lasse R. Nielsen
The Demonic Product of Probabilistic Relations 114
Ernst-Erich Doberkat
Minimizing Transition Systems for Name Passing Calculi:
A Co-algebraic Formulation 129
Gianluigi Ferrari, Ugo Montanari, Marco Pistore
Varieties of Effects 144
Carsten Führmann
A Characterization of Families of Graphs in Which Election Is Possible 159
Emmanuel Godard, Yves Metivier
Equivalence-Checking with One-Counter Automata:
A Generic Method for Proving Lower Bounds 172
Petr Jancar, Antonin Kucera, Faron Moller, Zdenek Sawa
Efficient Type Matching 187
Somesh Jha, Jens Palsberg, Tian Zhao
Higher-Order Pushdown Trees Are Easy 205
Teodor Knapik, Damian Niwinski, Pawel Urzyczyn
Conflict Detection and Resolution
in Access Control Policy Specifications 223
Manuel Koch, Luigi V. Mancini, Francesco Parisi-Presicce
Logics Admitting Final Semantics 238
Alexander Kurz
Model Checking Fixed Point Logic with Chop 250
Martin Lange, Colin Stirling
On Model Checking Durational Kripke Structures 264
Francois Laroussinie, Nicolas Markey, Philippe Schnoebelen
Model-Checking Infinite Systems Generated by Ground Tree Rewriting 280
Christof Löding
Bounded MSC Communication 295
Markus Lohrey, Anca Muscholl
The Informatic Derivative at a Compact Element 310
Keye Martin
Heterogeneous Development Graphs and Heterogeneous Borrowing 326
Till Mossakowski
Notions of Computation Determine Monads 342
Gordon Plotkin, John Power
A Calculus of Circular Proofs and Its Categorical Semantics 357
Luigi Santocanale
Verifying Temporal Properties Using Explicit Approximants:
Completeness for Context-free Processes 372
Wrich Schöpp, Alex Simpson
Note on the Tableau Technique for Commutative Transition Systems 387
Jir Srba
A Semantic Basis for Local Reasoning 402
Hongseok Yang, Peter O'Hearn
Linearity and Bisimulation 417
Nobuko Yoshida, Kohei Honda, Martin Berger
Author Index 435
040020279389