000 | 03835nam a22005535i 4500 | ||
---|---|---|---|
001 | 978-3-540-36576-1 | ||
003 | DE-He213 | ||
005 | 20240423132431.0 | ||
007 | cr nn 008mamaa | ||
008 | 121227s2003 gw | s |||| 0|eng d | ||
020 |
_a9783540365761 _9978-3-540-36576-1 |
||
024 | 7 |
_a10.1007/3-540-36576-1 _2doi |
|
050 | 4 | _aQA75.5-76.95 | |
072 | 7 |
_aUYA _2bicssc |
|
072 | 7 |
_aCOM014000 _2bisacsh |
|
072 | 7 |
_aUYA _2thema |
|
082 | 0 | 4 |
_a004.0151 _223 |
245 | 1 | 0 |
_aFoundations of Software Science and Computational Structures _h[electronic resource] : _b6th 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 / _cedited by Andrew D. Gordon. |
250 | _a1st ed. 2003. | ||
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2003. |
|
300 |
_aXII, 440 p. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aLecture Notes in Computer Science, _x1611-3349 ; _v2620 |
|
505 | 0 | _aInvited 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. | |
650 | 0 | _aComputer science. | |
650 | 0 | _aSoftware engineering. | |
650 | 0 | _aCompilers (Computer programs). | |
650 | 1 | 4 | _aTheory of Computation. |
650 | 2 | 4 | _aSoftware Engineering. |
650 | 2 | 4 | _aComputer Science Logic and Foundations of Programming. |
650 | 2 | 4 | _aCompilers and Interpreters. |
700 | 1 |
_aGordon, Andrew D. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783540008972 |
776 | 0 | 8 |
_iPrinted edition: _z9783662166376 |
830 | 0 |
_aLecture Notes in Computer Science, _x1611-3349 ; _v2620 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/3-540-36576-1 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
912 | _aZDB-2-BAE | ||
942 | _cSPRINGER | ||
999 |
_c187705 _d187705 |