TWC: Medium: Collaborative: Breaking the Satisfiability Modulo Theories (SMT) Bottleneck in Symbolic Security Analysis
TWC:媒介:协作:打破符号安全分析中的可满足性模理论 (SMT) 瓶颈
基本信息
- 批准号:1228768
- 负责人:
- 金额:$ 39.98万
- 依托单位:
- 依托单位国家:美国
- 项目类别:Standard Grant
- 财政年份:2012
- 资助国家:美国
- 起止时间:2012-09-01 至 2016-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)技术的求解器已经成为这种安全方法的自然选择,因为与更传统的定理证明相比,它们具有优越的性能和自动化,并且相对于特殊工具或命题可满足性求解器具有更大的通用性。该合作项目汇集了安全和SMT领域的专家,以追求两个互补的研究目标:(i)利用SMT求解器的全部功能来改进当前基于符号分析的安全工具;(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 }}
Clark Barrett其他文献
The nonexistence of unicorns and many-sorted L\"owenheim-Skolem theorems
独角兽的不存在和多种 L"owenheim-Skolem 定理
- DOI:
- 发表时间:
2024 - 期刊:
- 影响因子:0
- 作者:
Benjamin Przybocki;G. Toledo;Yoni Zohar;Clark Barrett - 通讯作者:
Clark Barrett
Being careful about theory combination
- DOI:
10.1007/s10703-012-0159-z - 发表时间:
2012-06-09 - 期刊:
- 影响因子:0.800
- 作者:
Dejan Jovanović;Clark Barrett - 通讯作者:
Clark Barrett
Efficiently Synthesizing Lowest Cost Rewrite Rules for Instruction Selection
有效综合用于指令选择的最低成本重写规则
- DOI:
- 发表时间:
2024 - 期刊:
- 影响因子:0
- 作者:
Ross G. Daly;Caleb Donovick;Caleb Terrill;J. Melchert;Priyanka Raina;Clark Barrett;Pat Hanrahan - 通讯作者:
Pat Hanrahan
Selected Extended Papers of NFM 2017: Preface
- DOI:
10.1007/s10817-018-9488-y - 发表时间:
2018-10-20 - 期刊:
- 影响因子:0.800
- 作者:
Clark Barrett;Temesghen Kahsai - 通讯作者:
Temesghen Kahsai
Clark Barrett的其他文献
{{
item.title }}
{{ item.translation_title }}
- DOI:
{{ item.doi }} - 发表时间:
{{ item.publish_year }} - 期刊:
- 影响因子:{{ item.factor }}
- 作者:
{{ item.authors }} - 通讯作者:
{{ item.author }}
{{ truncateString('Clark Barrett', 18)}}的其他基金
POSE: Phase II: An Open-Source Ecosystem for the cvc5 SMT Solver
POSE:第二阶段:cvc5 SMT 求解器的开源生态系统
- 批准号:
2303489 - 财政年份:2023
- 资助金额:
$ 39.98万 - 项目类别:
Standard Grant
NSF-BSF: SHF: Small: Neural Network Verification: Abstraction, Compositional Verification and Standardization
NSF-BSF:SHF:小型:神经网络验证:抽象、组合验证和标准化
- 批准号:
2211505 - 财政年份:2022
- 资助金额:
$ 39.98万 - 项目类别:
Standard Grant
NSF-BSF: SHF: Small: Efficient, Automatic, and Trustworthy Smart Contract Verification
NSF-BSF:SHF:小型:高效、自动且值得信赖的智能合约验证
- 批准号:
2110397 - 财政年份:2021
- 资助金额:
$ 39.98万 - 项目类别:
Standard Grant
Collaborative Research: SHF: Small: Integrating Synthesis and Optimization in Satisfiability Modulo Theories
合作研究:SHF:小型:在可满足性模理论中集成综合和优化
- 批准号:
2006407 - 财政年份:2020
- 资助金额:
$ 39.98万 - 项目类别:
Standard Grant
NSF Student Travel Grant for 2019 Formal Methods in Computer-Aided Design (FMCAD)
NSF 2019 年计算机辅助设计形式方法 (FMCAD) 学生旅费补助金
- 批准号:
1935921 - 财政年份:2019
- 资助金额:
$ 39.98万 - 项目类别:
Standard Grant
NSF-BSF: SHF: Small: Certifiable Verification of Large Neural Networks
NSF-BSF:SHF:小型:大型神经网络的可认证验证
- 批准号:
1814369 - 财政年份:2018
- 资助金额:
$ 39.98万 - 项目类别:
Standard Grant
TC: EAGER: Collaborative Research: Parallel Automated Reasoning
TC:EAGER:协作研究:并行自动推理
- 批准号:
1049495 - 财政年份:2010
- 资助金额:
$ 39.98万 - 项目类别:
Standard Grant
SHF: Small:Collaborative Research: Flexible, Efficient, and Trustworthy Proof Checking for Satisfiability Modulo Theories
SHF:小型:协作研究:灵活、高效且值得信赖的可满足性模理论证明检查
- 批准号:
0914956 - 财政年份:2009
- 资助金额:
$ 39.98万 - 项目类别:
Standard Grant
相似海外基金
TWC SBE: Medium: Collaborative: Brain Hacking: Assessing Psychological and Computational Vulnerabilities in Brain-based Biometrics
TWC SBE:媒介:协作:大脑黑客:评估基于大脑的生物识别技术中的心理和计算漏洞
- 批准号:
1840790 - 财政年份:2018
- 资助金额:
$ 39.98万 - 项目类别:
Continuing Grant
TWC: Medium: Collaborative: Black-Box Evaluation of Cryptographic Entropy at Scale
TWC:媒介:协作:大规模密码熵的黑盒评估
- 批准号:
1937622 - 财政年份:2018
- 资助金额:
$ 39.98万 - 项目类别:
Standard Grant
TWC SBE: Medium: Collaborative: Building a Privacy-Preserving Social Networking Platform from a Technological and Sociological Perspective
TWC SBE:媒介:协作:从技术和社会学角度构建保护隐私的社交网络平台
- 批准号:
1855391 - 财政年份:2018
- 资助金额:
$ 39.98万 - 项目类别:
Standard Grant
TWC: Medium: Collaborative: Systems, Tools, and Techniques for Executing, Managing, and Securing SGX Programs
TWC:媒介:协作:用于执行、管理和保护 SGX 程序的系统、工具和技术
- 批准号:
1834213 - 财政年份:2018
- 资助金额:
$ 39.98万 - 项目类别:
Standard Grant
TWC: Medium: Collaborative: Efficient Repair of Learning Systems via Machine Unlearning
TWC:媒介:协作:通过机器取消学习有效修复学习系统
- 批准号:
1854000 - 财政年份:2018
- 资助金额:
$ 39.98万 - 项目类别:
Standard Grant
TWC: Medium: Collaborative: Seal: Secure Engine for AnaLytics - From Secure Similarity Search to Secure Data Analytics
TWC:媒介:协作:Seal:AnaLytics 的安全引擎 - 从安全相似性搜索到安全数据分析
- 批准号:
1929901 - 财政年份:2018
- 资助金额:
$ 39.98万 - 项目类别:
Standard Grant
TWC: TTP Option: Medium: Collaborative: MALDIVES: Developing a Comprehensive Understanding of Malware Delivery Mechanisms
TWC:TTP 选项:中:协作:马尔代夫:全面了解恶意软件传播机制
- 批准号:
1748127 - 财政年份:2017
- 资助金额:
$ 39.98万 - 项目类别:
Standard Grant
TWC SBE: Medium: Collaborative: Dollars for Hertz: Making Trustworthy Spectrum Sharing Technically and Economically Viable
TWC SBE:媒介:协作:赫兹美元:使值得信赖的频谱共享在技术上和经济上可行
- 批准号:
1801986 - 财政年份:2017
- 资助金额:
$ 39.98万 - 项目类别:
Standard Grant
TWC SBE: Medium: Collaborative: Brain Hacking: Assessing Psychological and Computational Vulnerabilities in Brain-based Biometrics
TWC SBE:媒介:协作:大脑黑客:评估基于大脑的生物识别技术中的心理和计算漏洞
- 批准号:
1564104 - 财政年份:2016
- 资助金额:
$ 39.98万 - 项目类别:
Continuing Grant
TWC: Medium: Collaborative: New Protocols and Systems for RAM-Based Secure Computation
TWC:媒介:协作:基于 RAM 的安全计算的新协议和系统
- 批准号:
1562888 - 财政年份:2016
- 资助金额:
$ 39.98万 - 项目类别:
Standard Grant