Finite Models vs Tree Automata in Safety Verification
From MaRDI portal
Publication:5111907
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.
Recommendations
- Proving safety with trace automata and bounded model checking
- On the Construction of Fine Automata for Safety Properties
- Automata-Theoretic Model Checking Revisited
- scientific article; zbMATH DE number 1982198
- Model Checking Safety-Critical Systems Using Safecharts
- Modeling, specification, and verification of automaton programs
- Model checking of safety properties
- scientific article; zbMATH DE number 2102704
- Publication:4503921
Cited in
(6)- Finite reasons for safety. Parameterized verification by finite model finding
- Rewriting Techniques and Applications
- Termination criteria for tree automata completion
- Equational approximations for tree automata completion
- Revisiting MU puzzle: a case study in finite countermodels verification
- Proving semantic properties as first-order satisfiability
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)
