Solving string constraints lazily

Abstract

Decision procedures have long been a fixture in program analysis, and reasoning about string constraints is a key element in many program analyses and testing frameworks. Recent work on string analysis has focused on providing decision procedures that model string operations. Separating string analysis from its client applications has important and familiar benefits: it enables the independent improvement of string analysis tools and it saves client effort.

BibTeX

@inproceedings{Hooimeijer-Weimer:ASE10,
  author    = {Pieter Hooimeijer and
               Westley Weimer},
  title     = {Solving string constraints lazily},
  booktitle = {ASE},
  pages     = {377--386},
  publisher = {{ACM}},
  year      = {2010},
}

Solving string constraints lazily

Abstract

Related papers