Login / Signup

Testing Static Analyzers with Randomly Generated Programs.

Pascal CuoqBenjamin MonateAnne PacaletVirgile PrevostoJohn RegehrBoris YakobowskiXuejun Yang
Published in: NASA Formal Methods (2012)
Keyphrases
  • randomly generated
  • branch and bound algorithm
  • np complete
  • boolean functions
  • symbolic execution
  • phase transition
  • dynamic analysis
  • test cases
  • sat instances
  • software testing
  • lower bound
  • branch and bound
  • sat problem