LEADER 06235nam 22007575 450 001 996465439603316 005 20200702110243.0 010 $a3-540-45931-6 024 7 $a10.1007/3-540-45931-6 035 $a(CKB)1000000000211699 035 $a(SSID)ssj0000323277 035 $a(PQKBManifestationID)11242983 035 $a(PQKBTitleCode)TC0000323277 035 $a(PQKBWorkID)10299798 035 $a(PQKB)11426851 035 $a(DE-He213)978-3-540-45931-6 035 $a(MiAaPQ)EBC3071803 035 $a(PPN)15516662X 035 $a(EXLCZ)991000000000211699 100 $a20121227d2002 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aFoundations of Software Science and Computation Structures$b[electronic resource] $e5th International Conference, FOSSACS 2002. Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2002 Grenoble, France, April 8-12, 2002, Proceedings /$fedited by Mogens Nielsen, Uffe Engberg 205 $a1st ed. 2002. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2002. 215 $a1 online resource (XIII, 443 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v2303 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-43366-X 320 $aIncludes bibliographical references and index. 327 $aInvited Paper -- Semantical Evaluations as Monadic Second-Order Compatible Structure Transformations -- Contributed Papers -- Verification for Java?s Reentrant Multithreading Concept -- On the Integration of Observability and Reachability Concepts -- Proving Correctness of Timed Concurrent Constraint Programs -- Generalised Regular MSC Languages -- On Compositional Reasoning in the Spi-calculus -- On Specification Logics for Algebra-Coalgebra Structures: Reconciling Reachability and Observability -- A First-Order One-Pass CPS Transformation -- The Demonic Product of Probabilistic Relations -- Minimizing Transition Systems for Name Passing Calculi: A Co-algebraic Formulation -- Varieties of Effects -- A Characterization of Families of Graphs in Which Election Is Possible -- Equivalence-Checking with One-Counter Automata: A Generic Method for Proving Lower Bounds* -- Efficient Type Matching -- Higher-Order Pushdown Trees Are Easy -- Conflict Detection and Resolution in Access Control Policy Specifications -- Logics Admitting Final Semantics -- Model Checking Fixed Point Logic with Chop -- On Model Checking Durational Kripke Structures -- Model-Checking Infinite Systems Generated by Ground Tree Rewriting -- Bounded MSC Communication -- The Informatic Derivative at a Compact Element -- Heterogeneous Development Graphs and Heterogeneous Borrowing -- Notions of Computation Determine Monads -- A Calculus of Circular Proofs and Its Categorical Semantics -- Verifying Temporal Properties Using Explicit Approximants: Completeness for Context-free Processes -- Note on the Tableau Technique for Commutative Transition Systems -- A Semantic Basis for Local Reasoning -- Linearity and Bisimulation. 330 $aETAPS 2002 is the ?fth instance of the European Joint Conferences on Theory and Practice of Software. ETAPS is an annual federated conference that was established in 1998by combining a number of existing and new conferences. This year it comprises ?ve conferences (FOSSACS, FASE, ESOP, CC, TACAS), thirteen satellite workshops (ACL2, AGT, CMCS, COCV, DCC, INT, LDTA, SC, SFEDL, SLAP, SPIN, TPTS and VISS), eight invited lectures (not including those that are speci?c to the satellite events), and several tutorials. 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 which 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 one hand and soundly-based practice on the other. Many of the issues involved 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 ;$v2303 606 $aComputers 606 $aSoftware engineering 606 $aComputer logic 606 $aMathematical logic 606 $aProgramming languages (Electronic computers) 606 $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005 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 $aMathematical Logic and Formal Languages$3https://scigraph.springernature.com/ontologies/product-market-codes/I16048 606 $aProgramming Languages, Compilers, Interpreters$3https://scigraph.springernature.com/ontologies/product-market-codes/I14037 606 $aSoftware Engineering$3https://scigraph.springernature.com/ontologies/product-market-codes/I14029 615 0$aComputers. 615 0$aSoftware engineering. 615 0$aComputer logic. 615 0$aMathematical logic. 615 0$aProgramming languages (Electronic computers). 615 14$aTheory of Computation. 615 24$aSoftware Engineering/Programming and Operating Systems. 615 24$aLogics and Meanings of Programs. 615 24$aMathematical Logic and Formal Languages. 615 24$aProgramming Languages, Compilers, Interpreters. 615 24$aSoftware Engineering. 676 $a005.1 702 $aNielsen$b Mogens$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aEngberg$b Uffe$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aETAPS (Conference)$f(2002 :$eGrenoble, France), 906 $aBOOK 912 $a996465439603316 996 $aFoundations of Software Science and Computation Structures$9772187 997 $aUNISA