Foundations of software science and computation structures : 6th International Conference, FOSSACS 2003, held as part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2003, Warsaw, Poland, April 7-11, 2003 : proceedings

Bibliographic Information

Foundations of software science and computation structures : 6th International Conference, FOSSACS 2003, held as part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2003, Warsaw, Poland, April 7-11, 2003 : proceedings

Andrew D. Gordon (ed.)

(Lecture notes in computer science, 2620)

Springer, c2003

Other Title

Foundations of software science and computation structures : FOSSACS 2003

Foundations of software science and computation structures : 6th International Conference, FOSSACS 2003, held as part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2003, Warsaw, Poland, April 2003 : proceedings

Available at  / 23 libraries

Search this Book/Journal

Note

Includes bibliographical references and index

Description and Table of Contents

Description

The present volume contains the proceedings of the international conference Foundations of Software Science and Computation Structures(FOSSACS)2003, held in Warsaw, Poland, April 7-9, 2003. FOSSACS is an event of the Joint European Conferences on Theory and Practice of Software (ETAPS). The pre- ous ?ve FOSSACS conferences took place in Lisbon (1998), Amsterdam (1999), Berlin (2000), Genoa (2001), and Grenoble (2002). FOSSACS presents original papers on foundational researchwith a clear s- ni?cancetosoftwarescience.TheProgramCommitteeinvitedpapersontheories and methodsto supportthe analysis,integration,synthesis,transformation,and veri?cation of programs and software systems. We identi?ed the following t- ics, in particular: algebraic models; automata and language theory; behavioural equivalences; categorical models; computation processes over discrete and c- tinuous data; computation structures; logics of programs; modal, spatial, and temporallogics;modelsof concurrent,reactive,distributed, and mobile systems; processalgebrasandcalculi;semanticsofprogramminglanguages;softwaresp- i?cation and re?nement; transition systems; and type systems and type theory. We received 96 submissions, of which 2 were withdrawn. This proceedings consists of 27 papers. The ?rst-A Game Semantics for Generic Polymorphism-accompanies the invited lecture by Samson Abramsky, University of Oxford. The remaining 26 were selected for publication by the Program Committee during a week-long electronic discussion. I sincerely thank all the authors of papers submitted to FOSSACS 2003; the number and the quality of papers were exceptionally high this year. Moreover, I would like to thank all the members of the ProgramCommittee for the excellent job they did during a rather demanding selection process, and to thank all our subreferees for their invaluable contributions to this process.

Table of Contents

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.

by "Nielsen BookData"

Related Books: 1-1 of 1

Details

  • NCID
    BA61613765
  • ISBN
    • 3540008977
  • Country Code
    gw
  • Title Language Code
    eng
  • Text Language Code
    eng
  • Place of Publication
    Berlin ; Tokyo
  • Pages/Volumes
    xii, 440 p.
  • Size
    24 cm
  • Parent Bibliography ID
Page Top