Unfolding state variables improves model checking performance

IF 1 4区 计算机科学 Q3 COMPUTER SCIENCE, THEORY & METHODS Theoretical Computer Science Pub Date : 2025-05-22 Epub Date: 2025-03-13 DOI:10.1016/j.tcs.2025.115181
Anna Stramaglia, Jeroen J.A. Keiren, Thomas Neele
{"title":"Unfolding state variables improves model checking performance","authors":"Anna Stramaglia,&nbsp;Jeroen J.A. Keiren,&nbsp;Thomas Neele","doi":"10.1016/j.tcs.2025.115181","DOIUrl":null,"url":null,"abstract":"<div><div>When describing the behavior of systems, state variables are typically modeled using complex data types. This use of data types allows for concise models that are easy to read. However, model checking tools that aim to automatically establish the correctness of such models use static analyses of state variables to improve their performance. Therefore, the use of complex data types in behavioral models negatively affects the performance of model checking tools. To address this, in this article we revisit a technique by Groote and Lisser that can be used to replace a single state variable of a complex data type by multiple state variables of simpler data types. We introduce and study several extensions in the context of the process algebraic specification language mCRL2, and establish their correctness. We demonstrate that our technique typically reduces the verification times when using symbolic model checking, and show that sometimes it enables static analysis to reduce the underlying state space from infinite to finite.</div></div>","PeriodicalId":49438,"journal":{"name":"Theoretical Computer Science","volume":"1038 ","pages":"Article 115181"},"PeriodicalIF":1.0000,"publicationDate":"2025-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Theoretical Computer Science","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0304397525001197","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2025/3/13 0:00:00","PubModel":"Epub","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

Abstract

When describing the behavior of systems, state variables are typically modeled using complex data types. This use of data types allows for concise models that are easy to read. However, model checking tools that aim to automatically establish the correctness of such models use static analyses of state variables to improve their performance. Therefore, the use of complex data types in behavioral models negatively affects the performance of model checking tools. To address this, in this article we revisit a technique by Groote and Lisser that can be used to replace a single state variable of a complex data type by multiple state variables of simpler data types. We introduce and study several extensions in the context of the process algebraic specification language mCRL2, and establish their correctness. We demonstrate that our technique typically reduces the verification times when using symbolic model checking, and show that sometimes it enables static analysis to reduce the underlying state space from infinite to finite.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
展开状态变量可以提高模型检查性能
在描述系统行为时,通常使用复杂的数据类型对状态变量进行建模。这种数据类型的使用允许建立易于阅读的简明模型。然而,旨在自动建立此类模型正确性的模型检查工具使用状态变量的静态分析来提高其性能。因此,在行为模型中使用复杂的数据类型会对模型检查工具的性能产生负面影响。为了解决这个问题,本文将重新讨论Groote和Lisser的一种技术,该技术可用于用更简单的数据类型的多个状态变量替换复杂数据类型的单个状态变量。在过程代数规范语言mCRL2的背景下,介绍和研究了几种扩展,并证明了它们的正确性。我们演示了我们的技术在使用符号模型检查时通常减少了验证时间,并且表明有时它使静态分析能够将底层状态空间从无限减少到有限。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Theoretical Computer Science
Theoretical Computer Science 工程技术-计算机:理论方法
CiteScore
2.60
自引率
18.20%
发文量
471
审稿时长
12.6 months
期刊介绍: Theoretical Computer Science is mathematical and abstract in spirit, but it derives its motivation from practical and everyday computation. Its aim is to understand the nature of computation and, as a consequence of this understanding, provide more efficient methodologies. All papers introducing or studying mathematical, logic and formal concepts and methods are welcome, provided that their motivation is clearly drawn from the field of computing.
期刊最新文献
Optimally reconnecting graphs against an edge-destroying adversary Softening the impact of collisions in contention resolution Undecidability of polynomial inequalities in subset densities and additive energies Hamiltonicity parameterized by mim-width is (indeed) para-NP-hard Approximating submodular matroid-constrained partitioning
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1