Foundations of Software Science and Computation Structures: 4th International Conference, FOSSACS 2001 Held as Part of the Joint European Conferences [Paperback]

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.Invited Paper.- Adequacy for Algebraic Effects.- Contributed Papers.- Secrecy Types for Asymmetric Communication.- Axiomatizing Tropical Semirings.- Type Isomorphisms and Proof Reuse in Dependent Type Theory.- On the Duality between Observability and Reachability.- The Finite Graph Problem for Two-Way Alternating Automata.- High-Level Petri Nets as Type Theories in the Join Calculus.- Temporary Data in Shared Dataspace Coordination Languages.- On Garbage and Program Logic.- The Complexity of Model Checking Mobile Ambients.- The Rho Cube.- Type Inference with Recursive Type Equations.- On the Modularity of Deciding Call-by-Need.- Synchronized Tree Languages Revisited and New Applications.- Computational Completeness of Programming Languages Based on Graph Transformation.- Axioms for Recursion in Call-by-Value.- Class Analysis of Object-Oriented Programs through Abstract Interpretation.- On the Complexity of Parity Word Automata.- Foulã&