Context-sensitive meta-constraint systems for explainable program analysis

DOI10.1007/978-3-031-30820-8_27zbMath1547.6811MaRDI QIDQ6536146

Kalmer Apinis, Vesal Vojdani

Publication date: 5 April 2024

zbMATH Keywords

program analysisdata-flow analysisabstract domainsconstraint systemsexplainability

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Demand-driven interprocedural analysis for map-based abstract domains
• An Abstract Domain of Uninterpreted Functions
• Analyzing Program Analyses
• Abstract Interpretation with Specialized Definitions
• Three improvements to the top-down solver
• Control-Flow Refinement by Partial Evaluation, and its Application to Termination and Cost Analysis
• Systematic design of program transformation frameworks by abstract interpretation
• Programming Languages and Systems
• Logic for Programming, Artificial Intelligence, and Reasoning
• Verification, Model Checking, and Abstract Interpretation
• Compiler Design
• Verification, Model Checking, and Abstract Interpretation

This page was built for publication: Context-sensitive meta-constraint systems for explainable program analysis