2011/07/01 by Alexei Lisitsa, Lisitsa, Alexei
Computer Science · Engineering · #FOS: Computer and information sciences #Formal Methods in Verification #Logic in Computer Science (cs.LO) #Logic, programming, and type systems #Safety Systems Engineering in Autonomy #Software Testing and Debugging Techniques #cs.LO
paper · pdf · doi:10.48550/arxiv.1107.0349
16 pages
openalex publication_date 2011/07/01 · arxiv created 2011/07/02 · arxiv updated 2011/07/05 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.