| 000 | 02980nam a22005055i 4500 | ||
|---|---|---|---|
| 001 | 978-3-540-39047-3 | ||
| 003 | DE-He213 | ||
| 005 | 20160624101942.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 121227s1982 gw | s |||| 0|eng d | ||
| 020 |
_a9783540390473 _9978-3-540-39047-3 |
||
| 024 | 7 |
_a10.1007/BFb0025769 _2doi |
|
| 050 | 4 | _aQA76.9.L63 | |
| 050 | 4 | _aQA76.5913 | |
| 050 | 4 | _aQA76.63 | |
| 072 | 7 |
_aUM _2bicssc |
|
| 072 | 7 |
_aUYF _2bicssc |
|
| 072 | 7 |
_aCOM051000 _2bisacsh |
|
| 072 | 7 |
_aCOM036000 _2bisacsh |
|
| 082 | 0 | 4 |
_a005.1015113 _223 |
| 245 | 1 | 0 |
_aLogics of Programs _h[electronic resource] : _bWorkshop, Yorktown Heights, New York, May 1981 / _cedited by Dexter Kozen. |
| 246 | 3 | _aWith contributions by nummerous experts | |
| 260 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1982. |
|
| 264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1982. |
|
| 300 |
_aVIII, 429 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, _x0302-9743 ; _v131 |
|
| 505 | 0 | _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. | |
| 650 | 0 | _aComputer science. | |
| 650 | 0 | _aLogic design. | |
| 650 | 1 | 4 | _aComputer Science. |
| 650 | 2 | 4 | _aLogics and Meanings of Programs. |
| 700 | 1 |
_aKozen, Dexter. _eeditor. |
|
| 710 | 2 | _aSpringerLink (Online service) | |
| 773 | 0 | _tSpringer eBooks | |
| 776 | 0 | 8 |
_iPrinted edition: _z9783540112129 |
| 786 | _dSpringer | ||
| 830 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v131 |
|
| 856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/BFb0025769 |
| 942 |
_2EBK4580 _cEBK |
||
| 999 |
_c33874 _d33874 |
||