LEADER 04013nam  22005415  450 
001 996466341303316
005 20200702155313.0
010   $a3-540-38775-7
024 7 $a10.1007/3-540-12896-4
035   $a(CKB)1000000000230318
035   $a(SSID)ssj0000324551
035   $a(PQKBManifestationID)11254259
035   $a(PQKBTitleCode)TC0000324551
035   $a(PQKBWorkID)10314284
035   $a(PQKB)11056062
035   $a(DE-He213)978-3-540-38775-6
035   $a(PPN)155199048
035   $a(EXLCZ)991000000000230318
100   $a20121227d1984      u|             0
101 0 $aeng
135   $aurnn|008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aLogics of Programs$b[electronic resource] $eWorkshop Carnegie Mellon University Pittsburgh, PA, June 6-8, 1983 /$fedited by E. Clarke, D. Kozen
205   $a1st ed. 1984.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1984.
215   $a1 online resource (VI, 531 p.) 
225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v164
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a3-540-12896-4 
327   $aA static analysis of CSP programs -- Compactness in semantics for merge and fair merge -- Algebraic tools for system construction -- PC-compactness, a necessary condition for the existence of sound and complete logics of partial correctness -- The intractability of validity in logic programming and dynamic logic -- A semantics and proof system for communicating processes -- Non-standard fixed points in first order logic -- Automatic verification of asynchronous circuits -- Mathematics as programming -- Characterization of acceptable by algol-like programming languages -- A rigorous approach to fault-tolerant system development -- A sound and relatively complete axiomatization of clarke's language L4 -- Deciding branching time logic: A triple exponential decision procedure for CTL -- Equations in combinatory algebras -- Reasoning about procedures as parameters -- Introducing institutions -- A complete proof rule for strong equifair termination -- Necessary and sufficient conditions for the universality of programming formalisms -- There exist decidable context free propositonal dynamic logics -- A decision procedure for the propositional ?-calculus -- A verifier for compact parallel coordination programs -- Information systems, continuity and realizability -- A complete system of temporal logic for specification schemata -- Reasoning in interval temporal logic -- Hoare's logic for programs with procedures ? What has been achieved? -- A theory of probabilistic programs -- A low level language for obtaining decision procedures for classes of temporal logics -- Deriving efficient graph algorithms (summary) -- An introduction to specification logic -- An interval-based temporal logic -- Property preserving homomorphisms of transition systems -- From denotational to operational and axiomatic semantics for ALGOL-like languages: An overview -- Yet another process logic -- A proof system for partial correctness of dynamic networks of processes -- Errata.
410  0$aLecture Notes in Computer Science,$x0302-9743 ;$v164
606   $aComputer logic
606   $aMathematical logic
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
615  0$aComputer logic.
615  0$aMathematical logic.
615 14$aLogics and Meanings of Programs.
615 24$aMathematical Logic and Formal Languages.
676   $a005.1015113
702   $aClarke$b E$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aKozen$b D$4edt$4http://id.loc.gov/vocabulary/relators/edt
906   $aBOOK
912   $a996466341303316
996   $aLogics of programs$9332017
997   $aUNISA