Steensgaard's algorithm
id:
steensgaard-s-algorithm-275-10634417
title:
Steensgaard's algorithm
text:
In computer science, Steensgaard's algorithm is a scalable, flow-insensitive, algorithm for pointer analysis. It is often used in compilers, due to its speed. In its original formulation, this algorithm was field-, context-, and array-insensitive. Steensgaard's algorithm is based on equality constraints, as opposed to Andersen's algorithm, which is based on subset constraints. This allows points-to information to be tracked using a union-find data structure. This choice gives the algorithm its c
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Steensgaard%27s_algorithm
date created:
date modified:
2023-03-01T21:56:03Z
main entity:
{"identifier":"Q25304211","url":"https://www.wikidata.org/entity/Q25304211"}
image:
fields total:
13
integrity:
13