Pointer logic for verification of pointer programs
From MaRDI portal
Recommendations
Cited in
(23)- Calculating with pointers
- Verifying pointer and string analyses with region type systems
- Exploiting pointer analysis in memory models for deductive verification
- Automatically proving termination and memory safety for programs with pointer arithmetic
- Proving pointer programs in higher-order logic
- scientific article; zbMATH DE number 1612488 (Why is no real title available?)
- scientific article; zbMATH DE number 2084334 (Why is no real title available?)
- Time bounds for general function pointers
- Safe Modification of Pointer Programs in Refinement Calculus
- Abstraction of object graphs in program verification
- Compositional Reasoning for Pointer Structures
- scientific article; zbMATH DE number 1956491 (Why is no real title available?)
- Correctness of Pointer Manipulating Algorithms Illustrated by a Verified BDD Construction
- Applying Light-Weight Theorem Proving to Debugging and Verifying Pointer Programs
- Programming Languages and Systems
- Computer Science Logic
- Reasoning About Sequences of Memory States
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- Static Analysis
- Programming Languages and Systems
- Proving pointer programs in higher-order logic.
- Verifying pointer safety for programs with unknown calls
- A shape graph logic and a shape system
This page was built for publication: Pointer logic for verification of pointer programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3071444)