Exploiting Pointer Analysis in Memory Models for Deductive Verification
Cooperation between verification methods is crucial to tackle the challenging problem of software verification. The paper focuses on the verification of C programs using pointers and it formalizes a cooperation between static analyzers doing pointer analysis and a deductive verification tool based on first order logic. We propose a framework based on memory models that captures the partitioning of memory inferred by pointer analyses, and complies with the memory models used to generate verification conditions. The framework guided us to propose a pointer analysis that accommodates to various low-level operations on pointers while providing precise information about memory partitioning to the deductive verification. We implemented this cooperation inside the Frama-C platform and we show its effectiveness in reducing the task of deductive verification on a complex case study.
Tue 15 Jan Times are displayed in time zone: Greenwich Mean Time : Belfast change
14:00 - 15:30
|Type-directed Bounding of Collections in Reactive Programs|
|Exploiting Pointer Analysis in Memory Models for Deductive Verification|
Quentin Bouillaguet, François BobotCEA, Mihaela SighireanuIRIF, University Paris Diderot and CNRS, France, Boris YakobowskiCEA - LISTFile Attached
|Small Faults Grow Up - Verification of Error Masking Robustness in Arithmetically Encoded Programs|