• DOI:10.1007/BFb0055090
Corpus ID: 536904

Reasoning about The Past with Two-Way Automata

@inproceedings{Vardi1998ReasoningAT,
  title={Reasoning about The Past with Two-Way Automata},
  author={Moshe Y. Vardi},
  booktitle={ICALP},
  year={1998}
}

Moshe Y. Vardi

Published in ICALP 1998

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 satisfiability problem for the Μ-calculus is EXPTIME-complete. 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… CONTINUE READING

View via Publisher

cs.man.ac.uk

Save to Library

Create Alert

Cite

Launch Research Feed