Skip to main content
SpringerLink
Log in

From Verification to Explanation (Track Introduction)

  • Conference paper
  • First Online:
Leveraging Applications of Formal Methods, Verification and Validation: Tools and Trends (ISoLA 2020)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 12479))

Included in the following conference series:

  • 661 Accesses

Abstract

It is becoming the norm that software artefacts participate in actions and decisions that affect humans. This trend has been catching momentum for decades, and is now amplified considerably by the remarkable abilities of machine-learnt methods.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Erika Ábrahám, Bernd Becker, Christian Dehnert, Nils Jansen, Joost-Pieter Katoen, and Ralf Wimmer. Counterexample generation for discrete-time markov models: An introductory survey. In Marco Bernardo, Ferruccio Damiani, Reiner Hähnle, Einar Broch Johnsen, and Ina Schaefer, editors, Formal Methods for Executable Software Models - 14th International School on Formal Methods for the Design of Computer, Communication, and Software Systems (SFM), volume 8483 of Lecture Notes in Computer Science, pages 65–121. Springer, 2014.

    Google Scholar 

  2. Ilan Beer, Shoham Ben-David, Hana Chockler, Avigail Orni, and Richard J. Trefler. Explaining counterexamples using causality. Formal Methods in System Design, 40(1):20–40, 2012.

    Google Scholar 

  3. Ilan Beer, Shoham Ben-David, Cindy Eisner, and Yoav Rodeh. Efficient detection of vacuity in temporal model checking. Formal Methods in System Design, 18(2):141–163, 2001.

    Google Scholar 

  4. Shoham Ben-David, Hana Chockler, and Orna Kupferman. Attention-based coverage metrics. In 9th Int. Haifa Verification Conf. on Hardware and Software: Verification and Testing (HVC), volume 8244 of LNCS, pages 230–245. Springer, 2013.

    Google Scholar 

  5. Shoham Ben-David, Fady Copty, Dana Fisman, and Sitvanit Ruah. Vacuity in practice: temporal antecedent failure. Formal Methods in System Design, 46(1):81–104, 2015.

    Google Scholar 

  6. Georgiana Caltais, Stefan Leue, and Mohammad Reza Mousavi. (de-)composing causality in labeled transition systems. In First Workshop on Causal Reasoning for Embedded and safety-critical Systems Technologies, volume 224 of EPTCS, pages 10–24, 2016.

    Google Scholar 

  7. Hana Chockler, Norman E. Fenton, Jeroen Keppens, and David A. Lagnado. Causal analysis for attributing responsibility in legal cases. In 15th Int. Conf. on Artificial Intelligence and Law ICAIL), pages 33–42. ACM, 2015.

    Google Scholar 

  8. Hana Chockler and Joseph Y. Halpern. Responsibility and blame: A structural-model approach. Journal of Artificial Intelligence Research (JAIR), 22:93–115, 2004.

    Google Scholar 

  9. Hana Chockler, Joseph Y. Halpern, and Orna Kupferman. What causes a system to satisfy a specification? ACM Transactions on Computational Logic, 9(3), 2008.

    Google Scholar 

  10. Jörg Desel, Andreas Oberweis, Torsten Zimmer, and Gabriele Zimmermann. Validation of information system models: Petri nets and test case generation. In IEEE Int. Conf. on Cybernetics and Simulation, pages 3401–3406, 1997.

    Google Scholar 

  11. J.B. Dugan, S.J. Bavuso, and M.A. Boyd. Dyanamic fault-tree models for fault-tolerant computer systems. IEEE Transactions on Reliability, 41(3):363–377, 1992.

    Google Scholar 

  12. Thomas Eiter and Thomas Lukasiewicz. Causes and explanations in the structural-model approach: Tractable cases. Artifical Intelligence, 170(6-7):542–580, 2006.

    Google Scholar 

  13. Javier Esparza, Peter Lammich, René Neumann, Tobias Nipkow, Alexander Schimpf, and Jan-Georg Smaus. A fully verified executable LTL model checker. Archive of Formal Proofs, 2014.

    Google Scholar 

  14. Lu Feng, Mahsa Ghasemi, Kai-Wei Chang, and Ufuk Topcu. Counterexamples for robotic planning explained in structured language. CoRR, arXiv:1803.08966åå, 2018. To appear in IEEE Int. Conf. on Robotics and Automation (ICRA’18).

    Google Scholar 

  15. Bernd Finkbeiner, Manuel Gieseking, and Ernst-Rüdiger Olderog. Adam: Causality-based synthesis of distributed systems. In 27th Int. Conf. on Computer Aided Verification (CAV), volume 9206 of LNCS, pages 433–439. Springer, 2015.

    Google Scholar 

  16. Florian Funke, Simon Jantsch, and Christel Baier. Farkas certificates and minimal witnesses for probabilistic reachability constraints. In Armin Biere and David Parker, editors, 26th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), volume 12078 of Lecture Notes in Computer Science, pages 324–345. Springer, 2020.

    Google Scholar 

  17. Alex Groce. Error explanation with distance metrics. In 10th Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), volume 2988 of LNCS, pages 108–122. Springer, 2004.

    Google Scholar 

  18. Alex Groce, Daniel Kroening, and Flavio Lerda. Understanding counterexamples with explain. In 16th Int. Conf. on Computer Aided Verification (CAV), volume 3114 of LNCS, pages 453–456. Springer, 2004.

    Google Scholar 

  19. Timo P. Gros, David Groß, Stefan Gumhold, Jörg Hoffmann, Michaela Klauck, and Marcel Steinmetz. Tracevis: Towards visualization for deep statistical model checking. in this volume.

    Google Scholar 

  20. Axel Habermaier, Alexander Knapp, Johannes Leupolz, and Wolfgang Reif. Fault-aware modeling and specification for efficient formal safety analysis. In Critical Systems: Formal Methods and Automated Verification (FMICS-AVoCS), volume 9933 of LNCS, pages 97–114. Springer, 2016.

    Google Scholar 

  21. Nils Jansen. Counterexamples in probabilistic verification. PhD thesis, RWTH Aachen University, Germany, 2015.

    Google Scholar 

  22. Simon Jantsch, Florian Funke, and Christel Baier. Minimal witnesses for probabilistic timed automata. In Dang Van Hung and Oleg Sokolsky, editors, 18th International Symposium on Automated Technology for Verification and Analysis (ATVA), volume 12302 of Lecture Notes in Computer Science, pages 501–517. Springer, 2020.

    Google Scholar 

  23. Simon Jantsch, Hans Harder, Florian Funke, and Christel Baier. SWITSS: computing small witnessing subsystems. In Alexander Ivrii and Ofer Strichman, editors, 20th Conference on Formal Methods in Computer-Aided Design (FMCAD). Academic Press TU Wien, 2020.

    Google Scholar 

  24. Jacques-Henri Jourdan, Vincent Laporte, Sandrine Blazy, Xavier Leroy, and David Pichardie. A formally-verified C static analyzer. In 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL), pages 247–259. ACM, 2015.

    Google Scholar 

  25. Martin Kölbl and Stefan Leue. An algorithm to compute a strict partial ordering of actions in action trees. in this volume.

    Google Scholar 

  26. Matthias Kuntz, Florian Leitner-Fischer, and Stefan Leue. From probabilistic counterexamples via causality to fault trees. In 30th Int. Conf. on Computer Safety, Reliability, and Security, volume 6894 of LNCS, pages 71–84. Springer, 2011.

    Google Scholar 

  27. Orna Kupferman and Moshe Y. Vardi. Vacuity detection in temporal model checking. In 10th IFIP WG 10.5 Advanced Research Working Conf. on Correct Hardware Design and Verification Methods (CHARME), volume 1703 of LNCS, pages 82–96. Springer, 1999.

    Google Scholar 

  28. Orna Kupferman and Moshe Y. Vardi. From complementation to certification. Theoretical Computer Science, 345(1):83–100, 2005.

    Google Scholar 

  29. Andrey Kupriyanov and Bernd Finkbeiner. Causality-based verification of multi-threaded programs. In 24th Int. Conf. on Concurrency Theory (CONCUR), volume 8052 of LNCS, pages 257–272. Springer, 2013.

    Google Scholar 

  30. Andrey Kupriyanov and Bernd Finkbeiner. Causal termination of multi-threaded programs. In 26th Int. Conf. on Computer Aided Verification (CAV), volume 8559 of LNCS, pages 814–830, 2014.

    Google Scholar 

  31. Florian Leitner-Fischer. Causality Checking of Safety-Critical Software and Systems. PhD thesis, University of Konstanz, Germany, 2015.

    Google Scholar 

  32. Florian Leitner-Fischer and Stefan Leue. Causality checking for complex system models. In 14th Int. Conf. on Verification, Model Checking, and Abstract Interpretation (VMCAI), volume 7737 of LNCS, pages 248–267. Springer, 2013.

    Google Scholar 

  33. Florian Leitner-Fischer and Stefan Leue. On the synergy of probabilistic causality computation and causality checking. In 20th Int. Symp. on Model Checking Software (SPIN), volume 7976 of LNCS, pages 246–263. Springer, 2013.

    Google Scholar 

  34. Florian Leitner-Fischer and Stefan Leue. Probabilistic fault tree synthesis using causality computation. Int. Journal of Critical Computer-Based Systems, 4(2):119–143, 2013.

    Google Scholar 

  35. Glenford J. Myers. The Art of Software Testing. John Wiley & Sons, 1979.

    Google Scholar 

  36. F. Ortmeier, W. Reif, and G. Schellhorn. Formal safety analysis of a radio-based railroad crossing using deductive cause-consequence analysis. In 5th European Dependable Computing Conf. (EDCC), volume 3463 of LNCS. Springer, 2006.

    Google Scholar 

  37. Judea Pearl. Causality: Models, Reasoning and Inference. Cambridge University Press, 2nd edition, 2009.

    Google Scholar 

  38. Ali Taleghani. Using Software Model Checking for Software Certification. PhD thesis, University of Waterloo, Ontario, Canada, 2010.

    Google Scholar 

  39. W.E. Vasely and F.F. Goldberg. Fault Tree Handbook. US Nuclear Regulatory Commission, 2014. NUREG-0492.

    Google Scholar 

  40. Ralf Wimmer, Nils Jansen, Erika Ábrahám, Joost-Pieter Katoen, and Bernd Becker. Minimal counterexamples for linear-time probabilistic verification. Theoretical Computer Science, 549:61–100, 2014.

    Google Scholar 

  41. Ralf Wimmer, Nils Jansen, Andreas Vorpahl, Erika Ábrahám, Joost-Pieter Katoen, and Bernd Becker. High-level counterexamples for probabilistic automata. Logical Methods in Computer Science, 11(1), 2015.

    Google Scholar 

  42. Simon Wimmer, Frédéric Herbreteau, and Jaco van de Pol. Certifying emptiness of timed büchi automata. In Nathalie Bertrand and Nils Jansen, editors, 18th International Conference on Formal Modeling and Analysis of Timed Systems (FORMATS), volume 12288 of Lecture Notes in Computer Science, pages 58–75. Springer, 2020.

    Google Scholar 

  43. Simon Wimmer and Joshua von Mutius. Verified certification of reachability checking for timed automata. In Armin Biere and David Parker, editors, 26th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), volume 12078 of Lecture Notes in Computer Science, pages 425–443. Springer, 2020.

    Google Scholar 

Download references

Acknowledgments

This initiative would not have been possible without the support by the Deutsche Forschungsgemeinschaft for the Center for Perspicuous Computing (TRR 248, Grant 389792660). It furthermore has received support by the Key-Area Research and Development Program Grant 2018B010107004 of Guangdong Province.

Author information

Authors and Affiliations

  1. Technische Universität Dresden, Saarbrücken, Germany

    Christel Baier

  2. Universität des Saarlandes, Saarland Informatics Campus, Dresden, Germany

    Holger Hermanns

  3. Institute of Intelligent Software, Guangzhou, China

    Holger Hermanns

Authors
  1. Christel Baier
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Holger Hermanns
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Limerick and Lero, Limerick, Ireland

    Tiziana Margaria

  2. TU Dortmund, Dortmund, Germany

    Bernhard Steffen

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Baier, C., Hermanns, H. (2021). From Verification to Explanation (Track Introduction). In: Margaria, T., Steffen, B. (eds) Leveraging Applications of Formal Methods, Verification and Validation: Tools and Trends. ISoLA 2020. Lecture Notes in Computer Science(), vol 12479. Springer, Cham. https://doi.org/10.1007/978-3-030-83723-5_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-83723-5_1

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-83722-8

  • Online ISBN: 978-3-030-83723-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation