Foundations of Software Science and Computational Structures [[electronic resource] ] : 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
(Visualizza in formato marc)
(Visualizza in BIBFRAME)
| Titolo: |
Foundations of Software Science and Computational Structures [[electronic resource] ] : 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
|
| Pubblicazione: | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 |
| Edizione: | 1st ed. 2003. |
| Descrizione fisica: | 1 online resource (XII, 440 p.) |
| Disciplina: | 005.1 |
| Soggetto topico: | 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 | |
| Persona (resp. second.): | GordonAndrew D |
| Note generali: | Bibliographic Level Mode of Issuance: Monograph |
| Nota di bibliografia: | Includes bibliographical references and index. |
| Nota di contenuto: | 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. |
| Titolo autorizzato: | Foundations of Software Science and Computational Structures |
| ISBN: | 3-540-36576-1 |
| Formato: | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione: | Inglese |
| Record Nr.: | 996465499803316 |
| Lo trovi qui: | Univ. di Salerno |
| Opac: | Controlla la disponibilità qui |
Serie:
Lecture Notes in Computer Science, . 0302-9743 ; ; 2620