Program analysis via satisfiability modulo path programs

DOI10.1145/1706299.1706309zbMath1312.68058OpenAlexW2144789370MaRDI 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

zbMATH Keywords

program analysisabstract interpretationSMT solverssymbolic executionsatisfiability solverspath sensitivity

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (6)

Abstract interpretation as automated deduction ⋮ Abstract Interpretation as Automated Deduction ⋮ Backward symbolic execution with loop folding ⋮ Model Checking MSVL Programs Based on Dynamic Symbolic Execution ⋮ Deciding floating-point logic with abstract conflict driven clause learning ⋮ A framework for memory efficient context-sensitive program analysis

This page was built for publication: Program analysis via satisfiability modulo path programs