paperbot · PL 论文追踪

全部论文 待读 收藏

P2 A Fixpoint Logic and Dependent Effects for Temporal Property Verification

用于时序性质验证的不动点逻辑与依赖效应
LICS Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science2018匹配度 3/10 · 论文研究高阶函数式程序的时序性质验证,属于类型系统、效应系统与不动点逻辑的形式化方法,与用户对程序分析和形式化验证的兴趣有方法论交集;但它不涉及 LLM/Agent、浮点程序分析或贝叶斯程序分析,也未面向 ML 系统或 Agentic 程序。引用 27 inbox
Yoji Nanjo, Hiroshi Unno, Eric Koskinen, Tachio Terauchi
crossref: 2026-09-12

AI 速览

一句话:提出依赖精化类型与效应系统及不动点逻辑演绎方法,以组合化验证高阶函数式程序的时序性质。

高阶函数式程序的时序性质验证长期面临组合性与自动化之间的权衡。本文提出一种依赖精化类型与效应系统,其中依赖时序效应是事件序列和程序值上的不动点逻辑谓词,可突破以往非依赖时序效应的限制,并把程序各部分的时序行为概括为效应后组合。作者进一步将类型检查与可类型化归约为求解一阶不动点逻辑约束,并给出新的演绎系统:借助不变式与良基关系进行推理,将同时含最小与最大不动点的公式化归为基于谓词的推理。其理论结果表明良类型程序满足给定时序性质,并为自动化验证提供算法途径。

问题
现有高阶函数式程序的时序验证方法往往难以兼顾组合性与自动化。
方法
提出依赖精化类型与效应系统,将依赖时序效应表示为事件序列和程序值上的不动点逻辑谓词;把类型检查与可类型化归约为求解一阶不动点逻辑约束,并设计基于不变式和良基关系的演绎求解系统。
评估
通过归约与演绎系统论证类型检查的算法可行性;摘要未报告实验评估,理论结论是良类型程序满足给定时序性质。
原文摘要(Abstract)

Existing approaches to temporal verification of higher-order functional programs have either sacrificed compositionality in favor of achieving automation or vice-versa. In this paper we present a dependent-refinement type & effect system to ensure that well-typed programs satisfy given temporal properties, and also give an algorithmic approach---based on deductive reasoning over a fixpoint logic---to typing in this system. The first contribution is a novel type-and-effect system capable of expressing dependent temporal effects, which are fixpoint logic predicates on event sequences and program values, extending beyond the (non-dependent) temporal effects used in recent proposals. Temporal effects facilitate compositional reasoning whereby the temporal behavior of program parts are summarized as effects and combined to form those of the larger parts. As a second contribution, we show that type checking and typability for the type system can be reduced to solving first-order fixpoint logic constraints. Finally, we present a novel deductive system for solving such constraints. The deductive system consists of rules for reasoning via invariants and well-founded relations, and is able to reduce formulas containing both least and greatest fixpoints to predicate-based reasoning.

链接与引用

DOI 原文 ·

BibTeX
@inproceedings{paperbot4372,
  title = {A Fixpoint Logic and Dependent Effects for Temporal Property Verification},
  author = {Yoji Nanjo and Hiroshi Unno and Eric Koskinen and Tachio Terauchi},
  booktitle = {LICS},
  year = {2018},
  doi = {10.1145/3209108.3209204}
}