2011/04/30 by Sam Tobin-Hochstadt, David Van Horn, Tobin-Hochstadt, Sam +1
Computer Science · #FOS: Computer and information sciences #Logic, programming, and type systems #Programming Languages (cs.PL) #Software Engineering Research #Software Testing and Debugging Techniques
paper · pdf · doi:10.48550/arxiv.1105.0106
openalex publication_date 2011/04/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Problems in program analysis can be solved by developing novel program semantics and deriving abstractions conventionally. For over thirty years, higher-order program analysis has been sold as a hard problem. Its solutions have required ingenuity and complex models of approximation. We claim that this difficulty is due to premature focus on abstraction and propose a new approach that emphasizes semantics. Its simplicity enables new analyses that are beyond the current state of the art.