First-order finite satisfiability vs tree automata in safety verification

Lisitsa, Alexei
(2011) First-order finite satisfiability vs tree automata in safety verification.

[img] Text
1107.0349v1.pdf - Submitted version

Download (190kB)


In this paper we deal with verification of safety properties of term-rewriting systems. The verification problem is translated to a purely logical problem of finding a finite countermodel for a first-order formula, which further resolved by a generic finite model finding procedure. A finite countermodel produced during successful verification provides with a concise description of the system invariant sufficient to demonstrate a specific safety property. We show the relative completeness of this approach with respect to the tree automata completion technique. On a set of examples taken from the literature we demonstrate the efficiency of finite model finding approach as well as its explanatory power.

Item Type: Article
Additional Information: 16 pages
Uncontrolled Keywords: cs.LO, cs.LO
Depositing User: Symplectic Admin
Date Deposited: 06 Sep 2018 13:26
Last Modified: 19 Jan 2023 01:25
Related URLs: