Proof-Producing Symbolic Execution for Binary Code Verification. (arXiv:2304.08848v1 [cs.PL])

We propose a proof-producing symbolic execution for verification of
machine-level programs. The analysis is based on a set of core inference rules
that are designed to give control over the tradeoff between preservation of
precision and the introduction of overapproximation to make the application to
real world code useful and tractable. We integrate our symbolic execution in a
binary analysis platform that features a low-level intermediate language
enabling the application of analyses to many different processor architectures.
The overall framework …

analysis application binary binary analysis code control features framework integrate introduction language low machine platform preservation processor producing rules symbolic execution verification world