政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/121164

English | 正體中文 | 简体中文 | Post-Print筆數 : 27 | Items with full text/Total items : 113648/144635 (79%)
Visitors : 51687230 Online Users : 603

RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.

Home ‧ Login ‧ Upload ‧ Help ‧ About ‧ Administer

政大機構典藏 > 商學院 > 資訊管理學系 > 會議論文 > Item 140.119/121164

Please use this identifier to cite or link to this item: https://nccur.lib.nccu.edu.tw/handle/140.119/121164

Title:	A Symbolic Model Checking Approach to the Analysis of String and Length Constraints
Authors:	郁方 Yu, Fang Wang, Hung-En;Chen, Shih-Yu;Yu, Fang;Jiang, Jie-Hong R.
Contributors:	資管系
Keywords:	length constraint;string analysis;symbolic model checking
Date:	2018-07
Issue Date:	2018-11-29 16:23:06 (UTC+8)
Abstract:	Strings with length constraints are prominent in software security analysis. Recent endeavors have made significant progress in developing constraint solvers for strings and integers. Most prior methods are based on deduction with inference rules or analysis using automata. The former may be inefficient when the constraints involve complex string manipulations such as language replacement; the latter may not be easily extended to handle length constraints and may be inadequate for counterexample generation due to approximation. Inspired by recent work on string analysis with logic circuit representation, we propose a new method for solving string with length constraints by an implicit representation of automata with length encoding. The length-encoded automata are of infinite states and can represent languages beyond regular expressions. By converting string and length constraints into a dependency graph of manipulations over length-encoded automata, a symbolic model checker for infinite state systems can be leveraged as an engine for the analysis of string and length constraints. Experiments show that our method has its unique capability of handling complex string and length constraints not solvable by existing methods.
Relation:	ASE 2018 Proceedings of the 33rd ACM/IEEE International Conference on Automated Software Engineering , Pages 623-633 , Montpellier, France — September 03 - 07, 2018
Data Type:	conference
DOI 連結:	https://doi.org/10.1145/3238147.3238189
DOI:	10.1145/3238147.3238189
Appears in Collections:	[資訊管理學系] 會議論文

Files in This Item:

File	Description	Size	Format
ase18main-p187-p.pdf		1222Kb	Adobe PDF2	451	View/Open

社群 sharing

著作權政策宣告 Copyright Announcement

1.本網站之數位內容為國立政治大學所收錄之機構典藏，無償提供學術研究與公眾教育等公益性使用，惟仍請適度，合理使用本網站之內容，以尊重著作權人之權益。商業上之利用，則請先取得著作權人之授權。
The digital content of this website is part of National Chengchi University Institutional Repository. It provides free access to academic research and public education for non-commercial use. Please utilize it in a proper and reasonable manner and respect the rights of copyright owners. For commercial use, please obtain authorization from the copyright owner in advance.

2.本網站之製作，已盡力防止侵害著作權人之權益，如仍發現本網站之數位內容有侵害著作權人權益情事者，請權利人通知本網站維護人員(nccur@nccu.edu.tw)，維護人員將立即採取移除該數位著作等補救措施。
NCCU Institutional Repository is made to protect the interests of copyright owners. If you believe that any material on the website infringes copyright, please contact our staff(nccur@nccu.edu.tw). We will remove the work from the repository and investigate your claim.

Loading...