A divide-and-conquer approach for analysing overlaid data structures

DOI10.1007/s10703-012-0151-7zbMath1284.68407OpenAlexW2011193467MaRDI QIDQ2441710

Oukseh Lee, Rasmus L. Petersen, Hongseok Yang

Publication date: 28 March 2014

Published in: Formal Methods in System Design (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10703-012-0151-7

zbMATH Keywords

shape analysismemory safetyautomatic program verificationoverlaid data structure

Mathematics Subject Classification ID

Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Data structures (68P05)

Uses Software

• SLAM
• ASTREE

Cites Work

• Unnamed Item
• Unnamed Item
• Constructive versions of Tarski's fixed point theorems
• Scalable Shape Analysis for Systems Code
• Shape Analysis of Low-Level C with Overlapping Structures
• A Shape Analysis for Non-linear Data Structures
• Compositional shape analysis by means of bi-abduction
• Verification, Model Checking, and Abstract Interpretation

This page was built for publication: A divide-and-conquer approach for analysing overlaid data structures