Skip to main content


Empirical study towards a leading indicator for cost of formal software verification


Daniel Matichuk, Toby Murray, June Andronick, Ross Jeffery, Gerwin Klein and Mark Staples




Formal verification can provide the highest degree of software assurance. Demand for it is growing, but there are still few projects that have successfully applied it to sizeable, real-world systems. This lack of experience makes it hard to predict the size, effort and duration of verification projects. In this paper, we aim to better understand possible leading indicators of proof size. We present an empirical analysis of proofs from the landmark formal verification of the seL4 microkernel and the two largest software verification proof developments in the Archive of Formal Proofs. Together, these comprise 15,018 individual lemmas and approximately 215,000 lines of proof script. We find a consistent quadratic relationship between the size of the formal statement of a property, and the final size of its formal proof in the interactive theorem prover Isabelle. Combined with our prior work, which has indicated that there is a strong linear relationship between proof effort and proof size, these results pave the way for effort estimation models to support the management of large- scale formal verification projects.

BibTeX Entry

    author           = {Matichuk, Daniel and Murray, Toby and Andronick, June and Jeffery, Ross and Klein, Gerwin and
                        Staples, Mark},
    month            = feb,
    year             = {2015},
    title            = {Empirical Study Towards a Leading Indicator for Cost of Formal Software Verification},
    booktitle        = {International Conference on Software Engineering},
    pages            = {11},
    address          = {Firenze, Italy}


Served by Apache on Linux on seL4.
Served by Apache on Linux on seL4.