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 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.

[1]  Jean Goubault-Larrecq,et al.  Finite models for formal security proofs , 2010, J. Comput. Secur..

[2]  Parosh Aziz Abdulla,et al.  Regular Tree Model Checking , 2002, CAV.

[3]  Peter Selinger.  Models for an adversary-centric protocol logic , 2001, Electron. Notes Theor. Comput. Sci..

[4]  Christoph Weidenbach,et al.  Towards an Automatic Analysis of Security Protocols in First-Order Logic , 1999, CADE.

[5]  Parosh Aziz Abdulla,et al.  Monotonic Abstraction: on Efficient Verification of Parameterized Systems , 2009, Int. J. Found. Comput. Sci..

[6]  Ahmed Bouajjani,et al.  Abstract regular (tree) model checking , 2012, International Journal on Software Tools for Technology Transfer.

[7]  Hubert Comon-Lundh,et al.  Inductionless Induction , 2001, Handbook of Automated Reasoning.

[8]  Alexei Lisitsa.  Finite Models vs Tree Automata in Safety Verification , 2012, RTA.

[9]  Jan Jürjens,et al.  Finite Models in FOL-Based Crypto-Protocol Verification , 2009, ARSPA-WITS.

[10]  Alexei Lisitsa,et al.  Reachability as Derivability, Finite Countermodels and Verification , 2010, ATVA.

[11]  J. Kruskal.  Well-quasi-ordering, the Tree Theorem, and Vazsonyi’s conjecture , 1960 .

[12]  Parosh Aziz Abdulla,et al.  Verifying Programs with Unreliable Channels , 1996, Inf. Comput..

[13]  Parosh Aziz Abdulla,et al.  A Survey of Regular Model Checking , 2004, CONCUR.

[14]  Parosh Aziz Abdulla,et al.  Parameterized Tree Systems , 2008, FORTE.

[15]  Alexei Lisitsa.  Finite countermodels as invariants. A case study in verification of parameterized mutual exclusion protocol , 2010, WING@ETAPS/IJCAR.

[16]  Marcus Nilsson,et al.  Regular Model Checking , 2000, CAV.

[17]  Joshua D. Guttman.  Security Theorems via Model Theory , 2009, EXPRESS.

[18]  Deepak Kapur,et al.  Proof by Consistency , 1987, Artif. Intell..

[19]  A. Lisitsa.  Reachability as deducibility , finite countermodels and verification , 2009 .

[20]  Alexei Lisitsa.  Finite Model Finding for Parameterized Verification , 2010, ArXiv.

[21]  Alexander Leitsch,et al.  Automated Model Building , 2010 .