paperbot · PL 论文追踪

全部论文 待读 收藏

P2 Citations for the Test-of-Time Award from 2001

2001年Test-of-Time Award获奖引文
LICS 2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)2021匹配度 2/10 · 该文只是LICS 2001测试时间奖的公布与引用说明,涉及数组判定过程与依赖类型终止验证,属于程序验证/类型系统方向,但未涉及用户核心关注的LLM/Agent、浮点程序分析、贝叶斯程序分析及其与静态分析/形式化验证的交叉,且本身不是研究论文。引用 0 inbox
crossref: 2026-09-12

AI 速览

一句话:公布2021年LICS 2001测试时间奖,表彰两篇发表于LICS 2001的论文。

本文是2021年IEEE Logic in Computer Science (LICS) 2001测试时间奖(Test-of-Time Award)的引文/颁奖说明。该奖项授予两篇发表于LICS 2001的论文:Aaron Stump、Clark W. Barrett、David L. Dill和Jeremy R. Levitt的《A Decision Procedure for an Extensional Theory of Arrays》,以及Hongwei Xi的《Dependent Types for Program Termination Verification》。引文旨在表彰这两项工作对逻辑与计算机科学领域的长期影响。除公布获奖信息外,本文不提出新的研究问题、方法或评估结果。

问题
无具体研究问题;本文是颁奖引文,仅公布LICS 2001测试时间奖的两篇获奖论文。
方法
无研究方法;仅以引文形式列出获奖论文及其作者。
评估
无技术评估;不包含实验、定理证明或基准测试。
原文摘要(Abstract)

Two awards were made in 2021 to honour outstanding papers from the IEEE Symposium On Logic In Computer Science 2001 held in Boston, MA, USA. The awards went to "A Decision Procedure for an Extensional Theory of Arrays", by Aaron Stump, Clark W. Barrett, David L. Dill, and Jeremy R. Levitt and to "Dependent Types for Program Termination Verification", by Hongwei Xi.

链接与引用

DOI 原文 · PDF(开放获取) ·

BibTeX
@inproceedings{paperbot6186,
  title = {Citations for the Test-of-Time Award from 2001},
  author = {},
  booktitle = {LICS},
  year = {2021},
  doi = {10.1109/lics52264.2021.9470625}
}