First-order finite satisfiability vs tree automata in safety verification

Details First-order finite satisfiability vs tree automata in safety verification First-order finite satisfiability vs tree automata in safety verification

2011-07-02

arxiv.org/abs/1107.0349v1

Computer Science

Logic in Computer Science

16 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

First-order finite satisfiability vs tree automata in safety verification does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with First-order finite satisfiability vs tree automata in safety verification, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and First-order finite satisfiability vs tree automata in safety verification will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-175071