{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T00:56:33Z","timestamp":1771030593449,"version":"3.50.1"},"reference-count":1,"publisher":"World Scientific Pub Co Pte Lt","issue":"08","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2011,12]]},"abstract":"<jats:p> Verification of string manipulation operations is a crucial problem in computer security. In this paper, we present a new relational string verification technique based on multi-track automata. Our approach is capable of verifying properties that depend on relations among string variables. This enables us to prove that vulnerabilities that result from improper string manipulation do not exist in a given program. Our main contributions in this paper can be summarized as follows: (1) We formally characterize the string verification problem as the reachability analysis of string systems and show decidability\/undecidability results for several string analysis problems. (2) We develop a sound symbolic analysis technique for string verification that over-approximates the reachable states of a given string system using multi-track automata and summarization. (3) We evaluate the presented techniques with respect to several string analysis benchmarks extracted from real web applications. <\/jats:p>","DOI":"10.1142\/s0129054111009112","type":"journal-article","created":{"date-parts":[[2012,1,10]],"date-time":"2012-01-10T12:46:00Z","timestamp":1326199560000},"page":"1909-1924","source":"Crossref","is-referenced-by-count":23,"title":["RELATIONAL STRING VERIFICATION USING MULTI-TRACK AUTOMATA"],"prefix":"10.1142","volume":"22","author":[{"given":"FANG","family":"YU","sequence":"first","affiliation":[{"name":"Department of Management Information Systems, National Chengchi University, Taipei, Taiwan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"TEVFIK","family":"BULTAN","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of California, Santa Barbara, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"OSCAR H.","family":"IBARRA","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of California, Santa Barbara, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2012,4,6]]},"reference":[{"key":"rf10","first-page":"437","author":"Minsky M.","journal-title":"Ann. of Math."}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054111009112","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T22:13:22Z","timestamp":1565129602000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054111009112"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,12]]},"references-count":1,"journal-issue":{"issue":"08","published-online":{"date-parts":[[2012,4,6]]},"published-print":{"date-parts":[[2011,12]]}},"alternative-id":["10.1142\/S0129054111009112"],"URL":"https:\/\/doi.org\/10.1142\/s0129054111009112","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,12]]}}}