Youssef Hanna
Samik Basu
Hridesh Rajan
ABSTRACT
Verifying correctness properties of parameterized systems is a long-standing problem. The challenge lies in the lack of guarantee that the property is satisfied for all instances of the parameterized system. Existing work on addressing this challenge aims to reduce this problem to checking the properties on smaller systems with a bound on the parameter referred to as the cut-off. A property satisfied on the system with the cut-off ensures that it is satisfied for systems with any larger parameter. The major problem with these techniques is that they only work for certain classes of systems with specific communication topology such as ring topology, thus leaving other interesting classes of systems unverified. We contribute an automated technique for finding the cut-off of the parameterized system that works for systems defined with any topology. Given the specification and the topology of the system, our technique is able to automatically generate the cut-off specific to this system. We prove the soundness of our technique and demonstrate its effectiveness and practicality by applying it to several canonical examples where in some cases, our technique obtains smaller cut-off values than those presented in the existing literature.
- P. A. Abdulla, G. Delzanno, N. B. Henda, and A. Rezine. Regular model checking without transducers (on efficient verification of parameterized systems). In TACAS, pages 721-736, 2007. Google Scholar
Digital Library
- P. A. Abdulla, B. Jonsson, M. Nilsson, and J. d'Orso. Regular model checking made simple and efficient. In CONCUR, pages 116--130, 2002. Google ScholarDigital Library
- T. E. Anderson. The performance of spin lock alternatives for shared-memory multiprocessors. IEEE Trans. Parallel Distrib. Syst., 1(1):6--16, 1990. Google ScholarDigital Library
- K. R. Apt and D. C. Kozen. Limits for automatic verification of finite-state concurrent systems. Inf. Process. Lett., 22(6):307--309, 1986. Google ScholarDigital Library
- T. Arons, A. Pnueli, S. Ruah, J. Xu, and L. D. Zuck. Parameterized verification with automatically computed inductive assertions. In CAV, pages 221--234, 2001. Google ScholarDigital Library
- P. Baldan, A. Corradini, and B. König. A framework for the verification of infinite-state graph transformation systems. Inf. Comput., 206(7):869--907, 2008. Google ScholarDigital Library
- P. Baldan, B. König, and A. Rensink. Graph grammar verification through abstraction. In Dagstuhl Seminar Proceedings 04241, 2005.Google Scholar
- T. Ball, S. Chaki, and S. K. Rajamani. Parameterized verification of multithreaded software libraries. In TACAS, pages 158--173, 2001. Google ScholarDigital Library
- S. Basu and C. R. Ramakrishnan. Compositional analysis for verification of parameterized systems. Theor. Comput. Sci., 354(2):211--229, 2006. Google ScholarDigital Library
- A. Bouajjani, B. Jonsson, M. Nilsson, and T. Touili. Regular model checking. In CAV, pages 403--418, 2000. Google ScholarDigital Library
- A. Bouajjani, Y. Jurski, and M. Sighireanu. Reasoning about dynamic networks of infinite-state processes with global synchronization. HAL - CCSD, 2006.Google Scholar
- A. Bouajjani, Y. Jurski, and M. Sighireanu. A generic framework for reasoning about dynamic networks of infinite-state processes. In TACAS, pages 690--705, 2007. Google ScholarDigital Library
- E. Clarke, M. Talupur, and H. Veith. Environment abstraction for parameterized verification. In VMCAI, 126--141, 2006. Google ScholarDigital Library
- E. M. Clarke, O. Grumberg, and S. Jha. Verifying parameterized networks using abstraction and regular languages. In CONCUR, pages 395--407, 1995. Google ScholarDigital Library
- E. M. Clarke, M. Talupur, and H. Veith. Proving ptolemy right: The environment abstraction framework for model checking concurrent systems. In TACAS, pages 33--47, 2008. Google ScholarDigital Library
- E. Dijkstra. Two starvation free solutions to a general exclusion problem. EWD 625, Plataanstraat 5, 5671 AL Neunen, The Netherlands.Google Scholar
- E. A. Emerson and V. Kahlon. Model checking large-scale and parameterized resource allocation systems. In TACAS, pages 251--265, 2002. Google ScholarDigital Library
- E. A. Emerson and V. Kahlon. Exact and efficient verification of parameterized cache coherence protocols. In CHARME, pages 247--262, 2003.Google ScholarCross Ref
- E. A. Emerson and K. S. Namjoshi. Reasoning about rings. In POPL, pages 85--94, 1995. Google ScholarDigital Library
- E. A. Emerson and K. S. Namjoshi. Automatic verification of parameterized synchronous systems (extended abstract). In CAV, pages 87--98, 1996. Google ScholarDigital Library
- E. A. Emerson, R. J. Trefler, and T. Wahl. Reducing model checking of the few to the one. In ICFEM, pp. 94--113, 2006. Google ScholarDigital Library
- D. Fisman, O. Kupferman, and Y. Lustig. On verifying fault tolerance of distributed protocols. In TACAS, 315-331, 2008. Google ScholarDigital Library
- S. M. German and A. P. Sistla. Reasoning about systems with many processes. J. ACM, 39(3):675--735, 1992. Google ScholarDigital Library
- Y. Hanna, S. Basu, and H. Rajan. Behavioral automata composition for automatic topology independent verification of parameterized systems. Technical Report 09-17, Computer Sc., Iowa State U., 2009.Google Scholar
- C. N. Ip and D. L. Dill. Verifying systems with replicated components in murphi. In CAV, pages 147--158, 1996. Google ScholarDigital Library
- M. Llorens and J. Oliver. Introducing structural dynamic changes in petri nets: Marked-controlled reconfigurable nets. In ATVA, pages 310--323, 2004.Google ScholarCross Ref
- R. Milner. A Calculus of Communicating Systems. Springer-Verlag New York, Inc., 1982. Google ScholarDigital Library
- A. Pnueli, S. Ruah, and L. D. Zuck. Automatic deductive verification with invisible invariants. In TACAS '01, 92--97. Google ScholarDigital Library
- A. Pnueli, J. Xu, and L. D. Zuck. Liveness with (0, 1, infty)-counter abstraction. In CAV, pp. 107--122, 2002. Google ScholarDigital Library
- M. Saksena, O. Wibling, and B. Jonsson. Graph grammar modeling and verification of ad hoc routing protocols. In TACAS, pages 18--32, 2008. Google ScholarDigital Library
- P. Wolper and V. Lovinfosse. Verifying properties of large sets of processes with network invariants. In the International Workshop on Automatic Verification Methods for Finite State Systems, pages 68--80, 1990. Google ScholarDigital Library
Index Terms
- Behavioral automata composition for automatic topology independent verification of parameterized systems
Recommendations
Automatic verification of parameterised multi-agent systems
AAMAS '13: Proceedings of the 2013 international conference on Autonomous agents and multi-agent systemsA key problem in verification of multi-agent systems by model checking concerns the fact that the state-space of the system grows exponentially with the number of agents present. This often makes practical model checking unfeasible whenever the system ...
Parameterized model checking of networks of timed automata with Boolean guards
AbstractParameterized model checking is a formal verification technique for verifying that some specifications hold in systems consisting of many similar cooperating but indistinguishable processes. The problem is known to be undecidable in ...
Comments