English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

We propose a proof-producing symbolic execution for verification ofmachine-level programs. The analysis is based on a set of core inference rulesthat are designed to give control over the tradeoff between preservation ofprecision and the introduction of overapproximation to make the application toreal world code useful and tractable. We integrate our symbolic execution in abinary analysis platform that features a low-level intermediate languageenabling the application of analyses to many different processor architectures.The overall framework is implemented in the theorem prover HOL4 to be able toobtain highly trustworthy verification results. We demonstrate our approach toestablish sound execution time bounds for a control loop program implementedfor an ARM Cortex-M0 processor.

Proof-Producing Symbolic Execution for Binary Code Verification