Cantitate/Preț
Produs

Logics of Programs: Workshop, Yorktown Heights, NY, USA: Lecture Notes in Computer Science, cartea 131

Editat de D. Kozen
en Limba Engleză Paperback – mar 1982
With contributions by nummerous experts
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 20676 lei

Preț vechi: 25845 lei
-20%

Puncte Express: 310

Preț estimativ în valută:
3961 4301$ 3397£

Carte indisponibilă temporar

Doresc să fiu notificat când acest titlu va fi disponibil:

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540112129
ISBN-10: 354011212X
Pagini: 440
Ilustrații: VIII, 429 p.
Dimensiuni: 170 x 250 x 25 mm
Greutate: 1.35 kg
Ediția:1982
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

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.