On the complexity of set-based analysis
From MaRDI portal
Publication:5348872
DOI10.1145/258948.258963zbMath1369.68102OpenAlexW2052804469MaRDI QIDQ5348872
David Allen McAllester, Nevin Heintze
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
Related Items (4)
The Complexity of Andersen’s Analysis in Practice ⋮ Streett Automata Model Checking of Higher-Order Recursion Schemes ⋮ Interconvertibility of a class of set constraints and context-free-language reachability ⋮ Selectors make set-based analysis too hard
This page was built for publication: On the complexity of set-based analysis
