000 05178nam a22006015i 4500
001 978-3-540-45931-6
003 DE-He213
005 20240423132436.0
007 cr nn 008mamaa
008 121227s2002 gw | s |||| 0|eng d
020 _a9783540459316
_9978-3-540-45931-6
024 7 _a10.1007/3-540-45931-6
_2doi
050 4 _aQA75.5-76.95
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYA
_2thema
082 0 4 _a004.0151
_223
245 1 0 _aFoundations of Software Science and Computation Structures
_h[electronic resource] :
_b5th 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 /
_cedited by Mogens Nielsen, Uffe Engberg.
250 _a1st ed. 2002.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2002.
300 _aXIII, 443 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 ;
_v2303
505 0 _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.
520 _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.
650 0 _aComputer science.
650 0 _aSoftware engineering.
650 0 _aMachine theory.
650 0 _aCompilers (Computer programs).
650 1 4 _aTheory of Computation.
650 2 4 _aSoftware Engineering.
650 2 4 _aComputer Science Logic and Foundations of Programming.
650 2 4 _aFormal Languages and Automata Theory.
650 2 4 _aCompilers and Interpreters.
700 1 _aNielsen, Mogens.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aEngberg, Uffe.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540433668
776 0 8 _iPrinted edition:
_z9783662165805
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v2303
856 4 0 _uhttps://doi.org/10.1007/3-540-45931-6
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
912 _aZDB-2-BAE
942 _cSPRINGER
999 _c187795
_d187795