Derivatives of Logical Formulas


Title: Derivatives of Logical Formulas
Author: Dmitriy Traytel (traytel /at/ inf /dot/ ethz /dot/ ch)
Submission date: 2015-05-28
Abstract: We formalize new decision procedures for WS1S, M2L(Str), and Presburger Arithmetics. Formulas of these logics denote regular languages. Unlike traditional decision procedures, we do not translate formulas into automata (nor into regular expressions), at least not explicitly. Instead we devise notions of derivatives (inspired by Brzozowski derivatives for regular expressions) that operate on formulas directly and compute a syntactic bisimulation using these derivatives. The treatment of Boolean connectives and quantifiers is uniform for all mentioned logics and is abstracted into a locale. This locale is then instantiated by different atomic formulas and their derivatives (which may differ even for the same logic under different encodings of interpretations as formal words).

The WS1S instance is described in the draft paper A Coalgebraic Decision Procedure for WS1S by the author.

  author  = {Dmitriy Traytel},
  title   = {Derivatives of Logical Formulas},
  journal = {Archive of Formal Proofs},
  month   = may,
  year    = 2015,
  note    = {\url{},
            Formal proof development},
  ISSN    = {2150-914x},
License: BSD License
Depends on: Coinductive_Languages, Deriving, List-Index, Show
Status: [ok] This is a development version of this entry. It might change over time and is not stable. Please refer to release versions for citations.