Context-sensitive meta-constraint systems for explainable program analysis

DOI10.1007/978-3-031-30820-8_27MaRDI QIDQ6536146zbMATH OpenFDO

Authors Kalmer Apinis, Vesal Vojdani

Publication date 5 April 2024

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/978-3-031-30820-8_27

zbMATH Keywords

abstract domainsconstraint systemsdata-flow analysisexplainabilityprogram analysis

Mathematics Subject Classification ID

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

Recommendations

• Functional programs that explain their work
• Explaining Verification Conditions
• Adaptable Traces for Program Explanations
• Understanding program slices
• Explanations as programs in probabilistic logic programming

Cites work

• Abstract Interpretation with Specialized Definitions
• An abstract domain of uninterpreted functions
• Analyzing program analyses
• Compiler design. Analysis and transformation.
• Control-flow refinement by partial evaluation, and its application to termination and cost analysis
• Demand-driven interprocedural analysis for map-based abstract domains
• scientific article; zbMATH DE number 2117132 (Why is no real title available?)
• scientific article; zbMATH DE number 236855 (Why is no real title available?)
• scientific article; zbMATH DE number 3103212 (Why is no real title available?)
• Logic for Programming, Artificial Intelligence, and Reasoning
• Programming Languages and Systems
• Systematic design of program transformation frameworks by abstract interpretation
• Three improvements to the top-down solver
• Verification, Model Checking, and Abstract Interpretation
• Verification, Model Checking, and Abstract Interpretation

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

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