Publication Details
Efficient handling of string-number conversion
Janků Petr, Ing. (DITS)
BUI PHI, D.
Chen Yu-Fang
LIN, H.
WU, W.
Abdulla Parosh
Atig Mohamed (FIT)
String Solver, Formal Verification, Automata
String-number conversion is an important class of constraints needed for the symbolic execution of string-manipulating programs. In particular solving string constraints with string-number conversion is necessary for the analysis of scripting languages such as JavaScript and Python, where string-number conversion is a part of the definition of the core semantics of these languages. However, solving this type of constraint is very challenging for the state-of-the-art solvers. We propose in this paper an approach that can efficiently support both string-number conversion and other common types of string constraints. Experimental results show that it significantly outperforms other state-of-the-art tools on benchmarks that involves string-number conversion.
@inproceedings{BUT169183,
author="HOLÍK, L. and JANKŮ, P. and BUI PHI, D. and CHEN, Y. and LIN, H. and WU, W. and ABDULLA, P. and ATIG, M.",
title="Efficient handling of string-number conversion",
booktitle="Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation",
year="2020",
series="Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)",
pages="943--957",
publisher="Association for Computing Machinery",
address="New York",
doi="10.1145/3385412.3386034",
isbn="978-1-4503-7613-6",
url="https://dl.acm.org/doi/10.1145/3385412.3386034"
}