Recent advances in interactive and automated analysis

Introduction
  • 41 Downloads

Abstract

Computers and distributed software applications are becoming nowadays ubiquitous, and therefore their safety and reliability have increasingly important societal impact. In this context, formal methods equipped with powerful and versatile analysis tools are more important than ever in the design process. Despite the relevant scientific results and well-established tools obtained in recent years, there is a constant need of enhancing the analysis capabilities in order to handle increasingly complex systems. We briefly discuss some recent advances in the field, introducing five papers selected from the 22th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2016).

Keywords

Interactive theorem proving Parallel algorithms Equivalence checking Probabilistic and stochastic systems 

References

  1. 1.
    Giunchiglia, F., Traverso, P.: Theorem proving in technology transfer: the user’s point of view. Int. J. Softw. Tools Technol. Transf. 3(1), 1–12 (2000)CrossRefMATHGoogle Scholar
  2. 2.
    Aspinall, D.: Proof general: a generic tool for proof development. In: Proceedings of the 6th International Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS’00). Lecture Notes in Computer Science, vol. 1785, pp. 38–42. Springer, Berlin (2000)Google Scholar
  3. 3.
    Aspinall, D., Denney, E., Lüth, C.: A tactic language for hiproofs. In: Proceedings of the 9th International Conference on Intelligent Computer Mathematics (AISC’08). Lecture Notes in Computer Science, vol. 5144, pp. 339–354. Springer, Berlin (2008)Google Scholar
  4. 4.
    Baier, C., Katoen, J.-P.: Principles of Model Checking. MIT Press, Cambridge (2008)MATHGoogle Scholar
  5. 5.
    Bertot, Y., Castéran, P.: Interactive Theorem Proving and Program Development—Coq’Art: The Calculus of Inductive Constructions. Springer, Berlin (2004)CrossRefMATHGoogle Scholar
  6. 6.
    Beyer, S., Jacobi, C., Kröning, D., Leinenbach, D., Paul, W.-J.: Putting it all together—formal verification of the VAMP. Int. J. Softw. Tools Technol. Transf. 8(4–5), 411–430 (2006)CrossRefGoogle Scholar
  7. 7.
    Blom, S., Orzan, S.: A distributed algorithm for strong bisimulation reduction of state spaces. Int. J. Softw. Tools Technol. Transf. 7(1), 74–86 (2005)CrossRefMATHGoogle Scholar
  8. 8.
    Blom, S., van de Pol, J.: Distributed branching bisimulation minimization by inductive signatures. In: Proceedings of the 8th International Workshop on Parallel and Distributed Methods in verifiCation (PDMC’09). EPCTS vol. 14, pp. 32–46 (2009)Google Scholar
  9. 9.
    Boldo, S., Jourdan, J.-H., Leroy, X., Melquiond, G.: A formally-verified C compiler supporting floating-point arithmetic. In: Proceedings of the 21st IEEE Symposium on Computer Arithmetic (ARITH’13), pp. 107–115. IEEE (2013)Google Scholar
  10. 10.
    Brucker, A.D., Wolff, B.: A verification approach to applied system security. Int. J. Softw. Tools Technol. Transf. 7(3), 233–247 (2005)CrossRefGoogle Scholar
  11. 11.
    Chechik, M., Raskin J.-F. (eds.): Proceedings of the 22nd International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS’16). Lecture Notes in Computer Science, vol. 9636. Springer, Berlin (2016)Google Scholar
  12. 12.
    Cleaveland, R., Sokolsky, O.: Equivalence and preorder checking for finite-state systems. In: Bergstra, J.A., Ponse, A., Smolka S.A. (eds.) Handbook of Process Algebra, pp. 391–424. Elsevier, Amsterdam (2001)Google Scholar
  13. 13.
    Dehnert, C., Junges, S., Katoen, J.-P., Volk, M.: A storm is coming: a modern probabilistic model checker. In: Proceedings of the 29th International Conference on Computer Aided Verification (CAV’17). Lecture Notes in Computer Science, vol. 10427, pp. 592–600. Springer, Berlin (2017)Google Scholar
  14. 14.
    Delahaye, D.: A tactic language for the system Coq. In: Proceedings of the 7th International Conference on Logic for Programming and Automated Reasoning (LPAR’00), Lecture Notes in Computer Science, vol. 1955, pp. 85–95. Springer, Berlin (2000)Google Scholar
  15. 15.
    Faithfull, A., Bengtson, J., Tassi, E., Tankink, C.: Coqoon—an IDE for interactive proof development in Coq. In: Proceedings of the 22nd International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS’16). Lecture Notes in Computer Science, vol. 9636, pp. 316–331. Springer, Berlin (2016)Google Scholar
  16. 16.
    Faithfull, A., Bengtson, J., Tassi, E., Tankink, C.: Coqoon—an IDE for interactive proof development in Coq. Int. J. Softw. Tools Technol. Transf. (2017). https://doi.org/10.1007/s10009-017-0457-2
  17. 17.
    Ferreira, J.-F., Gherghina, C., He, G., Qin, S., Chin, W.-N.: Automated verification of the freeRTOS scheduler in Hip/Sleek. Int. J. Softw. Tools Technol. Transf. 16(4), 381–397 (2014)CrossRefGoogle Scholar
  18. 18.
    Garavel, H., Mateescu, M., Serwe, W.: Large-scale distributed verification using CADP: beyond clusters to grids. In: Proceedings of the 11th International Workshop on Parallel and Distributed Methods in verifiCation (PDMC’12). ENTCS, vol. 296, pp. 145–161. Elsevier (2013)Google Scholar
  19. 19.
    Garavel, H., Mateescu, R., Smarandache, I.: Parallel state space construction for model-checking. In: Proceedings of the 8th International SPIN Workshop on Model Checking of Software (SPIN’01). Lecture Notes in Computer Science, vol. 2057, pp. 217–234. Springer, Berlin (2001)Google Scholar
  20. 20.
    Gonthier, G.: The four colour theorem: engineering of a formal proof. In: Proceedings of the 8th Asian Symposium on Computer Mathematics (ASCM’07). Lecture Notes in Computer Science, vol. 5081, pp. 333. Springer, Berlin (2007)Google Scholar
  21. 21.
    Gonthier, G., Asperti, A., Avigad, J., Bertot, Y., Cohen, C., Garillot, F., Le Roux, S., Mahboubi, A., O’Connor, R., Biha, S.-O., Pasca, I., Rideau, L., Solovyev, A., Tassi, E., Théry, L.: A machine-checked proof of the odd order theorem. In: Proceedings of the 4th International Conference on Interactive Theorem Proving (ITP’13). Lecture Notes in Computer Science, vol. 7998, pp. 163–179. Springer, Berlin (2013)Google Scholar
  22. 22.
    Grov, G., Lin, Y.: The Tinker tool for graphical tactic development. Int. J. Softw. Tools Technol. Transf. (2017). https://doi.org/10.1007/s10009-017-0452-7
  23. 23.
    Holzmann, G.J.: Parallelizing the SPIN model checker. In: Proceedings of the 19th International Workshop on Model Checking Software (SPIN’12). Lecture Notes in Computer Science, vol. 7385, pp. 155–171. Springer, Berlin (2012)Google Scholar
  24. 24.
    Holzmann, G.J., Bosnacki, D.: The design of a multicore extension of the SPIN model checker. IEEE Trans. Softw. Eng. 33(10), 659–674 (2007)CrossRefGoogle Scholar
  25. 25.
    Klein, J., Baier, C., Chrszon, P., Daum, M., Dubslaff, C., Klüppelholz, S., Märcker, S., Müller, D.: Advances in symbolic probabilistic model checking with PRISM. In: Proceedings of the 22nd International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS’16). Lecture Notes in Computer Science, vol. 9636, pp. 349–366. Springer, Berlin (2016)Google Scholar
  26. 26.
    Klein, J., Baier, C., Chrszon, P., Daum, M., Dubslaff, C., Klüppelholz, S., Märcker, S., Müller, D.: Advances in probabilistic model checking with PRISM: variable reordering, quantiles and weak deterministic Büchi automata. Int. J. Softw. Tools Technol. Transf. (2017). https://doi.org/10.1007/s10009-017-0456-3
  27. 27.
    Kwiatkowska, M., Norman, G., Parker, D.: PRISM 4.0: verification of probabilistic real-time systems. In: Proceedings of the 23rd International Conference on Computer Aided Verification (CAV’11). Lecture Notes in Computer Science, vol. 6806, pp. 585–591. Springer, Berlin (2011)Google Scholar
  28. 28.
    Kwiatkowska, M., Parker, D., Wiltsche, C.: PRISM-games 2.0: a tool for multi-objective strategy synthesis for stochastic games. In: Proceedings of the 22nd International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS’16). Lecture Notes in Computer Science, vol. 9636, pp. 560–566. Springer, Berlin (2016)Google Scholar
  29. 29.
    Kwiatkowska, M., Parker, D., Wiltsche, C.: PRISM-games: verification and strategy synthesis for stochastic multi-player games with multiple objectives. Int. J. Softw. Tools Technol. Transf. (2017). https://doi.org/10.1007/s10009-017-0476-z
  30. 30.
    Li, W., Paulson, L.-C.: A formal proof of Cauchy’s residue theorem. In: Proceedings of the 7th International Conference on Interactive Theorem Proving (ITP’16). Lecture Notes in Computer Science, vol. 9807, pp. 235–251. Springer, Berlin (2016)Google Scholar
  31. 31.
    Lin, Y., Le Bras, P., Grov, G.: Developing and debugging proof strategies by tinkering. In: Proceedings of the 22nd International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS’16). Lecture Notes in Computer Science, vol. 9636, pp. 573–579. Springer, Berlin (2016)Google Scholar
  32. 32.
    Nipkow, T., Paulson, L.C., Wenzel, M.: Isabelle/HOL—A Proof Assistant for Higher-Order Logic. Lecture Notes in Computer Science, vol. 2283. Springer, Berlin (2002)MATHGoogle Scholar
  33. 33.
    Owre, S., Rushby, J.M., Shankar, N.: PVS: a prototype verification system. In: Proceedings of the 11th International Conference on Automated Deduction (CADE’92). Lecture Notes in Computer Science, vol. 607, pp. 748–752. Springer, Berlin (1992)Google Scholar
  34. 34.
    Rajasekaran, S., Lee, I.: Parallel algorithms for relational coarsest partition problems. IEEE Trans. Parallel Distrib. Syst. 9(7), 687–699 (1998)CrossRefGoogle Scholar
  35. 35.
    Renault, E., Duret-Lutz, A., Kordon, K., Poitrenaud, D.: Parallel explicit model checking for generalized Büchi automata. In: Proceedings of the 21st International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS’15). Lecture Notes in Computer Science, vol. 9035, pp. 613–627. Springer, Berlin (2015)Google Scholar
  36. 36.
    Stern, U., Dill, D.L.: Parallelizing the Murphi verifier. Form. Methods Syst. Des. 18(2), 117–129 (2001)CrossRefMATHGoogle Scholar
  37. 37.
    van Dijk, T., van de Pol, J.: Sylvan: multi-core decision diagrams. In: Proceedings of the 21st International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS’15). Lecture Notes in Computer Science, vol. 9035, pp. 677–691. Springer, Berlin (2015)Google Scholar
  38. 38.
    van Dijk, T., van de Pol, J.: Multi-core symbolic bisimulation minimisation. In: Proceedings of the 22nd International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS’16). Lecture Notes in Computer Science, vol. 9636, pp. 332–348. Springer, Berlin (2016)Google Scholar
  39. 39.
    van Dijk, T., van de Pol, J.: Multi-core symbolic bisimulation minimisation. Int. J. Softw. Tools Technol. Transf. (2017). https://doi.org/10.1007/s10009-017-0468-z
  40. 40.
    Wijs, A.: Towards informed swarm verification. In: Proceedings of the 3rd International Symposium on NASA Formal Methods (NFM’11). Lecture Notes in Computer Science, vol. 6617, pp. 422–437. Springer, Berlin (2011)Google Scholar

Copyright information

© Springer-Verlag GmbH Germany 2017

Authors and Affiliations

  1. 1.Univ. Grenoble Alpes, Inria, CNRS, Grenoble INP, LIGGrenobleFrance

Personalised recommendations