Counter Simulations via Higher Order Quantifier Elimination: a preliminary report

S. Ghilardi, E. Pagani
{"title":"Counter Simulations via Higher Order Quantifier Elimination: a preliminary report","authors":"S. Ghilardi, E. Pagani","doi":"10.4204/EPTCS.262.5","DOIUrl":null,"url":null,"abstract":"Quite often, verification tasks for distributed systems are accomplished via counter abstractions. Such abstractions can sometimes be justified via simulations and bisimulations. In this work, we supply logical foundations to this practice, by a specifically designed technique for second order quantifier elimination. Our method, once applied to specifications of verification problems for parameterized distributed systems, produces integer variables systems that are ready to be model-checked by current SMT-based tools. We demonstrate the feasibility of the approach with a prototype implementation and first experiments.","PeriodicalId":422279,"journal":{"name":"International Workshop on Proof Exchange for Theorem Proving","volume":"45 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Workshop on Proof Exchange for Theorem Proving","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4204/EPTCS.262.5","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

Quite often, verification tasks for distributed systems are accomplished via counter abstractions. Such abstractions can sometimes be justified via simulations and bisimulations. In this work, we supply logical foundations to this practice, by a specifically designed technique for second order quantifier elimination. Our method, once applied to specifications of verification problems for parameterized distributed systems, produces integer variables systems that are ready to be model-checked by current SMT-based tools. We demonstrate the feasibility of the approach with a prototype implementation and first experiments.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
通过高阶量词消除的反模拟:初步报告
通常,分布式系统的验证任务是通过计数器抽象完成的。这种抽象有时可以通过模拟和双模拟来证明。在这项工作中,我们通过一种专门设计的二阶量词消除技术,为这种做法提供了逻辑基础。我们的方法一旦应用于参数化分布式系统的验证问题的规范,就会产生整数变量系统,这些系统可以通过当前基于smt的工具进行模型检查。我们通过原型实现和首次实验证明了该方法的可行性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Proof Generation in CDSAT Alethe: Towards a Generic SMT Proof Format (extended abstract) A Framework for Proof-carrying Logical Transformations General Automation in Coq through Modular Transformations Integrating an Automated Prover for Projective Geometry as a New Tactic in the Coq Proof Assistant
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1