1 option
Foundations of Software Science and Computational Structures : 6th International Conference, FOSSACS 2003 Held as Part of the Joint European Conference on Theory and Practice of Software , ETAPS 2003, Warsaw, Poland, April 7-11, 2003, Proceedings / edited by Andrew D. Gordon.
LIBRA Q341 .P7 2004
Available from offsite location
- Format:
- Book
- Series:
- Computer Science (Springer-11645)
- Lecture notes in computer science 0302-9743 ; 2620.
- Lecture Notes in Computer Science, 0302-9743 ; 2620
- Language:
- English
- Subjects (All):
- Computers.
- Software engineering.
- Computer logic.
- Programming languages (Electronic computers).
- Theory of Computation.
- Software Engineering/Programming and Operating Systems.
- Logics and Meanings of Programs.
- Software Engineering.
- Programming Languages, Compilers, Interpreters.
- Computation by Abstract Devices.
- Local Subjects:
- Theory of Computation.
- Software Engineering/Programming and Operating Systems.
- Logics and Meanings of Programs.
- Software Engineering.
- Programming Languages, Compilers, Interpreters.
- Computation by Abstract Devices.
- Physical Description:
- 1 online resource (XII, 440 pages).
- Edition:
- First edition 2003.
- Contained In:
- Springer eBooks
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2003.
- System Details:
- text file PDF
- 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.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-540-36576-1
- 9783540365761
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.