On the public citation graph
Interprocedural Shape Analysis for Cutpoint-Free Programs
0 signed · 98 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/11547662_20openalex-snapshot
Interprocedural Shape Analysis for Cutpoint-Free Programs
inferredcites →https://doi.org/10.1007/3-540-36575-3_26openalex-snapshot
Finite Differencing of Logical Formulas for Static Analysis
inferredcites →https://doi.org/10.1007/3-540-44898-5_26openalex-snapshot
Static Analysis of Accessed Regions in Recursive Data Structures
inferredcites →https://doi.org/10.1007/3-540-44898-5_27openalex-snapshot
Establishing Local Temporal Heap Safety Properties with Applications to Compile-Time Memory Management
inferredcites →https://doi.org/10.1007/3-540-45306-7_10openalex-snapshot
Interprocedural Shape Analysis for Recursive Programs
inferredcites →https://doi.org/10.1007/3-540-45337-7_4openalex-snapshot
Simple Ownership Types for Object Containment
inferredcites →https://doi.org/10.1007/3-540-55984-1_13openalex-snapshot
The interprocedural coincidence theorem
inferredcites →https://doi.org/10.1007/978-3-540-27864-1_19openalex-snapshot
A Relational Approach to Interprocedural Shape Analysis
inferredcites →https://doi.org/10.1007/978-3-540-27864-1_20openalex-snapshot
Partially Disjunctive Heap Abstraction
inferredcites →https://doi.org/10.1007/978-3-540-45099-3_7openalex-snapshot
Checking Cleanness in Linked Lists
inferredcites →https://doi.org/10.1007/978-3-662-03811-6openalex-snapshot
Principles of Program Analysis
inferredcites →https://doi.org/10.1007/bfb0053373openalex-snapshot
Balloon types: Controlling sharing of state in data types
inferredcites →https://doi.org/10.1109/lics.2002.1029817openalex-snapshot
Separation logic: a logic for shared mutable data structures
inferredcites →https://doi.org/10.1145/1040305.1040330openalex-snapshot
A semantics for procedure local heaps and its abstractions
inferredcites →https://doi.org/10.1145/1040305.1040331openalex-snapshot
Region-based shape analysis with tracked locations
inferredcites →https://doi.org/10.1145/1047659.1040330openalex-snapshot
A semantics for procedure local heaps and its abstractions
inferredcites →https://doi.org/10.1145/178243.178263openalex-snapshot
Interprocedural may-alias analysis for pointers
inferredcites →https://doi.org/10.1145/1988042.1988050openalex-snapshot
BI as an assertion language for mutable data structures
inferredcites →https://doi.org/10.1145/199448.199462openalex-snapshot
Precise interprocedural dataflow analysis via graph reachability
inferredcites →https://doi.org/10.1145/286936.286947openalex-snapshot
Ownership types for flexible alias protection
inferredcites →https://doi.org/10.1145/347324.348031openalex-snapshot
Putting static analysis to work for verification
inferredcites →https://doi.org/10.1145/360204.375719openalex-snapshot
BI as an assertion language for mutable data structures
inferredcites →https://doi.org/10.1145/503272.503289openalex-snapshot
Representation independence, confinement and access control [extended abstract]
inferredcites →https://doi.org/10.1145/504282.504300openalex-snapshot
Encapsulating objects with confined types
inferredcites →https://doi.org/10.1145/512529.512559openalex-snapshot
Using data groups to specify and check side effects
inferredcites →https://doi.org/10.1145/514188.514190openalex-snapshot
Parametric shape analysis via 3-valued logic
inferredcites →https://doi.org/10.1145/604131.604156openalex-snapshot
Ownership types for object encapsulation
inferredcites →https://doi.org/10.1145/93542.93585openalex-snapshot
Analysis of pointers and structures
inferredcites →https://doi.org/10.1145/989393.989429openalex-snapshot
Analysis of pointers and structures
inferredcites →https://doi.org/10.5555/1760267.1760303openalex-snapshot
Static analysis of accessed regions in recursive data structures
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11691372_19openalex-snapshot
A Local Shape Analysis Based on Separation Logic
inferred← citeshttps://doi.org/10.1007/11823230_16openalex-snapshot
Interprocedural Shape Analysis with Separated Heap Abstractions
inferred← citeshttps://doi.org/10.1007/978-3-030-65474-0_12openalex-snapshot
Interprocedural Shape Analysis Using Separation Logic-Based Transformer Summaries
inferred← citeshttps://doi.org/10.1007/978-3-319-08867-9_4openalex-snapshot
Shape Analysis via Second-Order Bi-Abduction
inferred← citeshttps://doi.org/10.1007/978-3-319-09108-2_4openalex-snapshot
Generating Abstract Graph-Based Procedure Summaries for Pointer Programs
inferred← citeshttps://doi.org/10.1007/978-3-319-89960-2_10openalex-snapshot
A Verified Implementation of the Bounded List Container
inferred← citeshttps://doi.org/10.1007/978-3-540-69149-5_11openalex-snapshot
Automatic Verification of Strongly Dynamic Software Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-69738-1_16openalex-snapshot
Constructing Specialized Shape Analyses for Uniform Change
inferred← citeshttps://doi.org/10.1007/978-3-540-69738-1_17openalex-snapshot
Maintaining Doubly-Linked List Invariants in Shape Analysis with Local Reasoning
inferred← citeshttps://doi.org/10.1007/978-3-540-71209-1_3openalex-snapshot
Shape Analysis by Graph Decomposition
inferred← citeshttps://doi.org/10.1007/978-3-540-71316-6_16openalex-snapshot
Modular Shape Analysis for Dynamically Encapsulated Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-72521-3_25openalex-snapshot
A Static Heap Analysis for Shape and Connectivity: Unified Memory Analysis: The Base Framework
inferred← citeshttps://doi.org/10.1007/978-3-540-73368-3_24openalex-snapshot
Context-Bounded Analysis of Multithreaded Programs with Dynamic Linked Structures
inferred← citeshttps://doi.org/10.1007/978-3-540-73368-3_25openalex-snapshot
Revamping TVLA: Making Parametric Shape Analysis Competitive
inferred← citeshttps://doi.org/10.1007/978-3-642-11970-5_8openalex-snapshot
Practical Extensions to the IFDS Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-642-18275-4_25openalex-snapshot
Access Analysis-Based Tight Localization of Abstract Memories
inferred← citeshttps://doi.org/10.1007/978-3-642-19718-5_24openalex-snapshot
Precise Interprocedural Analysis in the Presence of Pointers to the Stack
inferred← citeshttps://doi.org/10.1007/978-3-642-19861-8_6openalex-snapshot
Faster Alias Set Analysis Using Summaries
inferred← citeshttps://doi.org/10.1007/978-3-642-23702-7_6openalex-snapshot
Purity Analysis: An Abstract Interpretation Formulation
inferred← citeshttps://doi.org/10.1007/978-3-642-24690-6_14openalex-snapshot
Verification of B + Trees: An Experiment Combining Shape Analysis and Interactive Theorem Proving
inferred← citeshttps://doi.org/10.1007/978-3-642-25318-8_7openalex-snapshot
Access-Based Localization with Bypassing
inferred← citeshttps://doi.org/10.1007/978-3-642-27940-9_1openalex-snapshot
Abstract Domains for Automated Reasoning about List-Manipulating Programs with Infinite Data
inferred← citeshttps://doi.org/10.1007/978-3-642-37651-1_17openalex-snapshot
Interprocedural Shape Analysis for Effectively Cutpoint-Free Programs
inferred← citeshttps://doi.org/10.1007/978-3-662-46669-8_20openalex-snapshot
Desynchronized Multi-State Abstractions for Open Programs in Dynamic Languages
inferred← citeshttps://doi.org/10.1007/s10270-013-0320-1openalex-snapshot
Verification of B $$^+$$ trees by integration of shape analysis and interactive theorem proving
inferred← citeshttps://doi.org/10.1016/j.infsof.2008.11.003openalex-snapshot
A bottom-up pointer analysis using the update history
inferred← citeshttps://doi.org/10.1016/j.jpdc.2012.08.004openalex-snapshot
A data dependence test based on the projection of paths over shape graphs
inferred← citeshttps://doi.org/10.1016/j.scico.2013.04.002openalex-snapshot
Access-based abstract memory localization in static analysis
inferred← citeshttps://doi.org/10.1109/icppw.2009.27openalex-snapshot
On the Automatic Detection of Heap-Induced Data Dependencies with Interprocedural Shape Analysis
inferred← citeshttps://doi.org/10.1109/ipdps.2008.4536285openalex-snapshot
Parallelizing irregular C codes assisted by interprocedural shape analysis
inferred← citeshttps://doi.org/10.1145/1133956.1133975openalex-snapshot
Compile-time deallocation of individual objects
inferred← citeshttps://doi.org/10.1145/1250734.1250764openalex-snapshot
Shape analysis with inductive recursion synthesis
inferred← citeshttps://doi.org/10.1145/1250734.1250765openalex-snapshot
Thread-modular shape analysis
inferred← citeshttps://doi.org/10.1145/1273442.1250765openalex-snapshot
Thread-modular shape analysis
inferred← citeshttps://doi.org/10.1145/1328438.1328467openalex-snapshot
Generating precise and concise procedure summaries
inferred← citeshttps://doi.org/10.1145/1328897.1328467openalex-snapshot
Generating precise and concise procedure summaries
inferred← citeshttps://doi.org/10.1145/1480881.1480917openalex-snapshot
Compositional shape analysis by means of bi-abduction
inferred← citeshttps://doi.org/10.1145/1594834.1480917openalex-snapshot
Compositional shape analysis by means of bi-abduction
inferred← citeshttps://doi.org/10.1145/1667048.1667050openalex-snapshot
A relational approach to interprocedural shape analysis
inferred← citeshttps://doi.org/10.1145/1925844.1926406openalex-snapshot
Calling context abstraction with shapes
inferred← citeshttps://doi.org/10.1145/1926385.1926406openalex-snapshot
Calling context abstraction with shapes
inferred← citeshttps://doi.org/10.1145/1993316.1993566openalex-snapshot
On inter-procedural analysis of programs with lists and data
inferred← citeshttps://doi.org/10.1145/1993498.1993566openalex-snapshot
On inter-procedural analysis of programs with lists and data
inferred← citeshttps://doi.org/10.1145/2039346.2039349openalex-snapshot
Bottom-up shape analysis using LISF
inferred← citeshttps://doi.org/10.1145/2049697.2049700openalex-snapshot
Compositional Shape Analysis by Means of Bi-Abduction
inferred← citeshttps://doi.org/10.1145/2259016.2259049openalex-snapshot
Efficient bottom-up heap analysis for symbolic path-based data access summaries
inferred← citeshttps://doi.org/10.1145/2535838.2535854openalex-snapshot
Modular reasoning about heap paths via effectively propositional formulas
inferred← citeshttps://doi.org/10.1145/2568225.2568243openalex-snapshot
Reviser: efficiently updating IDE-/IFDS-based data-flow analyses in response to incremental program changes
inferred← citeshttps://doi.org/10.1145/2578855.2535854openalex-snapshot
Modular reasoning about heap paths via effectively propositional formulas
inferred← citeshttps://doi.org/10.1145/2594291.2594328openalex-snapshot
Hybrid top-down and bottom-up interprocedural analysis
inferred← citeshttps://doi.org/10.1145/2666356.2594328openalex-snapshot
Hybrid top-down and bottom-up interprocedural analysis
inferred← citeshttps://doi.org/10.1145/2875913.2875930openalex-snapshot
Analyzing Inductively Defined Properties for Recursive Data Structures
inferred← citeshttps://doi.org/10.1145/3092255.3092267openalex-snapshot
"What's in a name?" going beyond allocation site names in heap analysis
inferred← citeshttps://doi.org/10.1145/3156685.3092267openalex-snapshot
"What's in a name?" going beyond allocation site names in heap analysis
inferred← citeshttps://doi.org/10.1145/3368089.3409718openalex-snapshot
Domain-independent interprocedural program analysis using block-abstraction memoization
inferred← citeshttps://doi.org/10.1145/3377811.3380425openalex-snapshot
Pipelining bottom-up data flow analysis
inferred← citeshttps://doi.org/10.1201/9781420043839.ch12openalex-snapshot
Shape Analysis and Applications
inferred← citeshttps://doi.org/10.48456/tr-758openalex-snapshot
Logics and analyses for concurrent heap-manipulating programs
inferred← citeshttps://doi.org/10.70675/5140cc93za47az46a2z8e67z77a86b202ac0openalex-snapshot
Abstractions relationnelles de la mémoire pour une analyse compositionnelle de structures de données
showing the first 61 of 62 · page through all 62
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.