On the complexity analysis of static analyses

DOI10.1145/581771.581774MaRDI QIDQ3455540zbMATH OpenOpenAlexFDO

Authors 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

algorithmscomplexity analysislogic programmingmodels of computationprogram analysisprogramming languages

Mathematics Subject Classification ID

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

Recommendations

• On the complexity of dataflow analysis of logic programs
• Using Combined Static Analysis and Profiling for Logic Program Execution Time Estimation
• Precise complexity guarantees for pointer analysis via Datalog with extensions
• scientific article; zbMATH DE number 879004
• scientific article; zbMATH DE number 1765697

Cited in

(26)

• Incorporating static analysis in a combinator-based compiler
• Nesting analysis of mobile ambients
• Logical approximation for program analysis
• Static analysis by abstract interpretation: a mathematical programming approach
• A proof-theoretic approach to the static analysis of logic programs
• scientific article; zbMATH DE number 3890704 (Why is no real title available?)
• The Complexity of Andersen’s Analysis in Practice
• A Dependently Typed Framework for Static Analysis of Program Execution Costs
• scientific article; zbMATH DE number 2079674 (Why is no real title available?)
• scientific article; zbMATH DE number 2080295 (Why is no real title available?)
• scientific article; zbMATH DE number 1497841 (Why is no real title available?)
• scientific article; zbMATH DE number 1765697 (Why is no real title available?)
• Precise complexity guarantees for pointer analysis via Datalog with extensions
• Static analysis: a brief survey
• Small Formulas for Large Programs: On-Line Constraint Simplification in Scalable Static Analysis
• On the complexity of flow-sensitive dataflow analyses
• On the complexity of dataflow analysis of logic programs
• On the complexity of set-based analysis
• Rewriting Approximations for Fast Prototyping of Static Analyzers
• Why Use Datalog to Analyze Programs?
• Using Combined Static Analysis and Profiling for Logic Program Execution Time Estimation
• Computer Aided Verification
• New Computational Paradigms
• The language intersection problem for non-recursive context-free grammars
• Principles of staged static+dynamic partial analysis
• An integer static analysis for better extrapolation in Uppaal

Describes a project that uses

Uses Software

• XSB

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

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