Transformational derivation of an improved alias analysis algorithm

DOI10.1007/s10990-005-7005-6zbMath1084.68016OpenAlexW2090596346MaRDI QIDQ815001

Deepak Goyal

Publication date: 8 February 2006

Published in: Higher-Order and Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10990-005-7005-6

zbMATH Keywords

continuitypointer analysisfinite differencingdominated convergencealias graphcontrol flow graphinput-boundedmay-alias analysisoutput-boundedsparse evaluation graphworkset algorithm

Mathematics Subject Classification ID

Theory of programming languages (68N15)

Related Items (1)

Precise complexity guarantees for pointer analysis via Datalog with extensions

Uses Software

• SETL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A linear time solution to the single function coarsest partition problem
• Making data structures persistent
• Fixed point theorems and semantics: A folk tale
• Monotone data flow analysis frameworks
• Program derivation by fixed point computation
• A lattice-theoretical fixpoint theorem and its applications
• An Automatic Technique for Selection of Data Representations in SETL Programs
• Programming by Refinement, as Exemplified by the SETL Representation Sublanguage
• Finite Differencing of Computable Expressions
• High level iterators and a method for automatically designing data structure representation

This page was built for publication: Transformational derivation of an improved alias analysis algorithm