Skip to main content
SpringerLink
Log in

Logics of Programs

Workshop, Yorktown Heights, NY, USA

  • Conference proceedings
  • © 1982

Overview

Editors:
  1. Dexter Kozen
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 131)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
Softcover Book USD 37.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (25 papers)

  1. Front Matter

    Download chapter PDF

  2. Proof rules dealing with fairness

    • Krzysztof R. Apt, Ernst-Rüdiger Olderog
    Pages 1-8

  3. Hoare's Logic is incomplete when it does not have to be

    • J. Bergstra, A. Chmielinska, J. Tiuryn
    Pages 9-23

  4. The refinement of specifications and the stability of Hoare's Logic

    • JA Bergstra, JV Tucker
    Pages 24-36

  5. Toward a logical theory of program data

    • Robert Cartwright
    Pages 37-51

  6. Design and synthesis of synchronization skeletons using branching time temporal logic

    • Edmund M. Clarke, E. Allen Emerson
    Pages 52-71

  7. The type theory of PL/CV3

    • Robert L. Constable, Daniel R. Zlatin
    Pages 72-93

  8. Correctness of programs with function procedures

    • J. W. de Bakker, J. W. Klop, J.-J.Ch. Meyer
    Pages 94-112

  9. A formalism for reasoning about fair termination

    • Willem P. de Roever
    Pages 113-121

  10. Keeping a foot on the ground

    • Brent Hailpern
    Pages 122-123

  11. Further results on propositional dynamic logic of nonregular programs

    • D. Harel, A. Pnueli, J. Stavi
    Pages 124-136

  12. Some observations on compositional semantics

    • Theo M. V. Janssen, Peter van Emde Boas
    Pages 137-149

  13. Some connections between iterative programs, recursive programs, and first-order logic

    • A. J. Kfoury
    Pages 150-166

  14. On induction vs. *-continuity

    • Dexter Kozen
    Pages 167-176

  15. Timesets

    • Leslie Lamport
    Pages 177-196

  16. Program logics and program verification

    • Leslie Lamport, Susan Owicki
    Pages 197-199

  17. Verification of concurrent programs: Temporal proof principles

    • Zohar Manna, Amir Pnueli
    Pages 200-252

  18. Synthesis of communicating processes from Temporal Logic specifications

    • Zohar Manna, Pierre Wolper
    Pages 253-281

  19. A note on equivalences among logics of programs

    • Albert R. Meyer, Jerzy Tiuryn
    Pages 282-299

  20. The representation theorem for algorithmic algebras

    • Grazyna Mirkowska
    Pages 300-310
Back to top

Keywords

Bibliographic Information

  • Book Title: Logics of Programs

  • Book Subtitle: Workshop, Yorktown Heights, NY, USA

  • Editors: Dexter Kozen

  • Series Title: Lecture Notes in Computer Science

  • DOI: https://doi.org/10.1007/BFb0025769

  • Publisher: Springer Berlin, Heidelberg

  • eBook Packages: Springer Book Archive

  • Copyright Information: Springer-Verlag Berlin Heidelberg 1982

  • Softcover ISBN: 978-3-540-11212-9Published: 01 March 1982

  • eBook ISBN: 978-3-540-39047-3Published: 19 November 2005

  • Series ISSN: 0302-9743

  • Series E-ISSN: 1611-3349

  • Edition Number: 1

  • Number of Pages: VIII, 429

  • Topics: Logics and Meanings of Programs

Publish with us

Policies and ethics

Back to top

Search

Navigation