TC: EAGER: Collaborative Research: Parallel Automated Reasoning

TC：EAGER：协作研究：并行自动推理

• 批准号: 1049674
• 负责人: Cesare Tinelli
• 金额: $ 12.52万
• 依托单位: University of Iowa
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 2010
• 资助国家: 美国
• 起止时间: 2010-09-01 至 2012-08-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=1049674&HistoricalAwards=false
• 关键词: TC; EAGER; Collaborative; Research; Parallel

The security of the national computing infrastructure is critical for consumer confidence, protection of privacy, protection of valuable intellectual property, and even national security. Logic-based approaches to security have been gaining popularity, in part because they provide a precise way to describe and reason about the kinds of complexity found in real systems. Perhaps even more importantly, automated reasoning techniques can be used to assist users in navigating this complexity. Despite the promise of automated reasoning, its use in practical applications is still limited. One of the primary reasons for this is that for many problems, automated reasoning methods are not fast enough, especially for use in interactive environments (such as browser plug-ins in desktop computing, or mobile applications running on smart phones and PDAs). This project aims to address the performance weakness of automated reasoning by investigating novel designs and algorithms with the unifying theme of exploiting parallelism. The project will focus on three main areas of automated deduction: Boolean satisfiability, first-order reasoning, and satisfiability modulo theories.

国家计算基础设施的安全对于消费者的信心，保护隐私，保护宝贵的知识产权甚至国家安全至关重要。 基于逻辑的安全方法一直在越来越受欢迎，部分原因是它们提供了一种描述和推理真实系统中发现和理由的精确方法。 也许更重要的是，可以使用自动推理技术来帮助用户导航这种复杂性。 尽管有自动推理的承诺，但其在实际应用中的使用仍然有限。 造成这种情况的主要原因之一是，对于许多问题，自动推理方法不够快，尤其是用于交互式环境（例如桌面计算中的浏览器插件或在智能手机和PDAS上运行的移动应用程序）。 该项目旨在通过以利用并行性的统一主题来调查新颖的设计和算法来解决自动推理的性能弱点。 该项目将重点关注自动扣除的三个主要领域：布尔可满足性，一阶推理和满意度模型理论。