A Slice-Based Decision Procedure for Type-Based Partial Orders

Download PDF
Open Webpage

Elena Sherman, Brady J. Garvin, Matthew B. Dwyer

Published: 2010, Last Modified: 22 Mar 2026IJCAR 2010EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: Automated software verification and path-sensitive program analysis require the ability to distinguish executable program paths from those that are infeasible. To achieve this, program paths are encoded symbolically as a conjunction of constraints and submitted to an SMT solver; satisfiable path constraints are then analyzed further.