Predicting SMT solver performance for software verification

11Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

Abstract

The Why3 IDE and verification system facilitates the use of a wide range of Satisfiability Modulo Theories (SMT) solvers through a driver-based architecture. We present Where4: a portfolio-based approach to discharge Why3 proof obligations. We use data analysis and machine learning techniques on static metrics derived from program source code. Our approach benefits software engineers by providing a single utility to delegate proof obligations to the solvers most likely to return a useful result. It does this in a time-efficient way using existing Why3 and solver installations - without requiring low-level knowledge about SMT solver operation from the user.

Cite

CITATION STYLE

APA

Healy, A., Monahan, R., & Power, J. F. (2017). Predicting SMT solver performance for software verification. In Electronic Proceedings in Theoretical Computer Science, EPTCS (Vol. 240, pp. 20–37). Open Publishing Association. https://doi.org/10.4204/EPTCS.240.2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free