Logics of programs : workshop, Yorktown Heights, New York, May 1981
Author(s)
Bibliographic Information
Logics of programs : workshop, Yorktown Heights, New York, May 1981
（Lecture notes in computer science, 131）
Springer-Verlag, 1982
- : gw
- : us
Available at / 57 libraries
-
Library, Research Institute for Mathematical Sciences, Kyoto University数研
L/N||LNCS||1312893788
-
University of Tsukuba Library, Library on Library and Information Science
Germany007.08:L-49:131881003630
-
No Libraries matched.
- Remove all filters.
Note
Includes bibliographies
Description and Table of Contents
Description
With contributions by nummerous experts
Table of Contents
Proof 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.
by "Nielsen BookData"