Everything about Steensgaard's algorithm

🧭 Start here: a 6-step reading path

1. Read the overview: Steensgaard's algorithmA 5-minute orientation
2. Go sideways: Pointer analysisA closely related topic
3. Go sideways: Disjoint-set data structureA closely related topic

🏆 Landmark papers (most cited)

• No matching papers found.

📚 Books worth reading

Open Library didn't respond; try again in a moment.

🔗 Related topics

• Pointer analysis In computer science, pointer analysis, or points-to analysis, is a static code analysis technique that establishes which pointers, or heap references,…
• Disjoint-set data structure In computer science, a disjoint-set data structure, also called a union–find data structure or merge–find set, is a data structure that stores a collection…
• Polyvariance In program analysis, a polyvariant or context-sensitive analysis (as opposed to a monovariant or context-insensitive analysis) analyzes each function multiple…
• Yannis Smaragdakis Yannis Smaragdakis (Greek: Γιάννης Σμαραγδάκης; born 31 March 1972) is a Greek-American software engineer, computer programmer, and researcher. He is a…
• Bounding sphere In mathematics, given a non-empty set of objects of finite extension in d-dimensional space, for example a set of points, a bounding sphere, enclosing…
• Linked list In computer science, a linked list is a linear collection of data elements whose order is not given by their physical placement in memory. Instead, each…
• Generic programming Generic programming is a style of computer programming in which algorithms are written in terms of data types to-be-specified-later that are then instantiated…
• Glasgow Haskell Compiler The Glasgow Haskell Compiler (GHC) is a native or machine code compiler for the functional programming language Haskell. It provides a cross-platform software…