A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
Result Certification of Static Program Analysers with Automated Theorem Provers
[chapter]
2014
Lecture Notes in Computer Science
The automation of the deductive approach to program verification crucially depends on the ability to efficiently infer and discharge program invariants. In an ideal world, user-provided invariants would be strengthened by incorporating the result of static analysers as untrusted annotations and discharged by automated theorem provers. However, the results of object-oriented analyses are heavily quantified and cannot be discharged, within reasonable time limits, by state-of-the-art automated
doi:10.1007/978-3-642-54108-7_16
fatcat:66itrrnsgvghrdmedy3umlt24e