Interprocedural Shape Analysis for Effectively Cutpoint-Free Programs

DOI10.1007/978-3-642-37651-1_17zbMath1383.68025OpenAlexW121457469MaRDI QIDQ4916088

No author found.

Publication date: 19 April 2013

Published in: Programming Logics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-37651-1_17

Mathematics Subject Classification ID

Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (1)

Inference of Field-Sensitive Reachability and Cyclicity

Cites Work

• Precise interprocedural dataflow analysis with applications to constant propagation
• Scalable Shape Analysis for Systems Code
• Interprocedural Shape Analysis with Separated Heap Abstractions
• BI as an assertion language for mutable data structures
• Compositional shape analysis by means of bi-abduction
• A semantics for procedure local heaps and its abstractions
• Region-based shape analysis with tracked locations
• Static Analysis
• Static Analysis
• Verification, Model Checking, and Abstract Interpretation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Interprocedural Shape Analysis for Effectively Cutpoint-Free Programs