ITR: Probabilistic Checking of Proofs

ITR:证据的概率检查

基本信息

  • 批准号:
    0312575
  • 负责人:
  • 金额:
    --
  • 依托单位:
  • 依托单位国家:
    美国
  • 项目类别:
    Continuing grant
  • 财政年份:
    2003
  • 资助国家:
    美国
  • 起止时间:
    2003-09-01 至 2006-08-31
  • 项目状态:
    已结题

项目摘要

Understanding the nature of theorems and proofs has been a central quest in the foundations of computer science. The design of the modern computer owes its origins to this quest,and this quest has continued to play a pivotal role in developing a theory of computing. This research project investigates new questions in the context of verifying proofs. It investigates the capacity of proofs to be verified probabilistically, trading off a small possibility of incorrect verification for a huge advantage in the time taken to verify proofs. Research in the recent past (last ten years or so) has shown that probabilistic verification of proofs is a feasible goal and can lead to surprisingly efficient verifiability. However the results have not been of practical use so far. The main obstacle to practical utility is that the probabilistically verifiable proofs are much longer than classical proofs. This project investigates the tradeoff between the size of a probabilistically checkable proof and the complexity of verifying it. It will also investigate new applications of such proof systems, and in particular, to the task of automatic verification of correct execution of computer programs. For broader impact, the project will also foster understanding and interest into the foundations of information and computation to a wide audience via educational and outreach activities.
理解定理和证明的本质一直是计算机科学基础的核心追求。 现代计算机的设计起源于这种探索,这种探索在计算理论的发展中继续发挥着关键作用。 本研究项目在验证证据的背景下调查新问题。它调查的能力证明被验证的概率,权衡了一个小的可能性不正确的验证一个巨大的优势,在所需的时间来验证证明。 最近的研究(过去十年左右)表明,证明的概率验证是一个可行的目标,可以导致令人惊讶的有效可验证性。然而,迄今为止,这些结果还没有实际应用。实际应用的主要障碍是概率可验证的证明比经典证明长得多。本计画将探讨机率性可检查证明的大小与验证复杂度之间的平衡,并将探讨此证明系统的新应用,特别是在电脑程式正确执行的自动验证任务。 为了产生更广泛的影响,该项目还将通过教育和外联活动,促进广大受众对信息和计算基础的理解和兴趣。

项目成果

期刊论文数量(0)
专著数量(0)
科研奖励数量(0)
会议论文数量(0)
专利数量(0)

数据更新时间:{{ journalArticles.updateTime }}

{{ item.title }}
{{ item.translation_title }}
  • DOI:
    {{ item.doi }}
  • 发表时间:
    {{ item.publish_year }}
  • 期刊:
  • 影响因子:
    {{ item.factor }}
  • 作者:
    {{ item.authors }}
  • 通讯作者:
    {{ item.author }}

数据更新时间:{{ journalArticles.updateTime }}

{{ item.title }}
  • 作者:
    {{ item.author }}

数据更新时间:{{ monograph.updateTime }}

{{ item.title }}
  • 作者:
    {{ item.author }}

数据更新时间:{{ sciAawards.updateTime }}

{{ item.title }}
  • 作者:
    {{ item.author }}

数据更新时间:{{ conferencePapers.updateTime }}

{{ item.title }}
  • 作者:
    {{ item.author }}

数据更新时间:{{ patent.updateTime }}

Madhu Sudan其他文献

Almost-Tight Bounds on Preserving Cuts in Classes of Submodular Hypergraphs
子模超图类中保留割断的几乎紧界
Sketching Approximability of All Finite CSPs
绘制所有有限 CSP 的近似性
  • DOI:
  • 发表时间:
    2024
  • 期刊:
  • 影响因子:
    2.5
  • 作者:
    Chi;Alexander Golovnev;Madhu Sudan;Santhoshini Velusamy
  • 通讯作者:
    Santhoshini Velusamy
Errors are Robustly Tamed in Cumulative Knowledge Processes
累积知识过程中的错误得到了强有力的抑制
  • DOI:
  • 发表时间:
    2023
  • 期刊:
  • 影响因子:
    0
  • 作者:
    Anna Brandenberger;Cassandra Marcussen;Elchanan Mossel;Madhu Sudan
  • 通讯作者:
    Madhu Sudan
Dynamic analysis of daylight metrics and energy saving for rooftop window integrated flat roof structure of building
  • DOI:
    10.1016/j.solener.2015.10.012
  • 发表时间:
    2015-12-01
  • 期刊:
  • 影响因子:
  • 作者:
    Madhu Sudan;G.N. Tiwari;I.M. Al-Helal
  • 通讯作者:
    I.M. Al-Helal
Status of Astronomy Education in India: A Baseline Survey
印度天文学教育现状:基线调查
  • DOI:
  • 发表时间:
    2024
  • 期刊:
  • 影响因子:
    0
  • 作者:
    Moupiya Maji;Surhud More;Aniket Sule;Vishaak Balasubramanya;Ankit Bhandari;Hum Chand;Kshitij Chavan;Avik Dasgupta;Anindya De;Jayant Gangopadhyay;Mamta Gulati;Priya Hasan;Syed Ishtiyaq;Meraj Madani;Kuntal Misra;N. Amoghavarsha;Divya Oberoi;Subhendu Pattnaik;Mayuri Patwardhan;N. Ramanujam;P. Ranadive;Disha Sawant;Paryag Sharma;Twinkle Sharma;S. Shetye;Akshat Singhal;Ajit M. Srivastava;Madhu Sudan;Mumtaz Syed;Pulamathi Vikranth;Virendra Yadav
  • 通讯作者:
    Virendra Yadav

Madhu Sudan的其他文献

{{ item.title }}
{{ item.translation_title }}
  • DOI:
    {{ item.doi }}
  • 发表时间:
    {{ item.publish_year }}
  • 期刊:
  • 影响因子:
    {{ item.factor }}
  • 作者:
    {{ item.authors }}
  • 通讯作者:
    {{ item.author }}

{{ truncateString('Madhu Sudan', 18)}}的其他基金

AF: Small: Streaming Complexity of Constraint Satisfaction Problems
AF:小:约束满足问题的流复杂性
  • 批准号:
    2152413
  • 财政年份:
    2022
  • 资助金额:
    --
  • 项目类别:
    Standard Grant
Women in Theory Workshop 2018
2018 年女性理论研讨会
  • 批准号:
    1830899
  • 财政年份:
    2018
  • 资助金额:
    --
  • 项目类别:
    Standard Grant
AF: Small: Communication Amid Uncertainty
AF:小:不确定性中的沟通
  • 批准号:
    1715187
  • 财政年份:
    2017
  • 资助金额:
    --
  • 项目类别:
    Standard Grant
Special Year Workshops on Combinatorics and Complexity
组合学和复杂性特别年研讨会
  • 批准号:
    1742283
  • 财政年份:
    2017
  • 资助金额:
    --
  • 项目类别:
    Standard Grant
AF: Small: Algebraic Tools for Coding, Complexity and Combinatorics
AF:小:用于编码、复杂性和组合学的代数工具
  • 批准号:
    1565641
  • 财政年份:
    2015
  • 资助金额:
    --
  • 项目类别:
    Standard Grant
AF: Small: Algebraic Tools for Coding, Complexity and Combinatorics
AF:小:用于编码、复杂性和组合学的代数工具
  • 批准号:
    1420956
  • 财政年份:
    2014
  • 资助金额:
    --
  • 项目类别:
    Standard Grant
AF: Small: Logic and Computational Complexity
AF:小:逻辑和计算复杂性
  • 批准号:
    0915155
  • 财政年份:
    2009
  • 资助金额:
    --
  • 项目类别:
    Standard Grant
Invariance in Property Testing
属性测试的不变性
  • 批准号:
    0829672
  • 财政年份:
    2008
  • 资助金额:
    --
  • 项目类别:
    Continuing Grant
Semantic Goals for Communication
沟通的语义目标
  • 批准号:
    0726525
  • 财政年份:
    2007
  • 资助金额:
    --
  • 项目类别:
    Standard Grant
Algebraic and Computational Methods for Error-Correction
纠错的代数和计算方法
  • 批准号:
    0514915
  • 财政年份:
    2005
  • 资助金额:
    --
  • 项目类别:
    Standard Grant

相似海外基金

Probabilistic Checking against Non-Signaling Strategies
针对非信号策略的概率检查
  • 批准号:
    RGPIN-2019-06236
  • 财政年份:
    2022
  • 资助金额:
    --
  • 项目类别:
    Discovery Grants Program - Individual
Generating and Checking Probabilistic Models
生成和检查概率模型
  • 批准号:
    RGPIN-2019-06372
  • 财政年份:
    2022
  • 资助金额:
    --
  • 项目类别:
    Discovery Grants Program - Individual
Probabilistic Checking against Non-Signaling Strategies
针对非信号策略的概率检查
  • 批准号:
    RGPIN-2019-06236
  • 财政年份:
    2021
  • 资助金额:
    --
  • 项目类别:
    Discovery Grants Program - Individual
Generating and Checking Probabilistic Models
生成和检查概率模型
  • 批准号:
    RGPIN-2019-06372
  • 财政年份:
    2021
  • 资助金额:
    --
  • 项目类别:
    Discovery Grants Program - Individual
Generating and Checking Probabilistic Models
生成和检查概率模型
  • 批准号:
    RGPIN-2019-06372
  • 财政年份:
    2020
  • 资助金额:
    --
  • 项目类别:
    Discovery Grants Program - Individual
Probabilistic Checking against Non-Signaling Strategies
针对非信号策略的概率检查
  • 批准号:
    RGPIN-2019-06236
  • 财政年份:
    2020
  • 资助金额:
    --
  • 项目类别:
    Discovery Grants Program - Individual
Benchmarks for Probabilistic Model Checking
概率模型检查的基准
  • 批准号:
    542243-2019
  • 财政年份:
    2019
  • 资助金额:
    --
  • 项目类别:
    Alexander Graham Bell Canada Graduate Scholarships - Master's
Probabilistic Checking against Non-Signaling Strategies
针对非信号策略的概率检查
  • 批准号:
    RGPIN-2019-06236
  • 财政年份:
    2019
  • 资助金额:
    --
  • 项目类别:
    Discovery Grants Program - Individual
Generating and Checking Probabilistic Models
生成和检查概率模型
  • 批准号:
    RGPIN-2019-06372
  • 财政年份:
    2019
  • 资助金额:
    --
  • 项目类别:
    Discovery Grants Program - Individual
Benchmarks for Probabilistic Model Checking
概率模型检查的基准
  • 批准号:
    539700-2019
  • 财政年份:
    2019
  • 资助金额:
    --
  • 项目类别:
    University Undergraduate Student Research Awards
{{ showInfoDetail.title }}

作者:{{ showInfoDetail.author }}

知道了