On the complexity analysis of static analyses

DOI10.1145/581771.581774zbMath1326.68102OpenAlexW2164104198MaRDI QIDQ3455540

David Allen McAllester

Publication date: 7 December 2015

Published in: Journal of the ACM (Search for Journal in Brave)

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

zbMATH Keywords

algorithmsprogramming languagesprogram analysislogic programmingcomplexity analysismodels of computation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Logic programming (68N17) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (3)

Nesting analysis of mobile ambients ⋮ The language intersection problem for non-recursive context-free grammars ⋮ Logical approximation for program analysis

Uses Software

• XSB

This page was built for publication: On the complexity analysis of static analyses