On the complexity of set-based analysis

DOI10.1145/258948.258963MaRDI QIDQ5348872zbMATH OpenOpenAlexFDO

Authors Nevin Heintze, David Allen McAllester

Publication date 21 August 2017

Published in Proceedings of the second ACM SIGPLAN international conference on Functional programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/258948.258963

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Recommendations

• Paths vs. trees in set-based program analysis
• Selectors make set-based analysis too hard
• scientific article; zbMATH DE number 1738291
• scientific article; zbMATH DE number 1953279
• On the complexity analysis of static analyses

Cited in

(9)

• scientific article; zbMATH DE number 1114037 (Why is no real title available?)
• On Bounded Reachability of Programs with Set Comprehensions
• A set-based context model for program analysis
• The NFA acceptance hypothesis: non-combinatorial and dynamic lower bounds
• Amortized Analysis of Algorithms for Set Union with Backtracking
• The Complexity of Andersen’s Analysis in Practice
• Streett Automata Model Checking of Higher-Order Recursion Schemes
• Selectors make set-based analysis too hard
• Interconvertibility of a class of set constraints and context-free-language reachability

This page was built for publication: On the complexity of set-based analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5348872)