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
.
Filters
HAMPI
2009
Proceedings of the eighteenth international symposium on Software testing and analysis - ISSTA '09
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. ...
Given a set of constraints, Hampi outputs a string that satisfies all the constraints, or reports that the constraints are unsatisfiable. ...
Acknowledgements We thank the authors of CFGAnalyzer for sharing their data and the ISSTA reviewers for their helpful comments. ...
doi:10.1145/1572272.1572286
dblp:conf/issta/KiezunGGHE09
fatcat:7c4d2mcvabbkdo4vqok6uox76q
To fulfill this need, we designed and implemented HAMPI, a solver for string constraints over bounded string variables. ...
HAMPI: A solver for word equations over strings, regular expressions and context-free grammars. ...
To fulfill this need, we designed and implemented HAMPI, a solver for constraints over bounded string variables. ...
doi:10.1145/2377656.2377662
fatcat:vmhobstkzjbrbflgzy5p2lrxde
STP/HAMPI and Computer Security
[article]
2012
arXiv
pre-print
In this brief note I summarize the features of STP/HAMPI that make them particularly suited for computer security research, and a listing of some of the more important projects that use them. ...
In the past several years I have written two SMT solvers called STP and HAMPI that have found widespread use in computer security research by leading groups in academia, industry and the government. ...
A comprehensive list of projects using STP can be found at the following website: http://sites.google.com/site/stpfastprover/tools-using-stp HAMPI [12] is a solver for a theory of strings that can solve ...
arXiv:1204.2989v1
fatcat:rhx4owlsj5cltpadjlue3xcwyq
HAMPI: A String Solver for Testing, Analysis and Vulnerability Detection
[chapter]
2011
Lecture Notes in Computer Science
Thus, there is a clear need for an effective and expressive string-constraint solver that can be easily integrated into a variety of applications. ...
If an input constraint is satisfiable, Hampi generates a satsfying assignment for the string variables that occur in it. ...
To fulfill this need, we designed and implemented Hampi 1 , a solver for constraints over bounded string variables. ...
doi:10.1007/978-3-642-22110-1_1
fatcat:22xmfz2ylnc2xbi2h446rtgzsy
Smten: Automatic Translation of High-Level Symbolic Computations into SMT Queries
[chapter]
2013
Lecture Notes in Computer Science
We demonstrate the use of Smten in the development of an SMT-based string constraint solver. ...
This paper introduces Smten, a tool for automatically translating high-level symbolic computations into SMT queries. ...
We demonstrate Smten via a new implementation of the Hampi string constraint solver. ...
doi:10.1007/978-3-642-39799-8_45
fatcat:a7wbyboh4vhxdlfgm6p4qw5nhe
Decision Procedures in Soft, Hard and Bio-ware - Follow Up (Dagstuhl Seminar 11272)
2011
Dagstuhl Reports
It was held as a follow-on for a seminar 10161, of the same title, that took place in late April 2010 during the initial eruption of Eyjafjallajökull. ...
The follow-on seminar focused on the remaining objectives, in particular to bio-ware and constraint solving methods. ...
In order to fulfill this need we designed and implemented Hampi, a solver for string constraints over bounded string variables. ...
doi:10.4230/dagrep.1.7.23
dblp:journals/dagstuhl-reports/BjornerNVV11
fatcat:wfkdnqhh6nbdbf5jgtirejs44u
StrSolve: solving string constraints lazily
2012
Automated Software Engineering : An International Journal
This separation enables independent improvement of string constraint solving algorithms and reduces client effort. ...
Stand-alone string constraint solving tools, called decision procedures, have been the focus of recent research in this area. ...
We believe that as string constraint solvers continue to become more and more useful to other program transformations and analyses, scalability will be of paramount importance, and our algorithm is a step ...
doi:10.1007/s10515-012-0111-x
fatcat:s7qpi5zzv5fotbs4xntvksyhpa
Solving string constraints lazily
2010
Proceedings of the IEEE/ACM international conference on Automated software engineering - ASE '10
We present a constraint solving algorithm for equations over string variables. We focus on scalability with regard to the size of the input constraints. ...
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. ...
The Hampi tool [12] is a solver for string constraints over fixed-size string variables. ...
doi:10.1145/1858996.1859080
dblp:conf/kbse/HooimeijerW10
fatcat:3a53gpnl4bee5guzg46c63gsdi
On the Computational Complexity of Satisfiability Solving for String Theories
[article]
2009
arXiv
pre-print
Automated tools for analyzing the security of such applications, thus need to reason about strings. For efficiency reasons, it is desirable to have a solver that treats strings as first-class types. ...
We use this complexity analysis to motivate a byte-blast approach which employs a Boolean encoding of the string constraints to a corresponding Boolean satisfiability problem. ...
Acknowledgments We are grateful to Juan Caballero and Dawn Song for many helpful discussions on formalizing fragments of the theory of strings that are relevant for software security. ...
arXiv:0903.2825v1
fatcat:y333bsyi5zfk3dt6mcanv7qjqq
Solving String Constraints: The Case for Constraint Programming
[chapter]
2013
Lecture Notes in Computer Science
We argue that constraint programming solvers are more suitable than existing solvers for verification tools that have to solve string constraints, as they have a rich tradition of constraints for membership ...
The underlying technique could be applied to other existing propagators for this constraint. ...
[14] argue that custom string solvers should not be designed any more, for sustainability reasons, since powerful off-the-shelf solvers are available: their tool, Hampi, translates a Regular or CFG ...
doi:10.1007/978-3-642-40627-0_31
fatcat:pcfjyr576rapnpaev6yxgukrha
Z3-str: a z3-based string solver for web application analysis
2013
Proceedings of the 2013 9th Joint Meeting on Foundations of Software Engineering - ESEC/FSE 2013
In this paper, we develop a general purpose string solver, called Z3-str, as an extension of the Z3 SMT solver through its plug-in interface. ...
Z3-str treats strings as a primitive type, thus avoiding the inherent limitations observed in many existing solvers that encode strings in terms of other primitives. ...
HAMPI [17] is one of the most popular open-source string solvers. It was originally designed for detection of SQL injection vulnerabilities. ...
doi:10.1145/2491411.2491456
dblp:conf/sigsoft/ZhengZG13
fatcat:jsr7kptgw5erxbtw77e5krqhyu
Path sensitive static analysis of web applications for remote code execution vulnerability detection
2013
2013 35th International Conference on Software Engineering (ICSE)
The analysis is interprocedural, context-and path-sensitive, leveraging a string solver and a SMT solver. • We propose to abstract a web app into two separate subprograms: one capturing the non-string ...
The analysis features a novel way of reasoning both the string and non-string behavior of a web application in a path sensitive fashion. ...
The algorithm queries the STP solver and the HAMPI string solver iteratively and alternatively to derive a consistent path-sensitive solution for both sets of constraints. ...
doi:10.1109/icse.2013.6606611
dblp:conf/icse/ZhengZ13
fatcat:ibnkhdigcbg65b25bdm5l7wtcu
Smten with satisfiability-based search
2014
Proceedings of the 2014 ACM International Conference on Object Oriented Programming Systems Languages & Applications - OOPSLA '14
We present Smten, a high-level language for orchestrating and constructing satisfiability-based search queries. ...
For these applications to scale to larger problem instances, developers cannot rely solely on the sophistication of SAT and SMT solvers to efficiently solve their queries; they must also optimize their ...
HAMPI String Constraint Solving SHAMPI is a Smten-based reimplementation of HAMPI, a string constraint solver whose constraints express membership of strings in both regular languages and fixed-size context-free ...
doi:10.1145/2660193.2660208
dblp:conf/oopsla/UhlerD14
fatcat:shmldn2t3re5jolm3x3xzpzsja
Smten with satisfiability-based search
2014
SIGPLAN notices
We present Smten, a high-level language for orchestrating and constructing satisfiability-based search queries. ...
For these applications to scale to larger problem instances, developers cannot rely solely on the sophistication of SAT and SMT solvers to efficiently solve their queries; they must also optimize their ...
HAMPI String Constraint Solving SHAMPI is a Smten-based reimplementation of HAMPI, a string constraint solver whose constraints express membership of strings in both regular languages and fixed-size context-free ...
doi:10.1145/2714064.2660208
fatcat:xjauvvvvkzgi7ccxe7kt6lhks4
JST: An automatic test generation tool for industrial Java applications with strings
2013
2013 35th International Conference on Software Engineering (ICSE)
The JST tool consists of newly supported essential Java library components and widely used data structures; novel solving techniques for string constraints, regular expressions, and their interactions ...
In this paper we present JST, a tool that automatically generates a high coverage test suite for industrial strength Java applications. ...
in the hybrid stringnumeric solver to make the approach scalable. ...
doi:10.1109/icse.2013.6606649
dblp:conf/icse/GhoshSLC13
fatcat:q7pro32lzjcazdxllk2ozos5ki
« Previous
Showing results 1 — 15 out of 97 results