A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Reasoning about the past with two-way automata
[chapter]
1998
Lecture Notes in Computer Science
The -calculus can be viewed as essentially the \ultimate" program logic, as it expressively subsumes all propositional program logics, including dynamic logics, process logics, and temporal logics. It is known that the satis ability problem for the -calculus is EXPTIMEcomplete. This upper bound, however, is known for a version of the logic that has only forward modalities, which express weakest preconditions, but not backward modalities, which express strongest postconditions. Our main result
doi:10.1007/bfb0055090
fatcat:6ce6jqcjzbehjdk5gh4xstnn5y