LEADER 05770nam 22007095 450 001 9910143635503321 005 20200702164355.0 010 $a3-540-46432-8 024 7 $a10.1007/3-540-46432-8 035 $a(CKB)1000000000211224 035 $a(SSID)ssj0000323275 035 $a(PQKBManifestationID)11212804 035 $a(PQKBTitleCode)TC0000323275 035 $a(PQKBWorkID)10312551 035 $a(PQKB)10665994 035 $a(DE-He213)978-3-540-46432-7 035 $a(MiAaPQ)EBC3071912 035 $a(PPN)155190229 035 $a(EXLCZ)991000000000211224 100 $a20121227d2000 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aFoundation of Software Science and Computation Structures $eThird International Conference, FOSSACS 2000 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2000 Berlin, Germany, March 25 - April 2, 2000 Proceedings /$fedited by Jerzy Tiuryn 205 $a1st ed. 2000. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2000. 215 $a1 online resource (X, 398 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v1784 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-67257-5 320 $aIncludes bibliographical references at the end of each chapters and index. 327 $aNorm Functions for Probabilistic Bisimulations with Delays -- Constructor Subtyping in the Calculus of Inductive Constructions -- Verifying Performance Equivalence for Timed Basic Parallel Processes -- On Word Rewriting Systems Having a Rational Derivation -- Proof Nets and Explicit Substitutions -- Typing Local Definitions and Conditional Expressions with Rank 2 Intersection (Extended Abstract) -- Hierarchical Graph Transformation -- A Program Refinement Framework Supporting Reasoning about Knowledge and Time -- A Higher-Order Simulation Relation for System F -- Probabilistic Asynchronous ?-Calculus -- Constructive Data Refinement in Typed Lambda Calculus -- On Recognizable Stable Trace Languages -- The State Explosion Problem from Trace to Bisimulation Equivalence -- A Proof System for Timed Automata -- Categorical Models for Intuitionistic and Linear Type Theory -- Locality and Polyadicity in Asynchronous Name-Passing Calculi -- On Rational Graphs -- Sequential and Concurrent Abstract Machines for Interaction Nets -- On Synchronous and Asynchronous Mobile Processes -- Type Inference for First-Order Logic -- An Algebraic Foundation for Adaptive Programming -- Predicate Logic and Tree Automata with Tests -- Compositional Verification in Linear-Time Temporal Logic -- On the Semantics of Refinement Calculi -- Subtyping and Typing Algorithms for Mobile Ambients. 330 $aETAPS2000wasthethirdinstanceoftheEuropeanJointConferencesonTheory 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 comprisedv e conferences (FOSSACS, FASE, ESOP,CC, TACAS), ve satellite workshops (CBS, CMCS, CoFI, GRATRA, INT), seven invited lectures, a panel discussion, and ten tutorials. The events that comprise ETAPS address various aspects of the system - velopmentprocess,includingspeci cation,design,implementation,analysis,and improvement. The languages, methodologies, and tools which support these - tivities are all well within its scope. Die rent 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. ETAPS is a loose confederation in which each event retains its own identity, with a separate program committee and independent proceedings. Its format is open-ended, allowing it to grow and evolve as time goes by. Contributed talks and system demonstrations are in synchronized parallel sessions, with invited lectures in plenary sessions. Two of the invited lectures are reserved for \u- fying" talks on topics of interest to the whole range of ETAPS attendees. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v1784 606 $aProgramming languages (Electronic computers) 606 $aComputer logic 606 $aMathematical logic 606 $aSoftware engineering 606 $aProgramming Languages, Compilers, Interpreters$3https://scigraph.springernature.com/ontologies/product-market-codes/I14037 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 $aSoftware Engineering$3https://scigraph.springernature.com/ontologies/product-market-codes/I14029 615 0$aProgramming languages (Electronic computers). 615 0$aComputer logic. 615 0$aMathematical logic. 615 0$aSoftware engineering. 615 14$aProgramming Languages, Compilers, Interpreters. 615 24$aLogics and Meanings of Programs. 615 24$aMathematical Logic and Formal Languages. 615 24$aSoftware Engineering. 676 $a005.1 702 $aTiuryn$b Jerzy$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aFOSSACS 2000 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910143635503321 996 $aFoundation of Software Science and Computation Structures$92179786 997 $aUNINA