Filters








449 Hits in 5.7 sec

An SMT Solver for Regular Expressions and Linear Arithmetic over String Length [article]

Murphy Berzish, Mitja Kulczynski, Federico Mora, Florin Manea, Joel D. Day, Dirk Nowotka, Vijay Ganesh
2021 arXiv   pre-print
We present a novel length-aware solving algorithm for the quantifier-free first-order theory over regex membership predicate and linear arithmetic over string length.  ...  be used very effectively to simplify operations on automata representing regular expressions.  ...  Z3str3RE: An SMT Solver for Regular Expressions and Linear Integer Arithmetic over String Length.  ... 
arXiv:2010.07253v3 fatcat:oqgkmvrcergppenq2prw2yrp24

An SMT Solver for Regular Expressions and Linear Arithmetic over String Length [chapter]

Murphy Berzish, Mitja Kulczynski, Federico Mora, Florin Manea, Joel D. Day, Dirk Nowotka, Vijay Ganesh
2021 Lecture Notes in Computer Science  
AbstractWe present a novel length-aware solving algorithm for the quantifier-free first-order theory over regex membership predicate and linear arithmetic over string length.  ...  be used very effectively to simplify operations on automata representing regular expressions.  ...  The work of Federico Mora is supported by NSF grants CNS-1739816 and CCF-1837132, by the DARPA LOGiCS project under contract FA8750-20-C-0156, by the iCyPhycenter, and by gifts from Intel, Amazon, and  ... 
doi:10.1007/978-3-030-81688-9_14 fatcat:xzr23d675vd6rohgxs2d5bocja

A Survey on String Constraint Solving [article]

Roberto Amadini
2021 arXiv   pre-print
String solving approaches have become popular over the last years given the massive use of strings in different application domains like formal analysis, automated testing, database query processing, and  ...  String constraint solving refers to solving combinatorial problems involving constraints over string variables.  ...  Norn is a SMT solver introduced in [4] for an expressive constraint language including word equations, length constraints, and regular membership queries.  ... 
arXiv:2002.02376v8 fatcat:why6oeufmrbozbl22jlf7yivea

A Solver for a Theory of Strings and Bit-vectors [article]

Sanu Subramanian, Murphy Berzish, Yunhui Zheng, Omer Tripp, Vijay Ganesh
2016 arXiv   pre-print
We present a solver for a many-sorted first-order quantifier-free theory T_w,bv of string equations, string length represented as bit-vectors, and bit-vector arithmetic aimed at formal verification, automated  ...  The first accelerates convergence on a consistent assignment of string lengths, and the second, dubbed library-aware SMT solving, fixes summaries for built-in string functions (e.g., strlen in C/C++),  ...  [42] present a solver for the QF many-sorted theory T wlr over word equations, membership predicate over regular expressions, and length function, which consists of the string and numeric sorts.  ... 
arXiv:1605.09446v1 fatcat:iqedcp2v25e6jlcsmd2q4pmydi

A DPLL(T) Theory Solver for a Theory of Strings and Regular Expressions [chapter]

Tianyi Liang, Andrew Reynolds, Cesare Tinelli, Clark Barrett, Morgan Deters
2014 Lecture Notes in Computer Science  
We have implemented them in our SMT solver CVC4 to expand its already large set of built-in theories to a theory of strings with concatenation, length, and membership in regular languages.  ...  Unfortunately, most string solvers today are standalone tools that can reason only about (some fragment) of the theory of strings and regular expressions, sometimes with strong restrictions on the expressiveness  ...  Acknowledgments We would like to thank Nestan Tsiskaridze for her insightful comments, and the developers of Z3-STR for their technical support in using their tool and several clarifications on it.  ... 
doi:10.1007/978-3-319-08867-9_43 fatcat:35m2qckgs5frbfflsev4uj5rju

An efficient SMT solver for string constraints

Tianyi Liang, Andrew Reynolds, Nestan Tsiskaridze, Cesare Tinelli, Clark Barrett, Morgan Deters
2016 Formal methods in system design  
It considers unbounded strings with concatenation, substring, replace, and length functions and accepts equational constraints over strings as well as linear integer arithmetic constraints.  ...  It is built as an extension of z3-str with support for additional string manipulating functions and regular expressions.  ...  We also express our gratitude to the developers of the StarExec service for their assistance and for implementing additional features we requested while running our experimental evaluation on the service  ... 
doi:10.1007/s10703-016-0247-6 fatcat:xz2uweog7vai3g3mlbhb3er53y

Z3str2: an efficient solver for strings, regular expressions, and length constraints

Yunhui Zheng, Vijay Ganesh, Sanu Subramanian, Omer Tripp, Murphy Berzish, Julian Dolby, Xiangyu Zhang
2016 Formal methods in system design  
membership predicate, and linear arithmetic over the length function.  ...  Such solvers typically support a theory of string equations, the length function, and the regular-expression membership predicate.  ...  , and Length Constraints Z3str2: An Efficient Solver for Strings, Regular Expressions, and Length Constraints Yunhui Zheng et al.  ... 
doi:10.1007/s10703-016-0263-6 fatcat:u5bypvelvjdkdmfo7lre27vhae

SMT-Solvers in Action: Encoding and Solving Selected Problems in NP and EXPTIME

Artur Niewiadomski, Siedlce University, Faculty of Science, Institute of Computer Science, 3- Maja 54, 08-110 Siedlce, Poland, Piotr Switalski, Teofil Sidoruk, Wojciech Penczek, Siedlce University, Faculty of Science, Institute of Computer Science, 3- Maja 54, 08-110 Siedlce, Poland, Institute of Computer Science, Polish Academy of Sciences, Jana Kazimierza 5, 01-248 Warsaw, Poland, Siedlce University, Faculty of Science, Institute of Computer Science, 3- Maja 54, 08-110 Siedlce, Poland and Institute of Computer Science, Polish Academy of Sciences, Jana Kazimierza 5, 01-248 Warsaw, Poland
2018 Scientific Annals of Computer Science  
Often, out of necessity or convenience, the formula is expressed as a Boolean combination of predicates over some theory, like, e.g., theory of real and integer arithmetic [24] .  ...  We compare the efficiency of seven modern SMT-solvers for several decision and combinatorial problems: the bounded Post correspondence problem (BPCP), the extended string correction problem (ESCP), and  ...  The authors are grateful for granting access to the computing infrastructure built in the projects No. POIG.02.03.00-00-028/08 "PLATON -Science Services Platform" and No.  ... 
doi:10.7561/sacs.2018.2.269 fatcat:t4qdamggm5abpl22vp6nw3473y

Model Checking Regular Language Constraints [article]

Arlen Cox, Jason Leasure
2017 arXiv   pre-print
Even the fastest SMT solvers have performance problems with regular expressions from real programs.  ...  , which allow for the direct and natural representation of any Boolean combination of regular languages.  ...  Finally, there are a variety of SMT solvers for strings. Hampi [13] is an SMT solver for fixed-length strings with regular expressions and context-free grammars.  ... 
arXiv:1708.09073v1 fatcat:yd3tqtdn7vezdowbejjv5qzgui

JST: An automatic test generation tool for industrial Java applications with strings

Indradeep Ghosh, Nastaran Shafiei, Guodong Li, Wei-Fan Chiang
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  ...  with integer and floating point numbers; and key optimizations that make the tool more efficient.  ...  While implementing symbolic strings we have had to add support for most of the string manipulation methods in the Java String, StringBuilder and StringBuffer libraries.  ... 
doi:10.1109/icse.2013.6606649 dblp:conf/icse/GhoshSLC13 fatcat:q7pro32lzjcazdxllk2ozos5ki

A Decision Procedure for Regular Membership and Length Constraints over Unbounded Strings [chapter]

Tianyi Liang, Nestan Tsiskaridze, Andrew Reynolds, Cesare Tinelli, Clark Barrett
2015 Lecture Notes in Computer Science  
over regular expressions.  ...  We prove that the quantifier-free fragment of the theory of character strings with regular language membership constraints and linear integer constraints over string lengths is decidable.  ...  The two subsolvers communicate by exchanging linear arithmetic constraints over string lengths.  ... 
doi:10.1007/978-3-319-24246-0_9 fatcat:5ie474yokzddhl4opvwnpjj7pm

Effective Search-Space Pruning for Solvers of String Equations, Regular Expressions and Length Constraints [chapter]

Yunhui Zheng, Vijay Ganesh, Sanu Subramanian, Omer Tripp, Julian Dolby, Xiangyu Zhang
2015 Lecture Notes in Computer Science  
membership predicate and linear arithmetic over the length function.  ...  Such solvers typically support a theory of string equations, the length function as well as the regular-expression membership predicate.  ...  We show the efficacy of these techniques through an extensive set of experiments, comparing Z3str2 with the CVC4, S3, Kaluza, PISA and Stranger solvers over four benchmark suites derived from real-world  ... 
doi:10.1007/978-3-319-21690-4_14 fatcat:czrmj6lvk5hkhapow2ojz7v2fy

Z3-str: a z3-based string solver for web application analysis

Yunhui Zheng, Xiangyu Zhang, Vijay Ganesh
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.  ...  The int-sorted terms are standard, with the exception of the length function over string terms. The atomic formulas are equations over string terms, and (in)-equalities over integer terms.  ...  Z3 SMT Solver and Its Plug-in API Z3 [19] is an SMT solver developed by Microsoft Research.  ... 
doi:10.1145/2491411.2491456 dblp:conf/sigsoft/ZhengZG13 fatcat:jsr7kptgw5erxbtw77e5krqhyu

S3

Minh-Thai Trinh, Duc-Hiep Chu, Joxan Jaffar
2014 Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security - CCS '14  
Our solver employs a new algorithm for a constraint language that is expressive enough for widespread applicability.  ...  The algorithm first makes use of a symbolic representation so that membership in a set defined by a regular expression can be encoded as string equations.  ...  DPLL layer, and several built-in theory solvers, such as integer linear arithmetic, bit-vectors, etc.  ... 
doi:10.1145/2660267.2660372 dblp:conf/ccs/TrinhCJ14 fatcat:7csoa4oxhzhy3eez35npc4u35a

Scaling Up DPLL(T) String Solvers Using Context-Dependent Simplification [chapter]

Andrew Reynolds, Maverick Woo, Clark Barrett, David Brumley, Tianyi Liang, Cesare Tinelli
2017 Lecture Notes in Computer Science  
Our evaluation shows that an implementation of these techniques in the SMT solver cvc4 significantly outperforms state-of-the-art string solvers on benchmarks generated using PyEx, a symbolic execution  ...  We describe satisfiability checking techniques in an extended theory of strings that includes operators commonly occurring in these applications, such as contains, index of and replace.  ...  We express our immense gratitude to Peter Chapman, who served as the first lead developer of PyEx.  ... 
doi:10.1007/978-3-319-63390-9_24 fatcat:j7b5bmb22bfitacntcmcd4cczu
« Previous Showing results 1 — 15 out of 449 results