Login / Signup

Program analysis via satisfiability modulo path programs.

William R. HarrisSriram SankaranarayananFranjo IvancicAarti Gupta
Published in: POPL (2010)
Keyphrases
  • satisfiability problem
  • computational complexity
  • shortest path
  • np complete
  • quantified boolean formulas
  • propositional logic
  • expressive power
  • automatic programming
  • database systems
  • object oriented
  • phase transition