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

ISBN-13: 9783540418641 / Angielski / Miękka / 2001 / 420 str.

F. Honsell; Furio Honsell; Marino Miculan

Opis

This title constitutes the refereed proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures, FOSSACS 2001. The 25 revised full papers, presented together with an invited paper and a tool presentation paper, were carefully reviewed and selected from a total of 63 submissions. Among the topics covered are algebraic, categorical, logical, and geometric theories, models, and methods supporting the specification, synthesis, verification, analysis, and transformation of sequential, concurrent, distributed and mobile programs and software systems.

Spis treści

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.- Foundations for a Graph-Based Approach to the Specification of Access Control Policies.- Categories of Processes Enriched in Final Coalgebras.- Model Checking CTL+ and FCTL Is Hard.- On Regular Message Sequence Chart Languages and Relationships to Mazurkiewicz Trace Theory.- Verified Bytecode Verifiers.- Higher-Order Abstract Syntax with Induction in Isabelle/HOL: Formalizing the ?-Calculus and Mechanizing the Theory of Contexts.- Decidability of Weak Bisimilarity for a Subset of Basic Parallel Processes.- An Axiomatic Semantics for the Synchronous Language Gentzen.- Tool Presentation.- Marrella and the Verification of an Embedded System.