Partitioned memory models for program analysis

DOI10.1007/978-3-319-52234-0_29zbMATH Open1484.68054OpenAlexW2563082156MaRDI QIDQ2961587FDOQ2961587

Authors:

Publication date: 21 February 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-52234-0_29

Recommendations

• Semi-sparse flow-sensitive pointer analysis
• Static Analysis
• A scalable segmented decision tree abstract domain
• Programming Languages and Systems
• scientific article; zbMATH DE number 1834572

Mathematics Subject Classification ID

Data structures (68P05) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Cites Work

• Back to the future, revisiting precise program verification using SMT solvers
• Tools and Algorithms for the Construction and Analysis of Systems
• Title not available (Why is that?)
• CCured, type-safe retrofitting of legacy code
• Pointer Analysis, Conditional Soundness, and Proving the Absence of Errors
• Heaps and Data Structures: A Challenge for Automated Provers
• Unifying type checking and property checking for low-level code

Cited In (3)

• Internal models of system F for decompilation
• Hybrid analysis: Static \& dynamic memory reference analysis
• Hierarchical shape abstraction for analysis of free list memory allocators

Uses Software

• SMT-LIB
• Frama-C
• CBMC
• CCured
• SeaHorn
• SMACK

This page was built for publication: Partitioned memory models for program analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2961587)