engleski

Separation Logic Verification of C Programs with an SMT Solver

This paper presents a methodology for automated modular verification of C programs against specifications written in separation logic. The distinguishing features of the approach are representation of the C memory model in separation logic by means of rewrite rules suitable for automation and the careful integration of an SMT solver behind the separation logic prover to guide the proof search.

Separation logic; automated verification; automated theorem proving; C programming language

nije evidentirano