## Abstract

This paper proposes the development of a logic for verifying properties of programs in rewriting logic. Rewriting logic is primarily a logic of change, in which deduction corresponds directly to computation, and not a logic to talk about change in a more indirect and global manner, such as the different modal and temporal logics that can be found in the literature. We start by defining a modal action logic (VLRL) in which rewrite rules are captured as actions. The main novelty of this logic is a topological modality associated with state constructors that allows us to reason about the structure of states, stating that the current state can be decomposed into regions satisfying certain properties. Then, on top of the modal logic, we define a temporal logic for reasoning about properties of the computations generated from rewrite theories, and demonstrate its potential by means of several examples.

Original language | English |
---|---|

Pages (from-to) | 317-352 |

Number of pages | 36 |

Journal | Journal of Logic and Computation |

Volume | 15 |

Issue number | 3 |

DOIs | |

Publication status | Published - 1 Jun 2005 |

## Keywords

- Modal action logic
- Rewriting logic
- Specification
- Temporal logic
- Verification