000 03474nam a22005775i 4500
001 978-3-540-49019-7
003 DE-He213
005 20240423132457.0
007 cr nn 008mamaa
008 121227s1999 gw | s |||| 0|eng d
020 _a9783540490197
_9978-3-540-49019-7
024 7 _a10.1007/3-540-49019-1
_2doi
050 4 _aQA76.758
072 7 _aUMZ
_2bicssc
072 7 _aCOM051230
_2bisacsh
072 7 _aUMZ
_2thema
082 0 4 _a005.1
_223
245 1 0 _aFoundations of Software Science and Computation Structures
_h[electronic resource] :
_bSecond International Conference, FOSSACS'99, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS'99, Amsterdam, The Netherlands, March 22-28, 1999, Proceedings /
_cedited by Wolfgang Thomas.
250 _a1st ed. 1999.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c1999.
300 _aX, 330 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 ;
_v1578
505 0 _aSecurity Protocols and Specifications -- An Automata-Theoretic Approach to Interprocedural Data-Flow Analysis -- Reasoning about Concurrent Systems Using Types -- Testing Hennessy-Milner Logic with Recursion -- A Strong Logic Programming View for Static Embedded Implications -- Unfolding and Event Structure Semantics for Graph Grammars -- Expanding the Cube -- An Algebraic Characterization of Typability in ML with Subtyping -- Static Analysis of Processes for No Read-Up and No Write-Down -- A WP-calculus for OO -- The Recognizability Problem for Tree Automata with Comparisons between Brothers -- A Theory of “May” Testing for Asynchronous Languages -- A Nondeterministic Polynomial-Time Unification Algorithm for Bags, Sets and Trees -- Categorical Models of Explicit Substitutions -- Equational Properties of Mobile Ambients -- Model Checking Logics for Communicating Sequential Agents -- A Complete Coinductive Logical System for Bisimulation Equivalence on Circular Objects -- String Languages Generated by Total Deterministic Macro Tree Transducers -- Matching Specifications for Message Sequence Charts -- Probabilistic Temporal Logics via the Modal Mu-Calculus -- A ?-calculus Process Semantics of Concurrent Idealised ALGOL.
650 0 _aSoftware engineering.
650 0 _aComputer science.
650 0 _aMachine theory.
650 0 _aCompilers (Computer programs).
650 1 4 _aSoftware Engineering.
650 2 4 _aComputer Science Logic and Foundations of Programming.
650 2 4 _aFormal Languages and Automata Theory.
650 2 4 _aTheory of Computation.
650 2 4 _aCompilers and Interpreters.
700 1 _aThomas, Wolfgang.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540657194
776 0 8 _iPrinted edition:
_z9783662167014
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v1578
856 4 0 _uhttps://doi.org/10.1007/3-540-49019-1
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
912 _aZDB-2-BAE
942 _cSPRINGER
999 _c188185
_d188185