Reachability as Derivability, Finite Countermodels and Verification
We propose a simple and efficient approach to the verification of parameterized and infinite state system. The approach is based on modeling the reachability relation between parameterized states as deducibility between suitable encodings of the states using formulae of first-order logic. To establish a safety property, namely the non-reachability of unsafe states, a finite model finder is used to generate a finite countermodel, thus providing the witness for non-deducibility. We show that under an appropriate encoding the combination of finite model finding and theorem proving provides us with a decision procedure for the safety of the lossy channel systems. We illustrate the approach by reporting on experiments verifying both alternating bit protocol (specified as a lossy channel system) and a number of parameterized cache coherence protocols specified by extended finite state machines. In these experiments, the finite model finder Mace4 is used.
KeywordsGlobal State Regular Language Predicate Logic Safety Property Unsafe State
Unable to display preview. Download preview PDF.
- 6.Delzanno, G.: Verification of consistency protocols via infinite-state symbolic model checking, a case study. In: Proc. of FORTE/PSTV, pp. 171–188 (2000)Google Scholar
- 9.Esparza, J., Finkel, A., Mayr, R.: On the Verification of Broadcast Protocols. In: Proc. 14th IEEE Symp. Logic in Computer Science (LICS), pp. 352–359. IEEE CS Press, Los Alamitos (1999)Google Scholar
- 10.Fisher, M., Lisitsa, A.: Deductive Verification of Cache Coherence Protocols. In: Proceedings of the 3rd Workshop on Automated Verification of Critical Systems, AVoCS 2003, Southampton, UK, April 2-3, pp. 177–186 (2003), Technical Report DSSE-TR-2003-2Google Scholar
- 11.Fisher, M., Konev, B., Lisitsa, A.: Practical Infinite-state Verification with Temporal Reasoning. In: Verification of Infinite State Systems and Security. NATO Security through Science Series: Information and Communication, vol. 1. IOS Press, Amsterdam (January 2006)Google Scholar
- 12.Guttman, J.: Security Theorems via Model Theory, arXiv:0911.2036Google Scholar
- 14.Lisitsa, A.: Verification via Countermodel Finding (2009), http://www.csc.liv.ac.uk/~alexei/countermodel
- 15.Lisitsa, A.: Reachability as deducibility, finite countermodels and verification. In: Proceedings of AVOCS 2009, pp. 241–243 (2009)Google Scholar
- 16.Lisitsa, A., Nemytykh, A.: Reachability Analisys in Verification via Supercompilation. In: Proceedings of the Satellite Workshops of DTL 2007, Part 2, vol. 45, pp. 53–67. TUCS General Publication (June 2007)Google Scholar
- 17.McCune, W.: Prover9 and Mace4, http://www.cs.unm.edu/~mccune/mace4/
- 19.Robinson, A., Voronkov, A. (eds.): Handbook of Automated Reasoning, vol. I, II. Elsevier/MIT Press (2001)Google Scholar