Verifying Low-Level Implementations of High-Level Datatypes

Conway, Christopher L.; Barrett, Clark

doi:10.1007/978-3-642-14295-6_28

Cited by 2 publications

(1 citation statement)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Large-scale verification projects that are based on refinement include seL4 [30], FSCQ [10], Flashix [48], and CompCert [35], with high human effort involved. Correct-by-construction correspondence between low-level code and high-level data types helps to some extent in, e.g., [13] and Cogent [3]. Recent work on "push-button" verification includes a verified TLS library [12], AWS C Common library [11], file system [50], a hyperkernel [42], network functions [56], where the high degree of proof automation is in part achieved by statically bounding the state space of the systems.…”

Section: Related Workmentioning

confidence: 99%

Bridging Arrays and ADTs in Recursive Proofs

Fedyukovich

Ernst

2021

Tools and Algorithms for the Construction and Analysis of Systems

View full text Add to dashboard Cite

We present an approach to synthesize relational invariants to prove equivalences between object-oriented programs. The approach bridges the gap between recursive data types and arrays that serve to represent internal states. Our relational invariants are recursively-defined, and thus are valid for data structures of unbounded size. Based on introducing recursion into the proofs by observing and lifting the constraints from joint methods of the two objects, our approach is fully automatic and can be seen as an algorithm for solving Constrained Horn Clauses (CHC) of a specific sort. It has been implemented on top of the SMT-based CHC solver AdtChc and evaluated on a range of benchmarks.

show abstract