Reachability as deducibility, finite countermodels and verification
نویسنده
چکیده
We propose a simple but powerful approach to the verification of parameterised systems. The approach is based on modelling the reachability between parameterized states as deducibility between suitable encodings of states by formulae of first-order predicate logic. To establish a safety property, that is non-reachability of unsafe states, the finite model finder is used to find a finite countermodel, the witness for non-deducibility.
منابع مشابه
Finite Model Finding for Parameterized Verification
In this paper we investigate to what extent a very simple and natural ”reachability as deducibility” approach, originating in research on formal methods for security, is applicable to the automated verification of large classes of infinite state and parameterized systems. This approach is based on modeling the reachability between (parameterized) states as deducibility between suitable encoding...
متن کاملFinite countermodels for safety verification of parameterized tree systems
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 a...
متن کاملFinite Countermodel Based Verification for Program Transformation (A Case Study)
Both automatic program verification and program transformation are based on program analysis. In the past decade a number of approaches using various automatic general-purpose program transformation techniques (partial deduction, specialization, supercompilation) for verification of unreachability properties of computing systems were introduced and demonstrated [10, 19, 30, 36]. On the other ha...
متن کاملS . Delaune , P . Lafourcade , D . Lugiez , R . Treinen Symbolic Protocol Analysis in Presence of a Homomorphism Operator and Exclusive Or Research Report LSV - 05 - 20 November 2005
The symbolic verification of the security property of a cryptographic protocol for a bounded number of sessions is usually expressed as a symbolic trace reachability problem. Such a problem can be expressed as a constraint system for deducibility constraints for a certain inference system describing the possible actions of an attacker. We show that symbolic trace reachability for well-defined p...
متن کاملFinite countermodels as invariants. A case study in verification of parameterized mutual exclusion protocol
In [5, 6] we proposed a simple but powerful approach to the verification of safety properties of parameterized and infinite state systems. Consider encoding e : s 7→ φs of states of a transition system S = 〈S,→〉 by formulae of first-order predicate logic satisfying the folowing property. The state s is reachable from s, i.e. s → s if and only if φs′ is the logical consequence of φs, that is φs ...
متن کامل