An On-The-Fly Algorithm for Conditional Weighted Pushdown Systems

Hua Vy Le Thanh, Xin Li
{"title":"An On-The-Fly Algorithm for Conditional Weighted Pushdown Systems","authors":"Hua Vy Le Thanh, Xin Li","doi":"10.2197/IPSJTRANS.7.132","DOIUrl":null,"url":null,"abstract":"Pushdown systems (PDSs) are well-understood as abstract models of recursive sequential programs, and weighted pushdown systems (WPDSs) are a general framework for solving certain meet-over-all-path problems in program analysis. Conditional WPDSs (CWPDSs) further extend WPDSs to enhance the expressiveness of WPDSs, in which each transition is guarded by a regular language over the stack that specifies conditions under which a transition rule can be applied. CWPDSs or its instance are shown to have wide applications in analysis of objected-oriented programs, access rights analysis, etc. Model checking CWPDSs was shown to be reduced to model checking WPDSs, and an offline algorithm was given that translates CWPSs to WPDSs by synchronizing the underlying PDS and finite state automata accepting regular conditions. The translation, however, can cause an exponential blow-up of the system. This paper presents an on-the-fly model checking algorithm for CWPDSs that synchronizes the computing machineries on-demand while computing post-images of regular configurations. We developed an on-the-fly model checker for CWPDSs and apply it to models generated from the reachability analysis of the HTML5 parser specification. Our preliminary experiments show that, the on-the-fly algorithm drastically outperforms the offline algorithm regarding both practical space and time efficiency.","PeriodicalId":255095,"journal":{"name":"Ipsj Online Transactions","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Ipsj Online Transactions","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2197/IPSJTRANS.7.132","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Pushdown systems (PDSs) are well-understood as abstract models of recursive sequential programs, and weighted pushdown systems (WPDSs) are a general framework for solving certain meet-over-all-path problems in program analysis. Conditional WPDSs (CWPDSs) further extend WPDSs to enhance the expressiveness of WPDSs, in which each transition is guarded by a regular language over the stack that specifies conditions under which a transition rule can be applied. CWPDSs or its instance are shown to have wide applications in analysis of objected-oriented programs, access rights analysis, etc. Model checking CWPDSs was shown to be reduced to model checking WPDSs, and an offline algorithm was given that translates CWPSs to WPDSs by synchronizing the underlying PDS and finite state automata accepting regular conditions. The translation, however, can cause an exponential blow-up of the system. This paper presents an on-the-fly model checking algorithm for CWPDSs that synchronizes the computing machineries on-demand while computing post-images of regular configurations. We developed an on-the-fly model checker for CWPDSs and apply it to models generated from the reachability analysis of the HTML5 parser specification. Our preliminary experiments show that, the on-the-fly algorithm drastically outperforms the offline algorithm regarding both practical space and time efficiency.
条件加权下推系统的动态算法
推下系统作为递归顺序规划的抽象模型被广泛理解,而加权推下系统是解决规划分析中某些路径满足问题的通用框架。条件wpds (cwpds)进一步扩展了wpds,以增强wpds的表达性,其中每个转换都由堆栈上的常规语言保护,该语言指定了可以应用转换规则的条件。cwpds及其实例在面向对象程序分析、访问权限分析等方面具有广泛的应用。将模型检查cwpds简化为模型检查wpds,并给出了一种离线算法,通过同步底层PDS和接受规则条件的有限状态自动机,将cwpds转换为wpds。然而,这种转换会导致系统的指数爆炸。本文提出了一种用于cwpds的实时模型校验算法,该算法在计算规则配置后象的同时,可以按需同步计算机器。我们为cwpds开发了一个动态模型检查器,并将其应用于由HTML5解析器规范的可达性分析生成的模型。我们的初步实验表明,在线算法在实际空间和时间效率方面都大大优于离线算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书