TWC: Medium: Collaborative: Breaking the Satisfiability Modulo Theories (SMT) Bottleneck in Symbolic Security Analysis
TWC:媒介:协作:打破符号安全分析中的可满足性模理论 (SMT) 瓶颈
基本信息
- 批准号:1228765
- 负责人:
- 金额:$ 39.77万
- 依托单位:
- 依托单位国家:美国
- 项目类别:Standard Grant
- 财政年份:2012
- 资助国家:美国
- 起止时间:2012-09-01 至 2017-08-31
- 项目状态:已结题
- 来源:
- 关键词:
项目摘要
The security of our software is critical for consumer confidence, the protection of privacy and valuable intellectual property, and of course national security. Because of our society's increased reliance on software, security breaches can lead to serious personal or corporate losses, and endanger the privacy, liberties, and even the lives of individuals. As threats to software security have become more sophisticated, so too have the techniques and analyses developed to improve it. Symbolic execution has emerged as a fundamental tool for security applications. Its main idea is to run a program using symbolic instead of concrete values: a set of symbols are assigned to the program inputs, and the outputs are expressed as a set of "verification conditions", logical formulas over the input symbols. A number of successful security analyses use symbolic execution and similar methods to recast security questions about programs as constraint satisfaction problems in some formal logic. Automatic reasoners for that logic can then be used to solve those problems. In the last few years, solvers based on Satisfiability Modulo Theories (SMT) techniques have become a natural choice in such approaches to security because of their superior performance and automation compared to more traditional theorem provers and their greater generality with respect to ad-hoc tools or propositional satisfiability solvers.This collaborative project brings together experts in security and in SMT to pursue two complementary research goals: (i) harness the full power of SMT solvers to improve current security tools based on symbolic analysis; and (ii) design and develop new techniques to address the needs of anticipated future security applications. Specific activities addressing these goals include: collecting challenge benchmark problems from existing security analyses and developing targeted SMT optimizations for these benchmarks; developing appropriate security abstractions in the SMT language used to express security verification conditions; developing logical theories and algorithms for reasoning about character strings in such verification conditions; exposing a general framework for extending the verification condition language; and developing techniques for computing symbolic solution sets for SMT constraints. These activities are expected to (i) significantly increase the flexibility, performance, and reasoning capabilities of SMT solvers in support of security applications; (ii) improve the performance and scalability of current security analyses by leveraging the reasoning power of SMT solvers; and (iii) provide a foundation for new, more powerful, and more expressive security analyses. Overall, this project will help create more scalable and expressive security applications which could have a considerable impact on society as they enable the production of software much more resistant to security attacks.
我们软件的安全对于消费者的信心,保护隐私和有价值的知识产权以及当然是国家安全至关重要。由于我们社会对软件的依赖越来越依赖,因此安全漏洞会导致严重的个人或公司损失,并危害个人的隐私,自由甚至个人的生命。随着对软件安全性的威胁变得越来越复杂,可以改善它的技术和分析。符号执行已成为安全应用程序的基本工具。它的主要思想是使用符号而不是具体值运行程序:将一组符号分配给程序输入,输出表示为一组“验证条件”,在输入符号上表达了逻辑公式。 许多成功的安全性分析都使用符号执行和类似的方法来将有关程序的安全性问题作为某些正式逻辑中的约束满意度问题。然后可以使用该逻辑的自动推理器来解决这些问题。 在过去的几年中,基于满足性模型理论(SMT)技术的求解器已成为这种安全方法的自然选择,因为它们的性能和自动化较高,而与更传统的定理抛弃相比,其更大的一般性及其在宣传工具或求主的可满足性解决方案方面的更大一般性,这是在SMET方面的专家,以提高SMT的专家,以提高SMT的专家,以实现互补的研究(I)(I)(I)(I)(I)(I)(I)(I)(I)(I)(I)(I)基于符号分析的工具; (ii)设计和开发新技术,以满足预期的未来安全应用程序的需求。解决这些目标的具体活动包括:从现有的安全分析中收集挑战基准问题,并为这些基准制定有针对性的SMT优化;用用于表达安全验证条件的SMT语言开发适当的安全摘要;在此类验证条件下开发逻辑理论和算法来推理字符字符串;公开一个通用框架以扩展验证条件语言;并开发用于计算SMT约束的符号解决方案集的技术。预计这些活动将(i)大大提高SMT求解器的灵活性,性能和推理能力,以支持安全应用程序; (ii)通过利用SMT求解器的推理能力来提高当前安全性分析的性能和可扩展性; (iii)为新的,更强大,更具表现力的安全分析提供了基础。总体而言,该项目将有助于创建更可扩展和表现力的安全应用程序,这可能会对社会产生重大影响,因为它们能够生产软件对安全攻击的抵抗力。
项目成果
期刊论文数量(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 }}
Cesare Tinelli其他文献
Verifying SQL Queries using Theories of Tables and Relations
使用表和关系理论验证 SQL 查询
- DOI:
10.29007/rlt7 - 发表时间:
2024 - 期刊:
- 影响因子:0
- 作者:
Mudathir Mohamed;Andrew Reynolds;Cesare Tinelli;Clark W. Barrett - 通讯作者:
Clark W. Barrett
CRV: Automated Cyber-Resiliency Reasoning for System Design Models
CRV:系统设计模型的自动网络弹性推理
- DOI:
- 发表时间:
2023 - 期刊:
- 影响因子:0
- 作者:
Daniel Larraz;Robert Lorch;Moosa Yahyazadeh;M. F. Arif;Omar Chowdhury;Cesare Tinelli - 通讯作者:
Cesare Tinelli
Cesare Tinelli的其他文献
{{
item.title }}
{{ item.translation_title }}
- DOI:
{{ item.doi }} - 发表时间:
{{ item.publish_year }} - 期刊:
- 影响因子:{{ item.factor }}
- 作者:
{{ item.authors }} - 通讯作者:
{{ item.author }}
{{ truncateString('Cesare Tinelli', 18)}}的其他基金
FMitF: Track II: Strengthening the integration of the CVC4 SMT solver in the Coq proof assistant
FMITF:轨道 II:加强 Coq 证明助手中 CVC4 SMT 求解器的集成
- 批准号:
2019348 - 财政年份:2020
- 资助金额:
$ 39.77万 - 项目类别:
Standard Grant
TC: EAGER: Collaborative Research: Parallel Automated Reasoning
TC:EAGER:协作研究:并行自动推理
- 批准号:
1049674 - 财政年份:2010
- 资助金额:
$ 39.77万 - 项目类别:
Standard Grant
2010 Midwest Verification Day Workshop
2010 年中西部验证日研讨会
- 批准号:
1049597 - 财政年份:2010
- 资助金额:
$ 39.77万 - 项目类别:
Standard Grant
CRI: Collaborative Research: SMT-LIB, A Common Library and Infrastructure for Satisfiability Modulo Theories
CRI:协作研究:SMT-LIB,可满足性模理论的通用库和基础设施
- 批准号:
0551646 - 财政年份:2006
- 资助金额:
$ 39.77万 - 项目类别:
Continuing Grant
CAREER: Fast Provers for Extended Static Checking of Software
职业:用于软件扩展静态检查的快速证明者
- 批准号:
0237422 - 财政年份:2003
- 资助金额:
$ 39.77万 - 项目类别:
Continuing Grant
15th International Workshop on Unification (UNIF 2001) to be held in Europe
第15届国际统一研讨会(UNIF 2001)将在欧洲举行
- 批准号:
0108548 - 财政年份:2001
- 资助金额:
$ 39.77万 - 项目类别:
Standard Grant
相似国自然基金
复合低维拓扑材料中等离激元增强光学响应的研究
- 批准号:12374288
- 批准年份:2023
- 资助金额:52 万元
- 项目类别:面上项目
基于管理市场和干预分工视角的消失中等企业:特征事实、内在机制和优化路径
- 批准号:72374217
- 批准年份:2023
- 资助金额:41.00 万元
- 项目类别:面上项目
托卡马克偏滤器中等离子体的多尺度算法与数值模拟研究
- 批准号:12371432
- 批准年份:2023
- 资助金额:43.5 万元
- 项目类别:面上项目
中等质量黑洞附近的暗物质分布及其IMRI系统引力波回波探测
- 批准号:12365008
- 批准年份:2023
- 资助金额:32 万元
- 项目类别:地区科学基金项目
中等垂直风切变下非对称型热带气旋快速增强的物理机制研究
- 批准号:42305004
- 批准年份:2023
- 资助金额:30 万元
- 项目类别:青年科学基金项目
相似海外基金
TWC SBE: Medium: Collaborative: Brain Hacking: Assessing Psychological and Computational Vulnerabilities in Brain-based Biometrics
TWC SBE:媒介:协作:大脑黑客:评估基于大脑的生物识别技术中的心理和计算漏洞
- 批准号:
1840790 - 财政年份:2018
- 资助金额:
$ 39.77万 - 项目类别:
Continuing Grant
TWC SBE: Medium: Collaborative: Building a Privacy-Preserving Social Networking Platform from a Technological and Sociological Perspective
TWC SBE:媒介:协作:从技术和社会学角度构建保护隐私的社交网络平台
- 批准号:
1855391 - 财政年份:2018
- 资助金额:
$ 39.77万 - 项目类别:
Standard Grant
TWC: Medium: Collaborative: Systems, Tools, and Techniques for Executing, Managing, and Securing SGX Programs
TWC:媒介:协作:用于执行、管理和保护 SGX 程序的系统、工具和技术
- 批准号:
1834213 - 财政年份:2018
- 资助金额:
$ 39.77万 - 项目类别:
Standard Grant
TWC: Medium: Collaborative: Black-Box Evaluation of Cryptographic Entropy at Scale
TWC:媒介:协作:大规模密码熵的黑盒评估
- 批准号:
1937622 - 财政年份:2018
- 资助金额:
$ 39.77万 - 项目类别:
Standard Grant
TWC: Medium: Collaborative: Efficient Repair of Learning Systems via Machine Unlearning
TWC:媒介:协作:通过机器取消学习有效修复学习系统
- 批准号:
1854000 - 财政年份:2018
- 资助金额:
$ 39.77万 - 项目类别:
Standard Grant