WEKO3
アイテム
Solving String Constraints with Streaming String Transducers
https://ipsj.ixsq.nii.ac.jp/records/200715
https://ipsj.ixsq.nii.ac.jp/records/200715e953e6bf-c47b-4785-9ada-670fc8a9fec7
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
IPSJ-TPRO1205002.pdf (710.7 kB)
|
Copyright (c) 2019 by the Information Processing Society of Japan
|
|
| オープンアクセス | ||
| Item type | Trans(1) | |||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 公開日 | 2019-11-20 | |||||||||||
| タイトル | ||||||||||||
| タイトル | Solving String Constraints with Streaming String Transducers | |||||||||||
| タイトル | ||||||||||||
| 言語 | en | |||||||||||
| タイトル | Solving String Constraints with Streaming String Transducers | |||||||||||
| 言語 | ||||||||||||
| 言語 | eng | |||||||||||
| キーワード | ||||||||||||
| 主題Scheme | Other | |||||||||||
| 主題 | [通常論文] string constraints, streaming string transducers, transducers | |||||||||||
| 資源タイプ | ||||||||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||||||||
| 資源タイプ | journal article | |||||||||||
| 著者所属 | ||||||||||||
| Department of Mathematical and Computing Science, Tokyo Institute of Technology | ||||||||||||
| 著者所属 | ||||||||||||
| Department of Mathematical and Computing Science, Tokyo Institute of Technology | ||||||||||||
| 著者所属 | ||||||||||||
| Department of Mathematical and Computing Science, Tokyo Institute of Technology | ||||||||||||
| 著者所属(英) | ||||||||||||
| en | ||||||||||||
| Department of Mathematical and Computing Science, Tokyo Institute of Technology | ||||||||||||
| 著者所属(英) | ||||||||||||
| en | ||||||||||||
| Department of Mathematical and Computing Science, Tokyo Institute of Technology | ||||||||||||
| 著者所属(英) | ||||||||||||
| en | ||||||||||||
| Department of Mathematical and Computing Science, Tokyo Institute of Technology | ||||||||||||
| 著者名 |
Qizhen, Zhu
× Qizhen, Zhu
× Hitoshi, Akama
× Yasuhiko, Minamide
|
|||||||||||
| 著者名(英) |
Qizhen, Zhu
× Qizhen, Zhu
× Hitoshi, Akama
× Yasuhiko, Minamide
|
|||||||||||
| 論文抄録 | ||||||||||||
| 内容記述タイプ | Other | |||||||||||
| 内容記述 | We present a procedure to solve the satisfiability problem of string constraints consisting of (i) string concatenation and rational transductions of string variables restricted to be in the “straight-line” fragment, (ii) regular constraints to string variables, and (iii) integer constraints involving the length of string variables. We represent each atomic string constraint by a streaming string transducer. By the sequential composition of streaming string transducers, we obtain a single streaming string transducer. The input straight-line constraint is satisfiable if and only if the domain of the composed streaming string transducer is not empty. In addition, by calculating the Parikh image of the composed streaming string transducers, we can represent the constraints among the length of string variables as a semi-linear set. Then the integer constraints together with the Parikh image can be solved by existing SMT solvers. We have implemented this procedure and performed experiments on several string constraints. Our implementation is slower than other solvers for general cases but performs better for some special cases. ------------------------------ This is a preprint of an article intended for publication Journal of Information Processing(JIP). This preprint should not be cited. This article should be cited as: Journal of Information Processing Vol.27(2019) (online) ------------------------------ |
|||||||||||
| 論文抄録(英) | ||||||||||||
| 内容記述タイプ | Other | |||||||||||
| 内容記述 | We present a procedure to solve the satisfiability problem of string constraints consisting of (i) string concatenation and rational transductions of string variables restricted to be in the “straight-line” fragment, (ii) regular constraints to string variables, and (iii) integer constraints involving the length of string variables. We represent each atomic string constraint by a streaming string transducer. By the sequential composition of streaming string transducers, we obtain a single streaming string transducer. The input straight-line constraint is satisfiable if and only if the domain of the composed streaming string transducer is not empty. In addition, by calculating the Parikh image of the composed streaming string transducers, we can represent the constraints among the length of string variables as a semi-linear set. Then the integer constraints together with the Parikh image can be solved by existing SMT solvers. We have implemented this procedure and performed experiments on several string constraints. Our implementation is slower than other solvers for general cases but performs better for some special cases. ------------------------------ This is a preprint of an article intended for publication Journal of Information Processing(JIP). This preprint should not be cited. This article should be cited as: Journal of Information Processing Vol.27(2019) (online) ------------------------------ |
|||||||||||
| 書誌レコードID | ||||||||||||
| 収録物識別子タイプ | NCID | |||||||||||
| 収録物識別子 | AA11464814 | |||||||||||
| 書誌情報 |
情報処理学会論文誌プログラミング（PRO） 巻 12, 号 5, 発行日 2019-11-20 |
|||||||||||
| ISSN | ||||||||||||
| 収録物識別子タイプ | ISSN | |||||||||||
| 収録物識別子 | 1882-7802 | |||||||||||
| 出版者 | ||||||||||||
| 言語 | ja | |||||||||||
| 出版者 | 情報処理学会 | |||||||||||
