• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

DMCA

HAMPI: A Solver for String Constraints (2009)

Cached

  • Download as a PDF

Download Links

  • [people.csail.mit.edu]
  • [www.stanford.edu]
  • [www.csail.mit.edu]
  • [people.csail.mit.edu]
  • [www.pgbovine.net]
  • [www.pgbovine.net]
  • [www.cs.virginia.edu]
  • [pag.lcs.mit.edu]
  • [www.pag.csail.mit.edu]
  • [www.cs.washington.edu]
  • [pag.csail.mit.edu]
  • [homes.cs.washington.edu]
  • [pag.lcs.mit.edu]
  • [people.csail.mit.edu]
  • [www.cs.washington.edu]
  • [pag.csail.mit.edu]
  • [www.pag.csail.mit.edu]
  • [homes.cs.washington.edu]
  • [homes.cs.washington.edu]
  • [dspace.mit.edu]
  • [people.csail.mit.edu]
  • [dspace.mit.edu]

  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Adam Kiezun , Vijay Ganesh , Philip J. Guo , Pieter Hooimeijer , Michael D. Ernst
Citations:101 - 19 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@MISC{Kiezun09hampi:a,
    author = {Adam Kiezun and Vijay Ganesh and Philip J. Guo and Pieter Hooimeijer and Michael D. Ernst},
    title = {HAMPI: A Solver for String Constraints},
    year = {2009}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

Abstract

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 for string-manipulating programs. We designed and implemented Hampi, a solver for string constraints over fixed-size string variables. Hampi constraints express membership in regular languages and fixed-size context-free languages. Hampi constraints may contain context-free-language definitions, regular-language definitions and operations, and the membership predicate. Given a set of constraints, Hampi outputs a string that satisfies all the constraints, or reports that the constraints are unsatisfiable. Hampi is expressive and efficient, and can be successfully applied to testing and analysis of real programs. Our experiments use Hampi in: static and dynamic analyses for finding SQL injection vulnerabilities in Web applications; automated bug finding in C programs using systematic testing; and compare Hampi with another string solver. Hampi’s source code, documentation, and the experimental data are available at

Keyphrases

string-manipulating program    experimental data    regular language    fixed-size string variable    real program    expressive off-the-shelf solver    verification technique    dynamic analysis    regular-language definition    maintainable tool    analysis technique    string solver    hampi constraint express membership    constraint-generation phase    membership predicate    web application    hampi constraint    many automatic testing    source code    fixed-size context-free language    systematic testing    off-the-shelf constraint solver    sql injection vulnerability    constraint-solving phase    context-free-language definition   

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University