Paths vs. trees in set-based program analysis

DOI10.1145/325694.325730MaRDI QIDQ5178862zbMATH OpenOpenAlexFDO

Authors Witold Charatonik, Andreas Podelski, Jean-Marc Talbot

Publication date 17 March 2015

Published in Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Logic programming (68N17) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Program analysis via satisfiability modulo path programs
• Model Checking on Trees with Path Equivalences
• Path dependent analysis of logic programs
• Introduction to set constraint-based program analysis
• A set-based context model for program analysis
• scientific article; zbMATH DE number 1285798
• Path-Oriented Program Analysis
• scientific article; zbMATH DE number 1407672

Cited in

(5)

• Deciding H₁ by resolution
• Set constraints with intersection
• scientific article; zbMATH DE number 1538022 (Why is no real title available?)
• On the complexity of set-based analysis
• Selectors make set-based analysis too hard

This page was built for publication: Paths vs. trees in set-based program analysis

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