product iamge

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

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Download
Search on Amazon

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

ETAPS 2002 is the ?fth instance of the European Joint Conferences on Theory and Practice of Software. ETAPS is an annual federated conference that was established in 1998by combining a number of existing and new conferences. This year it comprises ?ve conferences (FOSSACS, FASE, ESOP, CC, TACAS), thirteen satellite workshops (ACL2, AGT, CMCS, COCV, DCC, INT, LDTA, SC, SFEDL, SLAP, SPIN, TPTS and VISS), eight invited lectures (not including those that are speci?c to the satellite events), and several tutorials. 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 which 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 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.

Author(s): Bruno Courcelle (auth.), Mogens Nielsen, Uffe Engberg (eds.)
Series: Lecture Notes in Computer Science 2303
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2002

Language: English
Pages: 443
Tags: Logics and Meanings of Programs; Mathematical Logic and Formal Languages; Programming Languages, Compilers, Interpreters; Software Engineering

Semantical Evaluations as Monadic Second-Order Compatible Structure Transformations....Pages 1-4
Verification for Java’s Reentrant Multithreading Concept....Pages 5-20
On the Integration of Observability and Reachability Concepts....Pages 21-36
Proving Correctness of Timed Concurrent Constraint Programs....Pages 37-51
Generalised Regular MSC Languages....Pages 52-66
On Compositional Reasoning in the Spi-calculus....Pages 67-81
On Specification Logics for Algebra-Coalgebra Structures: Reconciling Reachability and Observability....Pages 82-97
A First-Order One-Pass CPS Transformation....Pages 98-113
The Demonic Product of Probabilistic Relations....Pages 114-128
Minimizing Transition Systems for Name Passing Calculi: A Co-algebraic Formulation....Pages 129-143
Varieties of Effects....Pages 144-159
A Characterization of Families of Graphs in Which Election Is Possible....Pages 159-171
Equivalence-Checking with One-Counter Automata: A Generic Method for Proving Lower Bounds * ....Pages 172-186
Efficient Type Matching....Pages 187-204
Higher-Order Pushdown Trees Are Easy....Pages 205-222
Conflict Detection and Resolution in Access Control Policy Specifications....Pages 223-238
Logics Admitting Final Semantics....Pages 238-249
Model Checking Fixed Point Logic with Chop....Pages 250-263
On Model Checking Durational Kripke Structures....Pages 264-279
Model-Checking Infinite Systems Generated by Ground Tree Rewriting....Pages 280-294
Bounded MSC Communication....Pages 295-309
The Informatic Derivative at a Compact Element....Pages 310-325
Heterogeneous Development Graphs and Heterogeneous Borrowing....Pages 326-341
Notions of Computation Determine Monads....Pages 342-356
A Calculus of Circular Proofs and Its Categorical Semantics....Pages 357-371
Verifying Temporal Properties Using Explicit Approximants: Completeness for Context-free Processes....Pages 372-386
Note on the Tableau Technique for Commutative Transition Systems....Pages 387-401
A Semantic Basis for Local Reasoning....Pages 402-416
Linearity and Bisimulation....Pages 417-433