International Conference on Automated Reasoning with Analytic Tableaux and Related Methods

Automated Reasoning with Analytic Tableaux and Related Methods pp 307-322

A Dynamic Logic with Traces and Coinduction

  • Richard Bubel
  • Crystal Chang Din
  • Reiner Hähnle
  • Keiko Nakata
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9323)

Abstract

Dynamic Logic with Traces and Coinduction is a new program logic that has an explicit syntactic representation of both programs and their traces. This allows to prove properties involving programs as well as traces. Moreover, we use a coinductive semantics which makes it possible to reason about non-terminating programs and infinite traces, such as controllers and servers. We develop a sound sequent calculus for our logic that realizes symbolic execution of the programs under verification. The calculus has been developed with the goal of automation in mind. One of the novelties of the calculus is a coinductive invariant rule for while loops that is able to prove termination as well as non-termination.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  • Richard Bubel
    • 1
  • Crystal Chang Din
    • 1
  • Reiner Hähnle
    • 1
  • Keiko Nakata
    • 2
  1. 1.Department of Computer ScienceTechnische Universität DarmstadtDarmstadtGermany
  2. 2.FireEyeDresdenGermany

Personalised recommendations