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

algorithmsprogramming languagescomplexity analysislogic programmingprogram 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)

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

(25)

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

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)