LEADER 06603nam 22008055 450 001 996465550103316 005 20200702143326.0 010 $a1-280-30713-7 010 $a9786610307135 010 $a3-540-24727-0 024 7 $a10.1007/b95995 035 $a(CKB)1000000000212329 035 $a(DE-He213)978-3-540-24727-2 035 $a(SSID)ssj0000157591 035 $a(PQKBManifestationID)11182711 035 $a(PQKBTitleCode)TC0000157591 035 $a(PQKBWorkID)10140255 035 $a(PQKB)11660128 035 $a(MiAaPQ)EBC3087447 035 $a(PPN)155197037 035 $a(EXLCZ)991000000000212329 100 $a20121227d2004 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aFoundations of Software Science and Computation Structures$b[electronic resource] $e7th 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 /$fedited by Igor Walukiewicz 205 $a1st ed. 2004. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2004. 215 $a1 online resource (XIV, 530 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v2987 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-21298-1 320 $aIncludes bibliographical references at the end of each chapters and index. 327 $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. 330 $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. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v2987 606 $aSoftware engineering 606 $aComputer logic 606 $aProgramming languages (Electronic computers) 606 $aComputers 606 $aMathematical logic 606 $aSoftware Engineering/Programming and Operating Systems$3https://scigraph.springernature.com/ontologies/product-market-codes/I14002 606 $aLogics and Meanings of Programs$3https://scigraph.springernature.com/ontologies/product-market-codes/I1603X 606 $aSoftware Engineering$3https://scigraph.springernature.com/ontologies/product-market-codes/I14029 606 $aProgramming Languages, Compilers, Interpreters$3https://scigraph.springernature.com/ontologies/product-market-codes/I14037 606 $aComputation by Abstract Devices$3https://scigraph.springernature.com/ontologies/product-market-codes/I16013 606 $aMathematical Logic and Formal Languages$3https://scigraph.springernature.com/ontologies/product-market-codes/I16048 615 0$aSoftware engineering. 615 0$aComputer logic. 615 0$aProgramming languages (Electronic computers). 615 0$aComputers. 615 0$aMathematical logic. 615 14$aSoftware Engineering/Programming and Operating Systems. 615 24$aLogics and Meanings of Programs. 615 24$aSoftware Engineering. 615 24$aProgramming Languages, Compilers, Interpreters. 615 24$aComputation by Abstract Devices. 615 24$aMathematical Logic and Formal Languages. 676 $a005 702 $aWalukiewicz$b Igor$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aFOSSACS 2004 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996465550103316 996 $aFoundations of Software Science and Computation Structures$9772187 997 $aUNISA