Skip to main content
SpringerLink
Log in

Logics of Programs

Workshop Carnegie Mellon University Pittsburgh, PA, June 6-8, 1983

  • Conference proceedings
  • © 1984

Overview

Editors:
  1. Edmund Clarke
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. 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 164)

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 69.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 (35 papers)

  1. Front Matter

    Download chapter PDF

  2. A static analysis of CSP programs

    • Krzysztof R. Apt
    Pages 1-17

  3. Compactness in semantics for merge and fair merge

    • J. W. de Bakker, J. I. Zucker
    Pages 18-33

  4. Algebraic tools for system construction

    • J. A. Bergstra, J. W. Klop, J. V. Tucker
    Pages 34-44

  5. PC-compactness, a necessary condition for the existence of sound and complete logics of partial correctness

    • J. A. Bergstra, J. Tiuryn
    Pages 45-56

  6. The intractability of validity in logic programming and dynamic logic

    • Howard A. Blair
    Pages 57-67

  7. A semantics and proof system for communicating processes

    • Stephen D. Brookes
    Pages 68-85

  8. Non-standard fixed points in first order logic

    • Robert Cartwright
    Pages 86-100

  9. Automatic verification of asynchronous circuits

    • E. Clarke, B. Mishra
    Pages 101-115

  10. Mathematics as programming

    • R. L. Constable
    Pages 116-128

  11. Characterization of acceptable by algol-like programming languages

    • Ch. Crasemann, H. Langmaack
    Pages 129-146

  12. A rigorous approach to fault-tolerant system development

    • Flaviu Cristian
    Pages 147-160

  13. A sound and relatively complete axiomatization of clarke's language L4

    • Werner Damm, Bernhard Josko
    Pages 161-175

  14. Deciding branching time logic: A triple exponential decision procedure for CTL

    • E. Allen Emerson, A. Prasad Sistla
    Pages 176-192

  15. Equations in combinatory algebras

    • Erwin Engeler
    Pages 193-205

  16. Reasoning about procedures as parameters

    • S. M. German, E. M. Clarke Jr., J. Y. Halpern
    Pages 206-220

  17. Introducing institutions

    • J. A. Goguen, R. M. Burstall
    Pages 221-256

  18. A complete proof rule for strong equifair termination

    • Orna Grümberg, Nissim Francez, Shmuel Katz
    Pages 257-278

  19. Necessary and sufficient conditions for the universality of programming formalisms

    • A. J. Kfoury, P. Urzyczyn
    Pages 279-289

  20. There exist decidable context free propositonal dynamic logics

    • Tmima Koren, Amir Pnueli
    Pages 290-312
Back to top

Keywords

Bibliographic Information

  • Book Title: Logics of Programs

  • Book Subtitle: Workshop Carnegie Mellon University Pittsburgh, PA, June 6-8, 1983

  • Editors: Edmund Clarke, Dexter Kozen

  • Series Title: Lecture Notes in Computer Science

  • DOI: https://doi.org/10.1007/3-540-12896-4

  • Publisher: Springer Berlin, Heidelberg

  • eBook Packages: Springer Book Archive

  • Copyright Information: Springer-Verlag Berlin Heidelberg 1984

  • Softcover ISBN: 978-3-540-12896-0Published: 01 February 1984

  • eBook ISBN: 978-3-540-38775-6Published: 02 July 2005

  • Series ISSN: 0302-9743

  • Series E-ISSN: 1611-3349

  • Edition Number: 1

  • Number of Pages: VI, 531

  • Topics: Logics and Meanings of Programs, Mathematical Logic and Formal Languages

Publish with us

Policies and ethics

Back to top

Search

Navigation