Foundations of Software Science and Computation Structures: 4th International Conference, FOSSACS 2001 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2001 Genova, Italy, April 2–6, 2001 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.

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 2001 was the fourth instance of the European Joint Conferences on Theory 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 comprised ve conferences (FOSSACS, FASE, ESOP, CC, TACAS), ten satellite workshops (CMCS, ETI Day, JOSES, LDTA, MMAABS, PFM, RelMiS, UNIGRA, WADT, WTUML), seven invited lectures, a debate, and ten tutorials. The events that comprise ETAPS address various aspects of the system de- lopment 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): Gordon Plotkin, John Power (auth.), Furio Honsell, Marino Miculan (eds.)
Series: Lecture Notes in Computer Science 2030
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2001

Language: English
Pages: 420
Tags: Logics and Meanings of Programs; Mathematical Logic and Formal Languages; Computation by Abstract Devices; Programming Languages, Compilers, Interpreters; Software Engineering

Adequacy for Algebraic Effects....Pages 1-24
Secrecy Types for Asymmetric Communication....Pages 25-41
Axiomatizing Tropical Semirings....Pages 42-56
Type Isomorphisms and Proof Reuse in Dependent Type Theory....Pages 57-71
On the Duality between Observability and Reachability....Pages 72-87
The Finite Graph Problem for Two-Way Alternating Automata....Pages 88-103
High-Level Petri Nets as Type Theories in the Join Calculus....Pages 104-120
Temporary Data in Shared Dataspace Coordination Languages....Pages 121-136
On Garbage and Program Logic....Pages 137-151
The Complexity of Model Checking Mobile Ambients....Pages 152-167
The Rho Cube....Pages 168-183
Type Inference with Recursive Type Equations....Pages 184-198
On the Modularity of Deciding Call-by-Need....Pages 199-213
Synchronized Tree Languages Revisited and New Applications....Pages 214-229
Computational Completeness of Programming Languages Based on Graph Transformation....Pages 230-245
Axioms for Recursion in Call-by-Value....Pages 246-260
Class Analysis of Object-Oriented Programs through Abstract Interpretation....Pages 261-275
On the Complexity of Parity Word Automata....Pages 276-286
Foundations for a Graph-Based Approach to the Specification of Access Control Policies....Pages 287-302
Categories of Processes Enriched in Final Coalgebras....Pages 303-317
Model Checking CTL + and FCTL Is Hard....Pages 318-331
On Regular Message Sequence Chart Languages and Relationships to Mazurkiewicz Trace Theory....Pages 332-346
Verified Bytecode Verifiers....Pages 347-363
Higher-Order Abstract Syntax with Induction in Isabelle/HOL: Formalizing the π-Calculus and Mechanizing the Theory of Contexts....Pages 364-378
Decidability of Weak Bisimilarity for a Subset of Basic Parallel Processes....Pages 379-393
An Axiomatic Semantics for the Synchronous Language Gentzen ....Pages 394-408
M arrella and the Verification of an Embedded System....Pages 409-412