A Sequent Calculus for First-Order Dynamic Logic with Trace Modalities

  • Authors:
  • Bernhard Beckert;Steffen Schlager

  • Affiliations:
  • -;-

  • Venue:
  • IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

The modalities of Dynamic Logic refer to the final state of a program execution and allow to specify programs with pre- and postconditions. In this paper, we extend Dynamic Logic with additional trace modalities "throughout" and "at least once", which refer to all the states a program reaches. They allow one to specify and verify invariants and safety constraints that have to be valid throughout the execution of a program. We give a sound and (relatively) complete sequent calculus for this extended Dynamic Logic.