This book constitutes the refereed proceedings of the 6th International Conference on Foundations of Software Science and Computation Structures, FOSSACS 2003, held in Warsaw, Poland in April 2003.
The 26 revised full papers presented together with an invited paper were carefully reviewed and selected from 96 submissions. Among the topics covered are algebraic models; automata and language theory; behavioral equivalences; categorical models; computation processes over discrete and continuous data; computation structures; logics of programs; models of concurrent, reactive, distributed, and mobile systems; process algebras and calculi; semantics of programming languages; software specification and refinement; transition systems; and type systems and type theory.
Author(s): Samson Abramsky, Radha Jagadeesan (auth.), Andrew D. Gordon (eds.)
Series: Lecture Notes in Computer Science 2620
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2003
Language: English
Pages: 440
Tags: Logics and Meanings of Programs; Software Engineering; Programming Languages, Compilers, Interpreters; Computation by Abstract Devices; Mathematical Logic and Formal Languages
A Game Semantics for Generic Polymorphism....Pages 1-22
Categories of Containers....Pages 23-38
Verification of Probabilistic Systems with Faulty Communication....Pages 39-53
Generalized Iteration and Coiteration for Higher-Order Nested Datatypes....Pages 54-69
Ambiguous Classes in the Games μ-Calculus Hierarchy....Pages 70-86
Parameterized Verification by Probabilistic Abstraction....Pages 87-102
Genericity and the π-Calculus....Pages 103-119
Model Checking Lossy Channels Systems Is Probably Decidable....Pages 120-135
Verification of Cryptographic Protocols: Tagging Enforces Termination....Pages 136-152
A Normalisation Result for Higher-Order Calculi with Explicit Substitutions....Pages 153-168
When Ambients Cannot Be Opened....Pages 169-184
Computability over an Arbitrary Structure. Sequential and Parallel Polynomial Time....Pages 185-199
An Intrinsic Characterization of Approximate Probabilistic Bisimilarity....Pages 200-215
Manipulating Trees with Hidden Labels....Pages 216-230
The Converse of a Stochastic Relation....Pages 233-249
Type Assignment for Intersections and Unions in Call-by-Value Languages....Pages 250-266
Cones and Foci for Protocol Verification Revisited....Pages 267-281
Towards a Behavioural Theory of Access and Mobility Control in Distributed Systems....Pages 282-298
The Two-Variable Guarded Fragment with Transitive Guards Is 2EXPTIME-Hard....Pages 299-312
A Game Semantics of Linearly Used Continuations....Pages 313-327
Counting and Equality Constraints for Multitree Automata....Pages 328-342
Compositional Circular Assume-Guarantee Rules Cannot Be Sound and Complete....Pages 343-357
A Monadic Multi-stage Metalanguage....Pages 358-374
Multi-level Meta-reasoning with Higher-Order Abstract Syntax....Pages 375-391
Abstraction in Reasoning about Higraph-Based Systems....Pages 392-408
Deriving Bisimulation Congruences: 2-Categories Vs Precategories....Pages 409-424
On the Structure of Inductive Reasoning: Circular and Tree-Shaped Proofs in the μCalculus....Pages 425-440
