主页期刊介绍编委会编辑部服务介绍道德声明在线审稿编委办公编辑办公English
2020-2021年专刊出版计划 微信服务介绍 最新一期:2020年第7期
     
在线出版
各期目录
纸质出版
分辑系列
论文检索
论文排行
综述文章
专刊文章
美文分享
各期封面
E-mail Alerts
RSS
旧版入口
中国科学院软件研究所
  
投稿指南 问题解答 下载区 收费标准 在线投稿
杨秋松,李明树.参数化系统安全性的启发式符号验证.软件学报,2009,20(6):1444-1456
参数化系统安全性的启发式符号验证
Heuristic Symbolic Verification of Safety Properties for Parameterized Systems
投稿时间:2007-11-12  修订日期:2008-03-28
DOI:
中文关键词:  参数化系统  安全性  向上封闭集合  启发式搜索  符号验证
英文关键词:parameterized system  safety property  upward-closed set  heuristic search  symbolic verification
基金项目:Supported by the National Natural Science Foundation of China under Grant No.60573082 (国家自然科学基金); the National High-Tech Research and Development Plan of China under Grant No.2006AA01Z185 (国家高技术研究发展计划(863))
作者单位
杨秋松 中国科学院 软件研究所 互联网软件技术实验室,北京 100190
中国科学院 研究生院,北京 100049 
李明树 中国科学院 软件研究所 互联网软件技术实验室,北京 100190
中国科学院 软件研究所 计算机科学国家重点实验室,北京 100190 
摘要点击次数: 3612
全文下载次数: 3690
中文摘要:
      参数化系统(paramterized system)是指包含特定有限状态进程多个实例的并发系统,其中的参数是指系统内进程实例的数目,即系统的规模.反向可达性分析(backward reachability analysis)已被广泛用于验证参数化系统是否满足以向上封闭(upward-closed)集合表示的安全性(safety property).与有限状态系统验证相类似,参数化系统的验证同样也面临着状态爆炸(state explosion)问题,并且模型检测算法的有效性依赖于如何采用有效的数据结构表示状
英文摘要:
      A parameterized system is a system that involves numerous instantiations of the same finite-state process, and depends on a parameter which defines its size. The backward reachability analysis has been widely used for verifying parameterized systems against safety properties modeled as a set of upward-closed sets. As in the finite-state case, the verification of parameterized systems also faces the state explosion problem and the success of model checking depends on the data structure used for representing a set of states. Several constraint-based approaches have been proposed to symbolically represent upward-closed sets with infinite states. But those approaches are still facing the symbolic state explosion problem or the containment problem, i.e. to decide whether a set of concrete states represented by one set of constraints is a subset of another set of constraints, which is co-NP complete. As a result, those examples investigated in the literature would be considered of negligible size in finite-state model checking. This paper presents several heuristic rules specific to parameterized systems that can help to mitigate the problem. Experimental results show that the efficiency is significantly improved and the heuristic algorithm is several orders of magnitude faster than the original one in certain cases.
HTML  下载PDF全文  查看/发表评论  下载PDF阅读器
 

京公网安备 11040202500064号

主办单位:中国科学院软件研究所 中国计算机学会 京ICP备05046678号-4
编辑部电话:+86-10-62562563 E-mail: jos@iscas.ac.cn
Copyright 中国科学院软件研究所《软件学报》版权所有 All Rights Reserved
本刊全文数据库版权所有,未经许可,不得转载,本刊保留追究法律责任的权利