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
Spremljeno u:
| Autori kompanije: | , |
|---|---|
| Daljnji autori: | |
| Format: | Livre numérique |
| Jezik: | Anglais |
| Izdano: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Serija: | Lecture notes in computer science
2620 |
| Teme: | |
| Online pristup: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Bilješka: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • 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), Berlin, Springer, 2003, 1 vol. (XII-440 p.), Lecture notes in computer science, 3-540-00897-7 • Foundations of Software Science and Computational Structures, Texte imprimé, 9783662166376 |
Sadržaj:
- 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.