04946nam 22007095 450 99646549980331620200705221924.03-540-36576-110.1007/3-540-36576-1(CKB)1000000000211950(SSID)ssj0000323278(PQKBManifestationID)11243646(PQKBTitleCode)TC0000323278(PQKBWorkID)10300113(PQKB)10107195(DE-He213)978-3-540-36576-1(MiAaPQ)EBC3071932(PPN)155167650(EXLCZ)99100000000021195020121227d2003 u| 0engurnn|008mamaatxtccrFoundations 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. Gordon1st ed. 2003.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2003.1 online resource (XII, 440 p.) Lecture Notes in Computer Science,0302-9743 ;2620Bibliographic Level Mode of Issuance: Monograph3-540-00897-7 Includes bibliographical references and index.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.Lecture Notes in Computer Science,0302-9743 ;2620ComputersSoftware engineeringComputer logicProgramming languages (Electronic computers)Theory of Computationhttps://scigraph.springernature.com/ontologies/product-market-codes/I16005Software Engineering/Programming and Operating Systemshttps://scigraph.springernature.com/ontologies/product-market-codes/I14002Logics and Meanings of Programshttps://scigraph.springernature.com/ontologies/product-market-codes/I1603XSoftware Engineeringhttps://scigraph.springernature.com/ontologies/product-market-codes/I14029Programming Languages, Compilers, Interpretershttps://scigraph.springernature.com/ontologies/product-market-codes/I14037Computation by Abstract Deviceshttps://scigraph.springernature.com/ontologies/product-market-codes/I16013Computers.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.005.1Gordon Andrew Dedthttp://id.loc.gov/vocabulary/relators/edtJoint European Conferences on Theory and Practice of Software, ETAPS(2003 :Warsaw, Poland),BOOK996465499803316Foundations of Software Science and Computational Structures772755UNISA