SLR: Path-Sensitive Analysis through Infeasible-Path Detection and Syntactic Language Refinement

DOI10.1007/978-3-540-69166-2_16MaRDI QIDQ3522074zbMATH OpenOpenAlexFDO

Authors Gogul Balakrishnan, Sriram Sankaranarayanan, Franjo Ivančić, Ou Wei, Aarti Gupta

Publication date 28 August 2008

Published in Static Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-69166-2_16

Mathematics Subject Classification ID

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

Recommendations

• Counterexample guided path reduction for static program analysis
• Analysis of the infeasible path based on key branch
• Incremental false path elimination for static software analysis
• Program analysis via satisfiability modulo path programs
• Infeasible paths elimination by symbolic execution techniques. Proof of correctness and preservation of paths

Cited in

(4)

• Counterexample guided path reduction for static program analysis
• Analysis of the infeasible path based on key branch
• Incremental false path elimination for static software analysis
• SLR inference: An inference system for fixed-mode logic programs, based on SLR parsing

This page was built for publication: SLR: Path-Sensitive Analysis through Infeasible-Path Detection and Syntactic Language Refinement

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