short-paper

The Power of String Solving: Simplicity of Comparison

Authors:

Mitja Kulczynski,

Danny Bøgsted PoulsenAuthors Info & Claims

AST '20: Proceedings of the IEEE/ACM 1st International Conference on Automation of Software Test

Pages 85 - 88

https://doi.org/10.1145/3387903.3389317

Published: 07 October 2020 Publication History

Abstract

The increased interest in string solving in the recent years has made it very hard to identify the right tool to address a particular user's purpose. Firstly, there is a multitude of string solving, each addressing essentially some subset of the general problem. Generally, the addressed fragments are relevant and well motivated, but the lack of comparisons between the existing tools on an equal set of benchmarks, cannot go unnoticed, especially as a common framework to compare solvers seems to be missing. In this paper we gather a set of relevant benchmarks and introduce our new benchmarking framework ZaligVinder to address this purpose.

References

[1]

[n.d.]. IBM AppScan Source web site. https://www.ibm.com/dk-da/security/application-security/appscan.

[2]

P. A. Abdulla, M. F.i Atig, Y. Chen, B. P. Diep, L. Holík, A. Rezine, and P. Rümmer. 2018. Trau: SMT solver for string constraints. In Proc. FMCAD. IEEE, 1--5.

[3]

P. A. Abdulla, M. F. Atig, Y. Chen, L. Holík, A. Rezine, P. Rümmer, and J. Stenman. 2014. String constraints for verification. In Proc. CAV. Springer, 150--166.

[4]

P. A. Abdulla, M. F. Atig, Y. Chen, L. Holík, A. Rezine, P. Rümmer, and J. Stenman. 2015. Norn: An SMT Solver for String Constraints. In Proc. CAV, Part 1 (LNCS), Vol. 9206. 462--469.

[5]

T. Ball and J. Daniel. 2014. Deconstructing Dynamic Symbolic Execution. Proc. Marktoberdorf Summer School on Dependable Software Systems Engineering (2014).

[6]

C. W. Barrett, C. L. Conway, M. Deters, L. Hadarean, D. Jovanovic, T. King, A. Reynolds, and C. Tinelli. 2011. CVC4. In Proc. CAV (LNCS), Vol. 6806. 171--177.

[7]

Murphy Berzish, Vijay Ganesh, and Yunhui Zheng. 2017. Z3str3: A string solver with theory-aware heuristics. In Proc. FMCAD. 55--59.

[8]

D. Blotsky, F. Mora, M. Berzish, Y. Zheng, I. Kabir, and V. Ganesh. 2018. Stringfuzz: A fuzzer for string solvers. In Proc. CAV. Springer, 45--51.

[9]

T. Brennan, N. Tsiskaridze, N. Rosner, A.i Aydin, and T. Bultan. 2017. Constraint normalization and parameterized caching for quantitative program analysis. In Proc. 11th Joint Meeting on Foundations of Software Engineering. ACM, 535--546.

[10]

J. D. Day, T. Ehlers, M. Kulczynski, F. Manea, D. Nowotka, and D. B. Poulsen. 2019. On Solving Word Equations Using SAT. In Proc. RP (LNCS), Vol. 11674. Springer, 93--106.

[11]

J. D. Day, M. Kulczynski, F. Manea, D. Nowotka, and D. B Poulsen. 2020. Rule-based Word Equation Solving. In Proc. FormaliSE. IEEE.

Digital Library

[12]

J. D. Day, V.Ganesh, P. He, F. Manea, and D. Nowotka. 2018. The Satisfiability of Word Equations: Decidable and Undecidable Theories. In Proc. RP (LNCS), Vol. 11123. 15--29.

[13]

S. Kausler and E. Sherman. 2014. Evaluation of string constraint solvers in the context of symbolic execution. In Proc. ASE - IEEE/ACM. ACM, 259--270.

[14]

T. Liang, A. Reynolds, N. Tsiskaridze, C. Tinelli, C. Barrett, and M. Deters. 2016. An efficient SMT solver for string constraints. Formal Methods in System Design 48, 3 (2016), 206--234.

Digital Library

[15]

L. Luu, S. Shinde, P. Saxena, and B. Demsky. 2014. A model counter for constraints over unbounded strings. In ACM SIGPLAN Notices, Vol. 49. ACM, 565--576.

[16]

G. S. Makanin. 1977. The problem of solvability of equations in a free semigroup. Sbornik: Mathematics 32, 2 (1977), 129--198.

[17]

A. Reynolds, M. Woo, C. Barrett, D. Brumley, T. Liang, and C. Tinelli. 2017. Scaling up DPLL (T) string solvers using context-dependent simplification. In Proc. CAV. Springer, 453--474.

[18]

P. Saxena, D. Akhawe, S. Hanna, F. Mao, S. McCamant, and D. Song. [n.d.]. Kaluza web site. webblaze.cs.berkeley.edu/2010/kaluza/. Accessed: 2020-01-01.

[19]

P. Saxena, D. Akhawe, S. Hanna, F. Mao, S. McCamant, and D. Song. 2010. A Symbolic Execution Framework for JavaScript. In Proc. 31st S&P. 513--528.

[20]

T. Tateishi, M. Pistoia, and O. Tripp. 2013. Path-and index-sensitive string analysis based on monadic second-order logic. TOSEM 22, 4 (2013), 33.

Digital Library

[21]

J. Thomé, L. K. Shar, D. Bianculli, and L. Briand. 2018. An integrated approach for effective injection vulnerability analysis of web applications through security slicing and hybrid constraint solving. IEEE TSE (2018).

[22]

F. Yu, M. Alkhalaf, and T. Bultan. 2010. STRANGER: An Automata-based String Analysis Tool for PHP. In Proc. TACAS (Paphos, Cyprus) (TACAS'10). Springer, 154--157.

[23]

Y. Zheng, V. Ganesh, S. Subramanian, O. Tripp, M. Berzish, J. Dolby, and X.a Zhang. 2017. Z3str2: an efficient solver for strings, regular expressions, and length constraints. Formal Methods in System Design 50, 2--3 (2017), 249--288.

Digital Library

[24]

Y. Zheng, X. Zhang, and V. Ganesh. 2013. Z3-str: A z3-based string solver for web application analysis. In Proceedings of the 2013 9th Joint Meeting on Foundations of Software Engineering. ACM, 114--124.

Cited By

Lotz KKulczynski MNowotka DPoulsen DSchlichtkrull A(2023)Verified Verifying: SMT-LIB for Strings in IsabelleImplementation and Application of Automata10.1007/978-3-031-40247-0_15(206-217)Online publication date: 10-Aug-2023
https://doi.org/10.1007/978-3-031-40247-0_15
Kulczynski MLotz KNowotka DPoulsen D(2022)Solving String Theories Involving Regular Membership Predicates Using SATModel Checking Software10.1007/978-3-031-15077-7_8(134-151)Online publication date: 21-May-2022
https://dl.acm.org/doi/10.1007/978-3-031-15077-7_8
Amadini R(2021)A Survey on String Constraint SolvingACM Computing Surveys10.1145/348419855:1(1-38)Online publication date: 23-Nov-2021
https://dl.acm.org/doi/10.1145/3484198
Show More Cited By

Recommendations

String deduplication during garbage collection in virtual machines
CASCON '16: Proceedings of the 26th Annual International Conference on Computer Science and Software Engineering

Memory management is a significant topic in virtual machine research. As allocation and deallocation of objects is performed automatically, garbage collection (GC) has become an important field of research. It aims to speed up and optimize the execution ...
Shortest string containing all permutations

In this paper, we consider the problem of constructing a shortest string of {1,2,...,n} containing all permutations on n elements as subsequences. For example, the string 1 2 1 3 1 2 1 contains the 6 (=3!) permutations of {1,2,3} and no string with less ...
Solving String Constraints Using SAT
Computer Aided Verification
Abstract
String solvers are automated-reasoning tools that can solve combinatorial problems over formal languages. They typically operate on restricted first-order logic formulas that include operations such as string concatenation, substring relationship, ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

AST '20: Proceedings of the IEEE/ACM 1st International Conference on Automation of Software Test

October 2020

122 pages

ISBN:9781450379571

DOI:10.1145/3387903

Copyright © 2020 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Sponsors

SIGSOFT: ACM Special Interest Group on Software Engineering

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 07 October 2020

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Short-paper
Research
Refereed limited

Conference

AST '20

Sponsor:

SIGSOFT

AST '20: IEEE/ACM 15nd International Conference on Automation of Software Test

October 7 - 8, 2020

Seoul, Republic of Korea

Upcoming Conference

ICSE 2025

2025 IEEE/ACM 46th International Conference on Software Engineering

April 26 - May 3, 2025

Ottawa , ON , Canada

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

9
Total Citations
View Citations
130
Total Downloads

Downloads (Last 12 months)15
Downloads (Last 6 weeks)1

Reflects downloads up to 26 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Lotz KKulczynski MNowotka DPoulsen DSchlichtkrull A(2023)Verified Verifying: SMT-LIB for Strings in IsabelleImplementation and Application of Automata10.1007/978-3-031-40247-0_15(206-217)Online publication date: 10-Aug-2023
https://doi.org/10.1007/978-3-031-40247-0_15
Kulczynski MLotz KNowotka DPoulsen D(2022)Solving String Theories Involving Regular Membership Predicates Using SATModel Checking Software10.1007/978-3-031-15077-7_8(134-151)Online publication date: 21-May-2022
https://dl.acm.org/doi/10.1007/978-3-031-15077-7_8
Amadini R(2021)A Survey on String Constraint SolvingACM Computing Surveys10.1145/348419855:1(1-38)Online publication date: 23-Nov-2021
https://dl.acm.org/doi/10.1145/3484198
Mues MHowar FGrundy J(2021)Data-driven design and evaluation of SMT meta-solving strategiesProceedings of the 36th IEEE/ACM International Conference on Automated Software Engineering10.1109/ASE51524.2021.9678881(179-190)Online publication date: 15-Nov-2021
https://dl.acm.org/doi/10.1109/ASE51524.2021.9678881
Mora FBerzish MKulczynski MNowotka DGanesh V(2021)Z3str4: A Multi-armed String SolverFormal Methods10.1007/978-3-030-90870-6_21(389-406)Online publication date: 10-Nov-2021
https://doi.org/10.1007/978-3-030-90870-6_21
Berzish MDay JGanesh VKulczynski MManea FMora FNowotka D(2021)String Theories Involving Regular Membership Predicates: From Practice to Theory and BackCombinatorics on Words10.1007/978-3-030-85088-3_5(50-64)Online publication date: 6-Sep-2021
https://doi.org/10.1007/978-3-030-85088-3_5
Berzish MKulczynski MMora FManea FDay JNowotka DGanesh V(2021)An SMT Solver for Regular Expressions and Linear Arithmetic over String LengthComputer Aided Verification10.1007/978-3-030-81688-9_14(289-312)Online publication date: 15-Jul-2021
https://doi.org/10.1007/978-3-030-81688-9_14
Kulczynski MManea FNowotka DPoulsen D(2021)ZaligVinder: A generic test framework for string solversJournal of Software: Evolution and Process10.1002/smr.240035:4Online publication date: 28-Oct-2021
https://doi.org/10.1002/smr.2400
Day JKulczynski MManea FNowotka DPoulsen D(2020)Rule-based Word Equation SolvingProceedings of the 8th International Conference on Formal Methods in Software Engineering10.1145/3372020.3391556(87-97)Online publication date: 7-Oct-2020
https://dl.acm.org/doi/10.1145/3372020.3391556

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten