Interprocedural shape analysis for recursive programs

DOI10.1007/3-540-45306-7_10MaRDI QIDQ2764069zbMATH OpenFDO

Authors Noam Rinetzky, Mooly Sagiv

Publication date 22 January 2002

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2027/20270133

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Computing methodologies and applications (68U99)

Recommendations

• A relational approach to interprocedural shape analysis
• Interprocedural Shape Analysis with Separated Heap Abstractions
• Static Analysis
• Region-based shape analysis with tracked locations
• Tools and Algorithms for the Construction and Analysis of Systems

Cited in

(16)

• Shapeliness analysis of functional programs with algebraic data types
• Interprocedural shape analysis using separation logic-based transformer summaries
• Typed intermediate languages for shape analysis
• Scalable Shape Analysis for Systems Code
• Interprocedural Shape Analysis with Separated Heap Abstractions
• Accurate shape analysis for recursive data structures
• From shape analysis to termination analysis in linear time
• Static analysis of accessed regions in recursive data structures
• Interprocedural shape analysis for effectively cutpoint-free programs
• Region-based shape analysis with tracked locations
• Tools and Algorithms for the Construction and Analysis of Systems
• Calling context abstraction with shapes
• Maintaining Doubly-Linked List Invariants in Shape Analysis with Local Reasoning
• Quantitative shape analysis
• A relational approach to interprocedural shape analysis
• Static Analysis

Describes a project that uses

Uses Software

• TVLA

This page was built for publication: Interprocedural shape analysis for recursive programs

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