Foundations of Software Science and Computation Structures: Second International Conference, FOSSACS'99, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS'99, Amsterdam, The Netherlands, March 22-28, 1999 / Edition 1

by Wolfgang Thomas

Overview

The International Conference "Foundations of Software Science and Compu- tion Structures" (FOSSACS) is a constituent of the "Joint European Conferences on Theoryand Practice of Software" (ETAPS). The present volume contains the contributions to FOSSACS'99, the second conference in this series, which took place in Amsterdam. As formulated in the call for papers, FOSSACS focusses on "papers which o?er progress in foundational research with a clear signi?cance for software science. A central issue is theories and methods which support the speci?cation, tra- formation, veri?cation, and analysis of programs and software systems." The articles in this volume represent a wide spectrum of approaches to this general aim. In manypapers, one ?nds the studyof new concepts and methods which are motivated byrecent trends (or problems) in the practical use of software and information technology. The volume contains 18 contributed papers, preceded bythree invited papers. The ?rst, byM. Abadi, accompanies his "unifying invited lecture" addressed to the whole ETAPS audience. The second, byJ. Esparza and J. Knoop, contains an application of the results presented byJ. Esparza in his invited lecture to FOSSACS'99. The third summarizes an invited tutorial byD. Sangiorgi p- sented to ETAPS'99.

Product Details

ISBN-13:	9783540657194
Publisher:	Springer Berlin Heidelberg
Publication date:	04/14/1999
Series:	Lecture Notes in Computer Science , #1578
Edition description:	1999
Pages:	330
Product dimensions:	6.10(w) x 9.25(h) x 0.03(d)

Table of Contents

Security Prools and Specifications.- An Automata-Theoretic Approach to Interprocedural Data-Flow Analysis.- Reasoning about Concurrent Systems Using Types.- Testing Hennessy-Milner Logic with Recursion.- A Strong Logic Programming View for Static Embedded Implications.- Unfolding and Event Structure Semantics for Graph Grammars.- Expanding the Cube.- An Algebraic Characterization of Typability in ML with Subtyping.- Static Analysis of Processes for No Read-Up and No Write-Down.- A WP-calculus for OO.- The Recognizability Problem for Tree Automata with Comparisons between Brothers.- A Theory of “May” Testing for Asynchronous Languages.- A Nondeterministic Polynomial-Time Unification Algorithm for Bags, Sets and Trees.- Categorical Models of Explicit Substitutions.- Equational Properties of Mobile Ambients.- Model Checking Logics for Communicating Sequential Agents.- A Complete Coinductive Logical System for Bisimulation Equivalence on Circular Objects.- String Languages Generated by Total Deterministic Macro Tree Transducers.- Matching Specifications for Message Sequence Charts.- Probabilistic Temporal Logics via the Modal Mu-Calculus.- A—-calculus Process Semantics of Concurrent Idealised ALGOL.