liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Formal Verification of Random Forests in Safety-Critical Applications
Linköping University, Department of Computer and Information Science, Software and Systems. Linköping University, Faculty of Science & Engineering. (Real-Time Systems Laboratory)
Linköping University, Department of Computer and Information Science, Software and Systems. Linköping University, Faculty of Science & Engineering. (Real-Time Systems Laboratory)ORCID iD: 0000-0002-1485-0802
2019 (English)In: Formal Techniques for Safety-Critical Systems, Springer, 2019, p. 55-71Conference paper, Published paper (Refereed)
Abstract [en]

Recent advances in machine learning and artificial intelligence are now being applied in safety-critical autonomous systems where software defects may cause severe harm to humans and the environment. Design organizations in these domains are currently unable to provide convincing arguments that systems using complex software implemented using machine learning algorithms are safe and correct.

In this paper, we present an efficient method to extract equivalence classes from decision trees and random forests, and to formally verify that their input/output mappings comply with requirements. We implement the method in our tool VoRF (Verifier of Random Forests), and evaluate its scalability on two case studies found in the literature. We demonstrate that our method is practical for random forests trained on low-dimensional data with up to 25 decision trees, each with a tree depth of 20. Our work also demonstrates the limitations of the method with high-dimensional data and touches upon the trade-off between large number of trees and time taken for verification.

Place, publisher, year, edition, pages
Springer, 2019. p. 55-71
Series
Communications in Computer and Information Science, ISSN 1865-0929 ; 008
Keywords [en]
Machine learning, Formal verification, Random forest, Decision tree
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:liu:diva-154368DOI: 10.1007/978-3-030-12988-0_4ISBN: 978-3-030-12987-3 (print)ISBN: 978-3-030-12988-0 (electronic)OAI: oai:DiVA.org:liu-154368DiVA, id: diva2:1286783
Conference
Sixth International Workshop on Formal Techniques for Safety-Critical Systems (FTSCS 2018), Gold Coast, Australia, 16 November, 2018
Funder
Wallenberg AI, Autonomous Systems and Software Program (WASP)Available from: 2019-02-07 Created: 2019-02-07 Last updated: 2019-02-15Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full text

Authority records BETA

Törnblom, JohnNadjm-Tehrani, Simin

Search in DiVA

By author/editor
Törnblom, JohnNadjm-Tehrani, Simin
By organisation
Software and SystemsFaculty of Science & Engineering
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 69 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf