检索结果-内蒙古大学图书馆

ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS 2023年第2期45卷 7-7页

作者： Murali, Adithya Pena, Lucas Loeding, Christof Madhusudan, P. Univ Illinois Dept Comp Sci Urbana IL 61801 USA Rhein Westfal TH Aachen Dept Comp Sci Aachen Germany

We propose a novel logic, Frame logic (FL), that extends first-order logic and recursive definitions with a construct Sp(center dot) that captures the implicit supports of formulas-the precise subset of the universe upon which their meaning depends. Using such supports, we formulate proof rules that facilitate frame reasoning elegantly when the underlying model undergoes change. We show that the logic is expressive by capturing several data-structures and also exhibit a translation from a precise fragment of separation logic to frame logic. Finally, we design a program logic based on frame logic for reasoning with programs that dynamically update heaps that facilitates local specifications and frame reasoning. This program logic consists of both localized proof rules as well as rules that derive the weakest tightest preconditions in frame logic.

关键词： Frame reasoning program verification program logics heap verification first-order logic first-order logic with recursive definitions

来源：评论

学校读者我要写书评

暂无评论

A first-order logic with Frames 1

引用

29th European Symposium on Programming (ESOP) held as part of the European Joint Conferences on Theory and Practice of Software (ETAPS)

作者： Murali, Adithya Pena, Lucas Loeding, Christof Madhusudan, P. Univ Illinois Dept Comp Sci Urbana IL 61801 USA Rhein Westfal TH Aachen Dept Comp Sci Aachen Germany

ISBN: (数字)9783030449148

ISBN: (纸本)9783030449148;9783030449131

We propose a novel logic, called Frame logic (FL), that extends first-order logic (with recursive definitions) using a construct Sp(.) that captures the implicit supports of formulas- the precise subset of the universe upon which their meaning depends. Using such supports, we formulate proof rules that facilitate frame reasoning elegantly when the underlying model undergoes change. We show that the logic is expressive by capturing several data-structures and also exhibit a translation from a precise fragment of separation logic to frame logic. Finally, we design a program logic based on frame logic for reasoning with programs that dynamically update heaps that facilitates local specifications and frame reasoning. This program logic consists of both localized proof rules as well as rules that derive the weakest tightest preconditions in FL.

关键词： Program Verification Program logics Heap Verification first-order logic first-order logic with recursive definitions

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：