Harel David. Proving the correctness of regular deterministic programs: a unifying survey using dynamic logic. Theoretical computer science, vol. 12 , pp. 61–81 [Book Review]

Journal of Symbolic Logic 50 (2):552-553 (1985)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,752

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Temporal and Dynamic Logic.Frank Wolter & Michael Wooldridge - 2010 - Journal of the Indian Council of Philosophical Research 27 (1).
First-Order Dynamic Logic.David Harel - 1982 - Journal of Symbolic Logic 47 (2):453-454.
Proving Correctness of Refinement and Implementation.Grant Malcolm & Joseph Goguen - 1994 - Oxford University Computing Laboratory, Programming Research Group.
Tableaux for constructive concurrent dynamic logic.Duminda Wijesekera & Anil Nerode - 2005 - Annals of Pure and Applied Logic 135 (1-3):1-72.
Three paradigms of computer science.Amnon H. Eden - 2007 - Minds and Machines 17 (2):135-167.
Dynamic Logic.Lenore D. Zuck & David Harel - 1989 - Journal of Symbolic Logic 54 (4):1480.

Analytics

Added to PP
2016-06-30

Downloads
10 (#1,189,467)

6 months
3 (#965,065)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Rohit Parikh
CUNY Graduate Center

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references