| 000 | 05347nam a22005895i 4500 | ||
|---|---|---|---|
| 001 | 978-3-540-24727-2 | ||
| 003 | DE-He213 | ||
| 005 | 20240423130118.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 121227s2004 gw | s |||| 0|eng d | ||
| 020 |
_a9783540247272 _9978-3-540-24727-2 |
||
| 024 | 7 |
_a10.1007/b95995 _2doi |
|
| 050 | 4 | _aQA76.758 | |
| 072 | 7 |
_aUMZ _2bicssc |
|
| 072 | 7 |
_aCOM051230 _2bisacsh |
|
| 072 | 7 |
_aUMZ _2thema |
|
| 082 | 0 | 4 |
_a005.1 _223 |
| 245 | 1 | 0 |
_aFoundations of Software Science and Computation Structures _h[electronic resource] : _b7th International Conference, FOSSACS 2004, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2004, Barcelona, Spain, March 29 - April 2, 2004, Proceedings / _cedited by Igor Walukiewicz. |
| 250 | _a1st ed. 2004. | ||
| 264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2004. |
|
| 300 |
_aXIV, 530 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 ; _v2987 |
|
| 505 | 0 | _aInvited Contributions -- Intruder Theories (Ongoing Work) -- Theories for the Global Ubiquitous Computer -- Contributed Papers -- Choice in Dynamic Linking -- Soft lambda-Calculus: A Language for Polynomial Time Computation -- On the Existence of an Effective and Complete Inference System for Cryptographic Protocols -- Hypergraphs and Degrees of Parallelism: A Completeness Result -- Behavioral and Spatial Observations in a Logic for the ?-Calculus -- Election and Local Computations on Edges -- Decidability of Freshness, Undecidability of Revelation -- LTL over Integer Periodicity Constraints -- Unifying Recursive and Co-recursive Definitions in Sheaf Categories -- Deriving Bisimulation Congruences in the DPO Approach to Graph Rewriting -- A Denotational Account of Untyped Normalization by Evaluation -- On Finite Alphabets and Infinite Bases: From Ready Pairs to Possible Worlds -- Specifying and Verifying Partial Order Properties Using Template MSCs -- Angelic Semantics of Fine-Grained Concurrency -- On the Expressiveness of Infinite Behavior and Name Scoping in Process Calculi -- safeDpi: A Language for Controlling Mobile Code -- Distance Desert Automata and the Star Height One Problem -- Adhesive Categories -- A Game Semantics of Local Names and Good Variables -- Partial Correctness Assertions Provable in Dynamic Logics -- Polynomials for Proving Termination of Context-Sensitive Rewriting -- Bisimulation on Speed: Lower Time Bounds -- On Recognizable Timed Languages -- Tree Transducers and Tree Compressions -- On Term Rewriting Systems Having a Rational Derivation -- Duality for Labelled Markov Processes -- Electoral Systems in Ambient Calculi -- Strong Normalization of -Calculus with Explicit Substitutions -- Canonical Models for Computational Effects -- Reasoning about Dynamic Policies.-Probabilistic Bisimulation and Equivalence for Security Analysis of Network Protocols -- Strong Bisimulation for the Explicit Fusion Calculus -- Perfect-Information Stochastic Parity Games -- A Note on the Perfect Encryption Assumption in a Process Calculus. | |
| 520 | _aETAPS 2004 was the seventh instance of the European Joint Conferences on Theory and Practice of Software. ETAPS is an annual federated conference that was established in 1998 by combining a number of existing and new conferences. This year it comprised ?ve conferences (FOSSACS, FASE, ESOP, CC, TACAS), 23 satellite workshops, 1 tutorial, and 7 invited lectures (not including those that are speci?c to the satellite events). The events that comprise ETAPS address various aspects of the system - velopment process, including speci?cation, design, implementation, analysis and improvement. The languages, methodologies and tools that support these - tivities are all well within its scope. Di?erent blends of theory and practice are represented, with an inclination towards theory with a practical motivation on the one hand and soundly based practice on the other. Many of the issues inv- ved in software design apply to systems in general, including hardware systems, and the emphasis on software is not intended to be exclusive. | ||
| 650 | 0 | _aSoftware engineering. | |
| 650 | 0 | _aComputer science. | |
| 650 | 0 | _aCompilers (Computer programs). | |
| 650 | 0 | _aMachine theory. | |
| 650 | 1 | 4 | _aSoftware Engineering. |
| 650 | 2 | 4 | _aComputer Science Logic and Foundations of Programming. |
| 650 | 2 | 4 | _aCompilers and Interpreters. |
| 650 | 2 | 4 | _aTheory of Computation. |
| 650 | 2 | 4 | _aFormal Languages and Automata Theory. |
| 700 | 1 |
_aWalukiewicz, Igor. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
| 710 | 2 | _aSpringerLink (Online service) | |
| 773 | 0 | _tSpringer Nature eBook | |
| 776 | 0 | 8 |
_iPrinted edition: _z9783540212980 |
| 776 | 0 | 8 |
_iPrinted edition: _z9783662208960 |
| 830 | 0 |
_aLecture Notes in Computer Science, _x1611-3349 ; _v2987 |
|
| 856 | 4 | 0 | _uhttps://doi.org/10.1007/b95995 |
| 912 | _aZDB-2-SCS | ||
| 912 | _aZDB-2-SXCS | ||
| 912 | _aZDB-2-LNC | ||
| 912 | _aZDB-2-BAE | ||
| 942 | _cSPRINGER | ||
| 999 |
_c185177 _d185177 |
||