| 摘要: |
| 无穷数据广泛存在于计算机程序和数据库系统中.受到形式验证与数据库两方面应用需求的推动,面向无穷数据的形式模型已经成为理论计算机科学的研究热点之一.对面向无穷数据的形式模型(逻辑与自动机)进行了相对全面而详细的总结.主要按照不同自动机模型对无穷数据的处理方式加以组织,并关注相关判定问题,即:自动机的非空性问题、语言包含问题以及逻辑的可满足性问题的可判定性与复杂性. |
| 关键词: 无穷数据 自动机 逻辑 非空性 语言包含 可满足性 可判定性 复杂性 |
| DOI：10.13328/j.cnki.jos.004989 |
| 分类号: |
| 基金项目:国家自然科学基金(61402179,61100062,61272135,61472474,61572478);上海浦江人才计划(14PJ1403200);上海晨光人才计划(13CG21) |
|
| Survey on Formal Models to Reason about Infinite Data Values |
|
SONG Fu1, WU Zhi-Lin2
|
|
1.Shanghai Key Laboratory of Trustworthy Computing(East China Normal University), Shanghai 200062, China;2.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.Driven by the need from the applications of 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 organized according to the different mechanisms of automata models to deal with the infinite data values.The main focus is on 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. |
| Key words: infinite data automata logic nonemptiness language inclusion satisfiability decidability complexity |
