Foundations of Software Science and Computational Structures: 6th International Conference, FOSSACS 2003 Held as Part of the Joint European Conference . (Lecture Notes in Computer Science, 2620)

Gordon, Andrew D.

ISBN 10: 3540008977 / ISBN 13: 9783540008972

Editore: Springer, 2003

Riguardo questo articolo

Codice articolo 54F96_59_3540008977

Dati bibliografici

• Titolo: Foundations of Software Science and Computational Structures: 6th International Conference, FOSSACS 2003 Held as Part of the Joint European Conference . (Lecture Notes in Computer Science, 2620)
• Editore: Springer
• Data di pubblicazione: 2003
• Lingua: Inglese
• ISBN 10: 3540008977
• ISBN 13: 9783540008972
• Rilegatura: Brossura
• Condizione: new

Descrizione articolo

Riassunto

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.

Contenuti

Invited Paper.- A Game Semantics for Generic Polymorphism.- Contributed Papers.- Categories of Containers.- Verification of Probabilistic Systems with Faulty Communication.- Generalized Iteration and Coiteration for Higher-Order Nested Datatypes.- Ambiguous Classes in the Games ?-Calculus Hierarchy.- Parameterized Verification by Probabilistic Abstraction.- Genericity and the ?-Calculus.- Model Checking Lossy Channels Systems Is Probably Decidable.- Verification of Cryptographic Protocols: Tagging Enforces Termination.- A Normalisation Result for Higher-Order Calculi with Explicit Substitutions.- When Ambients Cannot Be Opened.- Computability over an Arbitrary Structure. Sequential and Parallel Polynomial Time.- An Intrinsic Characterization of Approximate Probabilistic Bisimilarity.- Manipulating Trees with Hidden Labels.- The Converse of a Stochastic Relation.- Type Assignment for Intersections and Unions in Call-by-Value Languages.- Cones and Foci for Protocol Verification Revisited.- Towards a Behavioural Theory of Access and Mobility Control in Distributed Systems.- The Two-Variable Guarded Fragment with Transitive Guards Is 2EXPTIME-Hard.- A Game Semantics of Linearly Used Continuations.- Counting and Equality Constraints for Multitree Automata.- Compositional Circular Assume-Guarantee Rules Cannot Be Sound and Complete.- A Monadic Multi-stage Metalanguage.- Multi-level Meta-reasoning with Higher-Order Abstract Syntax.- Abstraction in Reasoning about Higraph-Based Systems.- Deriving Bisimulation Congruences: 2-Categories Vs Precategories.- On the Structure of Inductive Reasoning: Circular and Tree-Shaped Proofs in the ?Calculus.