Automated discovery of specifications for heap-manipulating programs is a challenging task due to the complexity of aliasing and mutability of data structures. This task is further complicated by an expressive domain that combines shape, numerical and bag information. In this paper, we propose a compositional analysis framework in the presence of user-defined predicates, which would derive the summary for each method in the expressive abstract domain, independently from its callers. We propose a novel abstraction method with a bi-abduction technique in the combined domain to discover pre-/post-conditions that could not be automatically inferred before. The analysis does not only prove the memory safety properties, but also finds relationships between pure and shape domains towards full functional correctness of programs. A prototype of the framework has been implemented and initial experiments have shown that our approach can discover interesting properties for non-trivial programs.
|Title of host publication||Lecture Notes in Computer Science|
|Publication status||Published - 2013|
|Name||Formal Methods and Software Engineering|
Bibliographical noteSubject to 12 month embargo author can archive post-print (ie final draft post-refereeing).
He, G., Qin, S., Chin, W-N., & Craciun, F. (2013). Automated Specification Discovery via User-Defined Predicates. In Lecture Notes in Computer Science (Vol. 8144, pp. 397-414). [Chapter 26] (Formal Methods and Software Engineering; Vol. 8144). https://doi.org/10.1007/978-3-642-41202-8_26