English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  Items with full text/Total items : 94986/125531 (76%)
Visitors : 31039691      Online Users : 340
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    政大機構典藏 > 商學院 > 資訊管理學系 > 會議論文 >  Item 140.119/121164
    Please use this identifier to cite or link to this item: http://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 SizeFormat
    ase18main-p187-p.pdf1222KbAdobe PDF196View/Open

    All items in 政大典藏 are protected by copyright, with all rights reserved.

    社群 sharing

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback