Finite Models vs Tree Automata in Safety Verification
From MaRDI portal
Publication:5111907
DOI10.4230/LIPICS.RTA.2012.225zbMATH Open1437.68084arXiv1107.0349OpenAlexW2294895074MaRDI QIDQ5111907FDOQ5111907
Publication date: 27 May 2020
Abstract: 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.
Full work available at URL: https://arxiv.org/abs/1107.0349
Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42) Specification and verification (program logics, model checking, etc.) (68Q60) Classical first-order logic (03B10)
Cited In (3)
Recommendations
- Proving Safety with Trace Automata and Bounded Model Checking 👍 👎
- On the Construction of Fine Automata for Safety Properties 👍 👎
- Automata-Theoretic Model Checking Revisited 👍 👎
- Title not available (Why is that?) 👍 👎
- Model Checking Safety-Critical Systems Using Safecharts 👍 👎
- Modeling, specification, and verification of automaton programs 👍 👎
- Model checking of safety properties 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
This page was built for publication: Finite Models vs Tree Automata in Safety Verification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111907)
