Demand driven to mark infeasible paths [Bodik, Gupta, Soffa, FSE’97]

Mark and use path sensitive analysis

• Determine the shape of infeasible paths

  • find paths along which branch outcomes are predetermined - laying down threads
  • demand driven: for each branch considered

• Identify shortest infeasible paths

  • shortest infeasible paths (SIP): minimum-length subpath s.t. if any path p contains a SIP => p is infeasible

• Carry out path sensitive analysis

  • Compute feasible reaching definitions

Previous slide

Next slide

Back to first slide

View graphic version