Towards Scalable Modular Checking of User-Defined Properties

Download PDF
Open Webpage

Thomas Ball, Brian Hackett, Shuvendu K. Lahiri, Shaz Qadeer, Julien Vanegue

Published: 2010, Last Modified: 07 Jan 2026VSTTE 2010EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: Theorem-prover based modular checkers have the potential to perform scalable and precise checking of user-defined properties by combining pathsensitive intraprocedural reasoning with user-defined procedure abstractions. However, such tools have seldom been deployed on large software applications of industrial relevance due to the annotation burden required to provide the procedure abstractions.