Program analysis via satisfiability modulo path programs
DOI10.1145/1706299.1706309zbMath1312.68058MaRDI QIDQ5255063
William R. Harris, Aarti Gupta, Franjo Ivančić, Sriram Sankaranarayanan
Publication date: 11 June 2015
Published in: Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.183.906
program analysis; abstract interpretation; SMT solvers; symbolic execution; satisfiability solvers; path sensitivity
68Q55: Semantics in the theory of computing
68Q60: Specification and verification (program logics, model checking, etc.)
68N30: Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.)
Related Items