- Format
- Häftad (Paperback / softback)
- Språk
- Engelska
- Antal sidor
- 429
- Utgivningsdatum
- 1982-03-01
- Upplaga
- 1982 ed.
- Förlag
- Springer-Verlag Berlin and Heidelberg GmbH & Co. K
- Medarbetare
- Kozen, D. (ed.)
- Illustrationer
- VIII, 429 p.
- Dimensioner
- 234 x 156 x 23 mm
- Vikt
- Antal komponenter
- 1
- Komponenter
- 1 Paperback / softback
- ISBN
- 9783540112129
- 613 g
Logics of Programs
Workshop, Yorktown Heights, NY, USA
- Skickas från oss inom 7-10 vardagar.
- Fri frakt över 249 kr för privatkunder i Sverige.
Passar bra ihop
-
- +
-
De som köpt den här boken har ofta också köpt Co-Intelligence av Ethan Mollick (häftad).
Köp båda 2 för 702 krKundrecensioner
Fler böcker av D Kozen
-
Automata and Computability
D Kozen
This textbook provides undergraduate students with an introduction to the basic theoretical models of computability, and develops some of the model's rich and varied structure. The first part of the book is devoted to finite automata and their pro...
-
Theory of Computation: Classical & Contemporary Approaches
D Kozen
Covers core material in the foundations of computing for graduate students in computer science. This book also provides an introduction to some more advanced topics for those intending further study in the area. It contains a collection of lecture...
Innehållsförteckning
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.