A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
HAMPI
2009
Proceedings of the eighteenth international symposium on Software testing and analysis - ISSTA '09
Many automatic testing, analysis, and verification techniques for programs can be effectively reduced to a constraint-generation phase followed by a constraint-solving phase. This separation of concerns often leads to more effective and maintainable tools. The increasing efficiency of off-the-shelf constraint solvers makes this approach even more compelling. However, there are few effective and sufficiently expressive off-the-shelf solvers for string constraints generated by analysis techniques
doi:10.1145/1572272.1572286
dblp:conf/issta/KiezunGGHE09
fatcat:7c4d2mcvabbkdo4vqok6uox76q