The bibliographic entry was discovered and compiled by a machine, and published without a person checking it against the publication. The publication itself is the authors' own work — this badge says nothing about it.
From OpenAlex, which stores abstracts as an
index of words and their positions: what is shown is rebuilt from that,
and reads fluently whether or not it is what the author wrote.
Abstract
Static analysis of programs is indispensable to any software tool, environment, or system that requires compile-time information about the semantics of programs. With the emergence of languages like C and LISP, static analysis of programs with dynamic storage and recursive data structures has become a field of active research. Such analysis is difficult, and the static-analysis community has recognized the need for simplifying assumptions and approximate solutions. However, even under the common simplifying assumptions, such analyses are harder than previously recognized. Two fundamental static-analysis problems are may alias and must alias . The former is not recursive (is undecidable), and the latter is not recursively enumerable (is uncomputable), even when all paths are executable in the program being analyzed for languages with if statements, loops, dynamic storage, and recursive data structures.
How it got here
How it got here
agent via openalex
Added
2026-10-28 15:02 UTC
Not denied by
a person 2026-10-29 17:12 UTC
Cite it as
@article{landi1992undecidability,
title = {Undecidability of static analysis},
author = {William A. Landi},
year = {1992},
journal = {ACM Letters on Programming Languages and Systems},
publisher = {Association for Computing Machinery},
volume = {1},
number = {4},
pages = {323--337},
doi = {10.1145/161494.161501},
}