Finite countermodels for safety verification of parameterized tree systems

Details Finite countermodels for safety verification of parameterized tree systems Finite countermodels for safety verification of parameterized tree systems

2011-07-26

arxiv.org/abs/1107.5142v1

Computer Science

Logic in Computer Science

18 pages

Scientific paper

In this paper we deal with verification of safety properties of parameterized systems with a tree topology. 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 method is shown is at least as powerful as regular tree model checking and as the methods based on monotonic abstraction and backwards symbolic reachability. The practical efficiency of the method is illustrated on a set of examples taken from the literature.

Affiliated with

Also associated with

No associations

Rating

Finite countermodels for safety verification of parameterized tree systems 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 Finite countermodels for safety verification of parameterized tree systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Finite countermodels for safety verification of parameterized tree systems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-93213