LEADER 02983nam  22004935  450 
001 996466338403316
005 20200702161700.0
010   $a3-540-39047-2
024 7 $a10.1007/BFb0025769
035   $a(CKB)1000000000230163
035   $a(SSID)ssj0000324550
035   $a(PQKBManifestationID)11224804
035   $a(PQKBTitleCode)TC0000324550
035   $a(PQKBWorkID)10314779
035   $a(PQKB)11707765
035   $a(DE-He213)978-3-540-39047-3
035   $a(PPN)155196111
035   $a(EXLCZ)991000000000230163
100   $a20121227d1982      u|             0
101 0 $aeng
135   $aurnn|008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aLogics of Programs$b[electronic resource] $eWorkshop, Yorktown Heights, NY, USA /$fedited by D. Kozen
205   $a1st ed. 1982.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1982.
215   $a1 online resource (VIII, 429 p.) 
225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v131
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a3-540-11212-X 
327   $aProof rules dealing with fairness -- Hoare's Logic is incomplete when it does not have to be -- The refinement of specifications and the stability of Hoare's Logic -- Toward a logical theory of program data -- Design and synthesis of synchronization skeletons using branching time temporal logic -- The type theory of PL/CV3 -- Correctness of programs with function procedures -- A formalism for reasoning about fair termination -- Keeping a foot on the ground -- Further results on propositional dynamic logic of nonregular programs -- Some observations on compositional semantics -- Some connections between iterative programs, recursive programs, and first-order logic -- On induction vs. *-continuity -- Timesets -- Program logics and program verification -- Verification of concurrent programs: Temporal proof principles -- Synthesis of communicating processes from Temporal Logic specifications -- A note on equivalences among logics of programs -- The representation theorem for algorithmic algebras -- Nonstandard Dynamic Logic -- A critique of the foundations of Hoare-style programming logics -- Some applications of topology to program semantics -- Using graphs to understand PDL -- Critical remarks on max model of concurrency -- Transcript of panel discussion.
410  0$aLecture Notes in Computer Science,$x0302-9743 ;$v131
517 3 $aWith contributions by nummerous experts
606   $aComputer logic
606   $aLogics and Meanings of Programs$3https://scigraph.springernature.com/ontologies/product-market-codes/I1603X
615  0$aComputer logic.
615 14$aLogics and Meanings of Programs.
676   $a005.1015113
702   $aKozen$b D$4edt$4http://id.loc.gov/vocabulary/relators/edt
906   $aBOOK
912   $a996466338403316
996   $aLogics of programs$9332017
997   $aUNISA