Propositional Dynamic Logic of Looping and Converse
Name
MIT-LCS-TR-263.pdf
Size
1.46 MB
Format
Adobe PDF
Checksum (MD5)
09f68b9263876b8d15216fb216d61bc5
Author(s)
Streett, Robert S.
Date Issued
May 1981
Series/Report no.
MIT-LCS-TR-263
Abstract
Dynamic logic [5,6,15,16] applies concepts from modal logic to a relational semantics of programs to yield various systems for reasoning about the before-after behavior of programs. Analogues to the modal logic assertions ?p (possibly p) and ?p(necessarily p) are the dynamic logic constructs p and [a]p. If a is a program and p is an assertion about the state of a computation, then ,p asserts that after executing a, p can be the case, and [a]p asserts that after executing a, p must be the case.
Persistent DSpace Link
