LEADER 05399nam 22007575 450 001 9910143597603321 005 20250724093243.0 010 $a3-540-45315-6 024 7 $a10.1007/3-540-45315-6 035 $a(CKB)1000000000211480 035 $a(SSID)ssj0000323276 035 $a(PQKBManifestationID)11224774 035 $a(PQKBTitleCode)TC0000323276 035 $a(PQKBWorkID)10299238 035 $a(PQKB)11472026 035 $a(DE-He213)978-3-540-45315-4 035 $a(MiAaPQ)EBC3063706 035 $a(MiAaPQ)EBC6413319 035 $a(PPN)155229087 035 $a(EXLCZ)991000000000211480 100 $a20121227d2001 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aFoundations of Software Science and Computation Structures $e4th International Conference, FOSSACS 2001 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2001 Genova, Italy, April 2-6, 2001, Proceedings /$fedited by Furio Honsell, Marino Miculan 205 $a1st ed. 2001. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2001. 215 $a1 online resource (XII, 420 p.) 225 1 $aLecture Notes in Computer Science,$x1611-3349 ;$v2030 300 $aIncludes index. 311 08$a3-540-41864-4 320 $aIncludes bibliographical references and index. 327 $aInvited Paper -- Adequacy for Algebraic Effects -- Contributed Papers -- Secrecy Types for Asymmetric Communication -- Axiomatizing Tropical Semirings -- Type Isomorphisms and Proof Reuse in Dependent Type Theory -- On the Duality between Observability and Reachability -- The Finite Graph Problem for Two-Way Alternating Automata -- High-Level Petri Nets as Type Theories in the Join Calculus -- Temporary Data in Shared Dataspace Coordination Languages -- On Garbage and Program Logic -- The Complexity of Model Checking Mobile Ambients -- The Rho Cube -- Type Inference with Recursive Type Equations -- On the Modularity of Deciding Call-by-Need -- Synchronized Tree Languages Revisited and New Applications -- Computational Completeness of Programming Languages Based on Graph Transformation -- Axioms for Recursion in Call-by-Value -- Class Analysis of Object-Oriented Programs through Abstract Interpretation -- On the Complexity of Parity Word Automata -- Foundations for a Graph-Based Approach to the Specification of Access Control Policies -- Categories of Processes Enriched in Final Coalgebras -- Model Checking CTL+ and FCTL Is Hard -- On Regular Message Sequence Chart Languages and Relationships to Mazurkiewicz Trace Theory -- Verified Bytecode Verifiers -- Higher-Order Abstract Syntax with Induction in Isabelle/HOL: Formalizing the ?-Calculus and Mechanizing the Theory of Contexts -- Decidability of Weak Bisimilarity for a Subset of Basic Parallel Processes -- An Axiomatic Semantics for the Synchronous Language Gentzen -- Tool Presentation -- Marrella and the Verification of an Embedded System. 330 $aETAPS 2001 was the fourth 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), ten satellite workshops (CMCS, ETI Day, JOSES, LDTA, MMAABS, PFM, RelMiS, UNIGRA, WADT, WTUML), seven invited lectures, a debate, and ten tutorials. The events that comprise ETAPS address various aspects of the system de- lopment 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,$x1611-3349 ;$v2030 606 $aSoftware engineering 606 $aComputer science 606 $aMachine theory 606 $aCompilers (Computer programs) 606 $aSoftware Engineering 606 $aComputer Science Logic and Foundations of Programming 606 $aFormal Languages and Automata Theory 606 $aTheory of Computation 606 $aCompilers and Interpreters 615 0$aSoftware engineering. 615 0$aComputer science. 615 0$aMachine theory. 615 0$aCompilers (Computer programs) 615 14$aSoftware Engineering. 615 24$aComputer Science Logic and Foundations of Programming. 615 24$aFormal Languages and Automata Theory. 615 24$aTheory of Computation. 615 24$aCompilers and Interpreters. 676 $a005.453 702 $aMiculan$b Marino 702 $aHonsell$b Furio 712 12$aInternational Joint Conference on Theory and Practice of Software Development$d(10th :$f2001 :$eGenoa, Italy) 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910143597603321 996 $aFoundations of Software Science and Computation Structures$9772187 997 $aUNINA