Advertisement

Parameterized verification

  • Parosh A. Abdulla
  • Giorgio Delzanno
Introduction

Abstract

The goal of parameterized verification is to prove the correctness of a system specification regardless of the number of its components. The problem is of interest in several different areas: verification of hardware design, multithreaded programs, distributed systems, and communication protocols. The problem is undecidable in general. Solutions for restricted classes of systems and properties have been studied in areas like theorem proving, model checking, automata and logic, process algebra, and constraint solving. In this introduction to the special issue, dedicated to a selection of works from the Parameterized Verification workshop PV ’14 and PV ’15, we survey some of the works developed in this research area.

Keywords

Formal verification Program analysis Concurrent and distributed systems 

References

  1. 1.
    Abadi, M., Blanchet, B.: Analyzing security protocols with secrecy types and logic programs. J. ACM 52(1), 102–146 (2005)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Abdulla, P., Delzanno, G.: Constrained multiset rewriting. In: Proc. of the 6th international workshop on automated verification of infinite-state systems (AVIS’ 2006) (2006)Google Scholar
  3. 3.
    Abdulla, P., Haziza, F., Holik, L.: Parameterized verification through view abstraction. STTT (In this issue) (2016)Google Scholar
  4. 4.
    Abdulla, P.A.: Well (and better) quasi-ordered transition systems. Bull. Symb. Logic 16(4), 457–515 (2010)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Abdulla, P.A.: Regular model checking. STTT 14(2), 109–118 (2012)CrossRefGoogle Scholar
  6. 6.
    Abdulla, P.A., Atig, M.F., Chen, Y.-F., Leonardsson, C., Rezine, A.: Counter-example guided fence insertion under TSO. In: Tools and Algorithms for the Construction and Analysis of Systems—18th International Conference, TACAS 2012, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2012, Tallinn, Estonia, March 24–April 1, 2012. Proceedings, pp. 204–219 (2012)Google Scholar
  7. 7.
    Abdulla, P.A., Cederberg, J., Vojnar, T.: Monotonic abstraction for programs with multiply-linked structures. Int. J. Found. Comput. Sci. 24(2), 187–210 (2013)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Abdulla, P.A., Cerans, K., Jonsson, B., Tsay, Y.-K.: General decidability theorems for infinite-state systems. In: Proceedings, 11th Annual IEEE Symposium on Logic in Computer Science, New Brunswick, New Jersey, USA, 27–30 July, 1996. IEEE Computer Society, Washington (1996)Google Scholar
  9. 9.
    Abdulla, P.A., Delzanno, G., Van Begin, L.: On the qualitative analysis of conformon P systems. In: Membrane Computing—9th International Workshop, WMC 2008, Edinburgh, UK, July 28–31, 2008, Revised Selected and Invited Papers, pp. 78–94 (2008)Google Scholar
  10. 10.
    Abdulla, P.A., Delzanno, G., Rezine, A.: Approximated parameterized verification of infinite-state processes with global conditions. Form Methods Syst. Des. 34(2), 126–156 (2009)CrossRefzbMATHGoogle Scholar
  11. 11.
    Abdulla, P.A., Haziza, F., Holík, L.: All for the price of few. In: Verification, Model Checking, and Abstract Interpretation, 14th International Conference, VMCAI 2013, Rome, Italy, January 20–22, 2013. Proceedings, pp. 476–495 (2013)Google Scholar
  12. 12.
    Abdulla, P.A., Jonsson, B.: Undecidable verification problems for programs with unreliable channels. Inf. Comput. 130(1), 71–90 (1996)MathSciNetCrossRefzbMATHGoogle Scholar
  13. 13.
    Abdulla, P.A., Jonsson, B.: Verifying networks of timed processes (extended abstract). In: Tools and Algorithms for Construction and Analysis of Systems, 4th International Conference, TACAS ’98, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS’98, Lisbon, Portugal, March 28—April 4, 1998, Proceedings, pp. 298–312 (1998)Google Scholar
  14. 14.
    Abdulla, P.A., Delzanno, G., Rezine, A.: Monotonic abstraction in action. In: Theoretical Aspects of Computing—ICTAC 2008, 5th International Colloquium, Istanbul, Turkey, September 1–3, 2008. Proceedings, pp. 50–65 (2008)Google Scholar
  15. 15.
    Aminof, B., Kotek, T., Rubin, S., Spegni, F., Veith, H.: Parameterized model checking of rendezvous systems. In: CONCUR 2014—Concurrency Theory—25th International Conference, CONCUR 2014, Rome, Italy, September 2–5, 2014. Proceedings, pp. 109–124 (2014)Google Scholar
  16. 16.
    Apt, K.R., Kozen, D.: Limits for automatic verification of finite-state concurrent systems. Inf. Process. Lett. 22(6), 307–309 (1986)MathSciNetCrossRefGoogle Scholar
  17. 17.
    Ball, T., Chaki, S., Rajamani, S.K.: Parameterized verification of multithreaded software libraries. In: Tools and Algorithms for the Construction and Analysis of Systems—7th International Conference, TACAS 2001, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2001, Genova, Italy, 2–6 April, 2001. Lecture Notes in Computer Science, vol. 2031, pp. 158–173. Springer, Berlin (2001)Google Scholar
  18. 18.
    Bertrand, N., Delzanno, G., König, B., Sangnier, A., Stückrath, J.: On the decidability status of reachability and coverability in graph transformation systems. In: 23rd International conference on rewriting techniques and applications (RTA’ 12), RTA 2012, May 28–June 2, 2012, Nagoya, Japan. LIPIcs 15, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, pp. 101–116 (2012)Google Scholar
  19. 19.
    Bonnet, R.: The reachability problem for vector addition system with one zero-test. In: Mathematical Foundations of Computer Science 2011—36th International Symposium, MFCS 2011, Warsaw, Poland, August 22–26, 2011. Proceedings, pp. 145–157 (2011)Google Scholar
  20. 20.
    Bozzelli, L., Pinchinat, S.: Verification of gap-order constraint abstractions of counter systems. Theor. Comput. Sci. 523, 1–36 (2014)MathSciNetCrossRefzbMATHGoogle Scholar
  21. 21.
    Browne, M.C., Clarke, E.M., Grumberg, O.: Reasoning about networks with many identical finite state processes. Inf. Comput. 81(1), 13–31 (1989)MathSciNetCrossRefzbMATHGoogle Scholar
  22. 22.
    Busi, N., Gabbrielli, M., Zavattaro, G.: On the expressive power of recursion, replication and iteration in process calculi. Math. Struct. Comput. Sci. 19(6), 1191–1222 (2009)MathSciNetCrossRefzbMATHGoogle Scholar
  23. 23.
    Montali, M., Calvanese, D.: Soundness of data-aware, case-centric processes. Int. J. Softw. Tools Technol. Transf. (2016). doi: 10.1007/s10009-016-0417-2 (In this special issue)
  24. 24.
    Cécé, G., Finkel, A., Iyer, S.P.: Unreliable channels are easier to verify than perfect channels. Inf. Comput. 124(1), 20–31 (1996)Google Scholar
  25. 25.
    Cerans, K.: Deciding properties of integral relational automata. In: Automata, Languages and Programming, 21st International Colloquium, ICALP94, Jerusalem, Israel, July 11–14, 1994, Proceedings, pp. 35–46 (1994)Google Scholar
  26. 26.
    Chambart, P., Schnoebelen, P.h.: Mixing lossy and perfect fifo channels. In: CONCUR 2008—Concurrency Theory, 19th International conference, CONCUR 2008, Toronto, Canada, 19–22 August, 2008. Lecture Notes in Computer Science, vol. 5201, pp. 340–355. Springer, Heidelberg (2008)Google Scholar
  27. 27.
    Clarke, E.M., Talupur, M., Veith, H.: Environment abstraction for parameterized verification. In: Verification, Model Checking, and Abstract Interpretation, 7th International Conference, VMCAI 2006, Charleston, SC, USA, January 8–10, 2006, Proceedings, pp. 126–141 (2006)Google Scholar
  28. 28.
    Delzanno, G.: An overview of MSR(C): a CLP-based framework for the symbolic verification of parameterized concurrent systems. Electr. Notes Theor. Comput. Sci. 76, 65–82 (2002)CrossRefGoogle Scholar
  29. 29.
    Delzanno, G.: Constraint-based verification of parameterized cache coherence protocols. FMSD 23(3), 257–301 (2003)zbMATHGoogle Scholar
  30. 30.
    Delzanno, G.: Constraint-based automatic verification of abstract models of multithreaded programs. TPLP 7(1–2), 67–91 (2007)MathSciNetzbMATHGoogle Scholar
  31. 31.
    Delzanno, G.: A unified view of parameterized verification of abstract models of broadcast communication. Int. J. Softw. Tools Technol. Transf. (2016). doi: 10.1007/s10009-016-0412-7 (In this special issue)
  32. 32.
    Delzanno, G., Van Begin, L.: A biologically inspired model with fusion and clonation of membranes. In Unconventional Computing, 7th International Conference, UC 2008, Vienna, Austria, August 25–28, 2008. Proceedings, pp. 64–82 (2008)Google Scholar
  33. 33.
    Delzanno, G., Di Giusto, C., Gabbrielli, M., Laneve, C., Zavattaro, G.: The kappa-lattice: Decidability boundaries for qualitative analysis in biological languages. In: Computational Methods in Systems Biology, 7th International Conference, CMSB 2009, Bologna, Italy, August 31–September 1, 2009. Proceedings, pp. 158–172 (2009)Google Scholar
  34. 34.
    Delzanno, G., Sangnier, A., Zavattaro, G.: On the power of cliques in the parameterized verification of ad hoc networks. In: Foundations of software science and computational structures—14th International Conference, FOSSACS 2011, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2011, Saarbrücken, Germany, March 26–April 3, 2011. Lecture Notes in Computer Science, vol. 6604, pp. 441–455. Springer, Heidelberg (2011)Google Scholar
  35. 35.
    Delzanno, G., Zavattaro, G.: Reachability problems in bioambients. Theor. Comput. Sci. 431, 56–74 (2012)MathSciNetCrossRefzbMATHGoogle Scholar
  36. 36.
    Emerson, E.A., Kahlon, V.: Exact and efficient verification of parameterized cache coherence protocols. In: Correct Hardware Design and Verification Methods, 12th IFIP WG 10.5 Advanced Research Working Conference, CHARME 2003, L’Aquila, Italy, October 21–24, 2003, Proceedings, pp. 247–262 (2003)Google Scholar
  37. 37.
    Emerson, E.A., Namjoshi, K.S.: Reasoning about rings. In: Conference Record of POPL’95: 22nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, San Francisco, California, USA, January 23–25, 1995, pp. 85–94. ACM Press, San Francisco (1995)Google Scholar
  38. 38.
    Emerson, E.A., Namjoshi, K.S.: On model checking for non-deterministic infinite-state systems. In: Thirteenth Annual IEEE Symposium on Logic in Computer Science, Indianapolis, Indiana, USA, 21–24 June, 1998, pp. 70–80. IEEE Computer Society, Los Alamitos (1998)Google Scholar
  39. 39.
    Emerson, E.A., Kahlon, V.: Parameterized model checking of ring-based message passing systems. In: CSL 2004, pp. 325–339 (2004)Google Scholar
  40. 40.
    Esparza, J., Finkel, A., Mayr, R.: On the verification of broadcast protocols. In: 14th Annual IEEE Symposium on Logic in Computer Science, Trento, Italy, 2–5 July, 1999, pp. 352–359. IEEE Computer Society, Washington (1999)Google Scholar
  41. 41.
    Finkel, A., Leroux, J.: Recent and simple algorithms for petri nets. Softw. Syst. Model. 14(2), 719–725 (2015)CrossRefGoogle Scholar
  42. 42.
    Finkel, A., McKenzie, P., Picaronny, C.: A well-structured framework for analysing petri net extensions. Inf. Comput. 195(1–2), 1–29 (2004)MathSciNetCrossRefzbMATHGoogle Scholar
  43. 43.
    Finkel, A., Schnoebelen, Ph: Well-structured transition systems everywhere!. Theor. Comput. Sci. 256(1–2), 63–92 (2001)MathSciNetCrossRefzbMATHGoogle Scholar
  44. 44.
    Ganty, P., Raskin, J.-F., Van Begin, L.: From many places to few: automatic abstraction refinement for petri nets. Fundam. Inform. 88(3), 275–305 (2008)MathSciNetzbMATHGoogle Scholar
  45. 45.
    Geeraerts, G., Raskin, J.-F., Van Begin, L.: Expand, enlarge and check: new algorithms for the coverability problem of WSTS. J. Comput. Syst. Sci. 72(1), 180–203 (2006)MathSciNetCrossRefzbMATHGoogle Scholar
  46. 46.
    German, S.M., Sistla, A.P.: Reasoning about systems with many processes. J. ACM 39(3), 675–735 (1992)MathSciNetCrossRefzbMATHGoogle Scholar
  47. 47.
    Ghilardi, S., Ranise, S.: Backward reachability of array-based systems by SMT solving: termination and invariant synthesis. Log. Methods Comput. Sci. 6(4) (2010)Google Scholar
  48. 48.
    Henriksen, J.G., Jensen, J.L., Jørgensen, M.E., Klarlund, N., Paige, R., Rauhe, T., Sandholm, A.: Mona: Monadic second-order logic in practice. In: Tools and Algorithms for Construction and Analysis of Systems, First International Workshop, TACAS ’95, Aarhus, Denmark, May 19–20, 1995, Proceedings, pp. 89–110 (1995)Google Scholar
  49. 49.
    Jensen, J.L., Jørgensen, M.E., Klarlund, N.: Monadic second-order logic for parameterized verification. Technical report, BRICS RS-94-10 (1994)Google Scholar
  50. 50.
    Kaiser, A., Kroening, D., Wahl, T.: Lost in abstraction: monotonicity in multi-threaded programs. In: CONCUR 2014—Concurrency Theory—25th International Conference, CONCUR 2014, Rome, Italy, September 2–5, 2014. Proceedings, pp. 141–155 (2014)Google Scholar
  51. 51.
    Kaiser, A., Kroening, D., Wahl, T.: A widening approach to multithreaded program verification. ACM Trans. Program. Lang. Syst. 36(4):14:1–14:29 (2014)Google Scholar
  52. 52.
    Kesten, Y., Maler, O., Marcus, M., Pnueli, A., Shahar, E.: Symbolic model checking with rich assertional languages. Theor. Comput. Sci. 256(1–2), 93–112 (2001)MathSciNetCrossRefzbMATHGoogle Scholar
  53. 53.
    Kloos, J., Majumdar, R., Niksic, F., Piskac, R.: Incremental, inductive coverability. In: Computer Aided Verification—25th International Conference, CAV 2013, Saint Petersburg, Russia, July 13–19, 2013. Proceedings, pp. 158–173 (2013)Google Scholar
  54. 54.
    Lazic, R., Newcomb, T., Ouaknine, J., Roscoe, A.W., Worrell, J.: Nets with tokens which carry data. Fundam. Inform. 88(3), 251–274 (2008)MathSciNetzbMATHGoogle Scholar
  55. 55.
    Lisitsa, A.: Finite reasons for safety—parameterized verification by finite model finding. J. Autom. Reason. 51(4), 431–451 (2013)MathSciNetCrossRefzbMATHGoogle Scholar
  56. 56.
    Margaria, T.: Fully automatic verification and error detection for parameterized iterative sequential circuits. In: Tools and Algorithms for Construction and Analysis of Systems, Second International Workshop, TACAS ’96, Passau, Germany, March 27–29, 1996, Proceedings, pp. 258–277 (1996)Google Scholar
  57. 57.
    McMillan, K.L.: Parameterized verification of the FLASH cache coherence protocol by compositional model checking. In: Correct Hardware Design and Verification Methods, 11th IFIP WG 10.5 Advanced Research Working Conference, CHARME 2001, Livingston, Scotland, UK, September 4–7, 2001, Proceedings, pp. 179–195 (2001)Google Scholar
  58. 58.
    Meyer, R.: On boundedness in depth in the pi-calculus. IFIP TCS 2008, 477–489 (2008)MathSciNetGoogle Scholar
  59. 59.
    Pnueli, A., Xu, J., Zuck, L.D.: Liveness with (0, 1, infty)-counter abstraction. In: Computer Aided Verification, 14th International Conference, CAV 2002,Copenhagen, Denmark, July 27–31, 2002, Proceedings, pp. 107–122 (2002)Google Scholar
  60. 60.
    Ranise, S., Truong, A., Traverso, R.: Parameterized model checking for security policy analysis. Int. J. Softw. Tools Technol. Transf. (2016). doi: 10.1007/s10009-015-0410-1 (In this special issue)
  61. 61.
    Ganjei, Z., Rezine, A., Enes, I.P., Peng, Z.: Counting dynamically synchronizing processes. Int. J. Softw. Tools Technol. Transf. (2016). doi: 10.1007/s10009-015-0411-0 (In this special issue)
  62. 62.
    Rosa-Velardo, F., de Frutos-Escrig, D.: Decidability results for restricted models of petri nets with name creation and replication. In: Applications and Theory of Petri Nets, 30th International Conference, PETRI NETS 2009, Paris, France, 22–26 June, 2009. Proceedings. Lecture Notes in Computer Science, vol. 5606, pp. 63–82. Springer, Berlin (2009)Google Scholar
  63. 63.
    Rosa-Velardo, F., de Frutos-Escrig, D.: Decidability and complexity of petri nets with unordered data. Theor. Comput. Sci. 412(34), 4439–4451 (2011)MathSciNetCrossRefzbMATHGoogle Scholar
  64. 64.
    Schnoebelen, P.: Revisiting Ackermann-hardness for lossy counter machines and reset petri nets. In: Mathematical Foundations of Computer Science 2010, 35th International Symposium, MFCS 2010, Brno, Czech Republic, 23–27 August, 2010. Proceedings. Lecture Notes in Computer Science, vol. 6281, pp. 616–628, Springer, Berlin (2010)Google Scholar
  65. 65.
    Thayer, F.J., Herzog, J.C., Guttman, J.D.: Strand spaces: proving security protocols correct. J. Comput. Secur. 7(1), 191–230 (1999)CrossRefGoogle Scholar
  66. 66.
    Zavattaro, G.: When to move to transfer nets—on the limits of petri nets as models for process calculi. In: Programming Languages with Applications to Biology and Security—Essays Dedicated to Pierpaolo Degano on the Occasion of His 65th Birthday, pp. 339–353 (2015)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2016

Authors and Affiliations

  1. 1.Uppsala UniversityUppsalaSweden
  2. 2.DIBRISUniversità di GenovaGenovaItaly

Personalised recommendations