| タイトル | Modeling Regular Replacement for String Constraint Solving |
| 本文（外部サイト） | http://hdl.handle.net/2060/20100018548 |
| 著者（英） | Li, Chung-Chih; Fu, Xiang |
| 著者所属（英） | Hofstra Univ. |
| 発行日 | 2010-04-01 |
| 言語 | eng |
| 内容記述 | Bugs in user input sanitation of software systems often lead to vulnerabilities. Among them many are caused by improper use of regular replacement. This paper presents a precise modeling of various semantics of regular substitution, such as the declarative, finite, greedy, and reluctant, using finite state transducers (FST). By projecting an FST to its input/output tapes, we are able to solve atomic string constraints, which can be applied to both the forward and backward image computation in model checking and symbolic execution of text processing programs. We report several interesting discoveries, e.g., certain fragments of the general problem can be handled using less expressive deterministic FST. A compact representation of FST is implemented in SUSHI, a string constraint solver. It is applied to detecting vulnerabilities in web applications |
| NASA分類 | Mathematical and Computer Sciences (General) |
| 権利 | Copyright, Distribution as joint owner in the copyright |
|
