首页 | 本学科首页   官方微博 | 高级检索  
     

面向无穷数据的形式模型综述
引用本文:宋富,吴志林.面向无穷数据的形式模型综述[J].软件学报,2016,27(3):682-690.
作者姓名:宋富  吴志林
作者单位:华东师范大学 上海市高可信计算重点实验室 上海 200062,中国科学院软件研究所 计算机科学国家重点实验室 北京 100190
基金项目:国家自然科学基金(61402179,61100062,61272135,61472474,61572478); 上海浦江人才计划(14PJ1403200); 上海晨光人才计划(13CG21)
摘    要:无穷数据广泛存在于计算机程序和数据库系统中.受到形式验证与数据库两方面的应用需求的推动,面向无穷数据的形式模型已经成为理论计算机科学的一个研究热点.本论文对面向无穷数据的形式模型(逻辑与自动机)进行了相对全面详细的总结.本论文主要按照不同自动机模型对无穷数据的处理方式来组织,主要关注相关判定问题,即自动机的非空性问题、语言包含问题,以及逻辑的可满足性问题,的可判定性与复杂性.

关 键 词:无穷数据  自动机  逻辑  非空性问题  语言包含问题  可满足性问题  可判定性  复杂性
收稿时间:2015/7/30 0:00:00
修稿时间:2015/10/20 0:00:00

Survey on Formal Models to Reason about Infinite Data Values
SONG Fu and WU Zhi-Lin.Survey on Formal Models to Reason about Infinite Data Values[J].Journal of Software,2016,27(3):682-690.
Authors:SONG Fu and WU Zhi-Lin
Affiliation:Shanghai Key Laboratory of Trustworthy Computing(East China Normal University), Shanghai 200062, China and State Key Laboratory of Computer Science(Institute of Software, The Chinese Academy of Sciences), Beijing 100190, China
Abstract:Infinite data exists extensively in computer programs and database systems. With the momenta from the applications to formal verification and database management, formal models over infinite alphabets are becoming a research focus of theoretical computer science. The main purpose of this article is to do a relatively complete and detailed survey on this topic. The article is mainly organized according to the different mechanisms of automata models to deal with the infinite data values. The main concern is the decidability and complexity of the related decision problems, that is, the nonemptiness and language inclusion problem of automata, and the satisfiability problem of logics.
Keywords:infinite data  automata  logic  nonemptiness  language inclusion  satisfiability  decidability  complexity
点击此处可从《软件学报》浏览原始摘要信息
点击此处可从《软件学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号