Paths vs. trees in set-based program analysis
From MaRDI portal
Publication:5178862
DOI10.1145/325694.325730zbMath1323.68201OpenAlexW2067422029MaRDI QIDQ5178862
Andreas Podelski, Jean-Marc Talbot, Witold Charatonik
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
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Logic programming (68N17) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (2)
This page was built for publication: Paths vs. trees in set-based program analysis