课题基金 / 基金详情

CAREER: Scalable Concolic Execution

CAREER: Scalable Concolic Execution
职业:可扩展的 Concolic 执行
批准号:
2046026
负责人:
Chengyu Song
金额:
$54.48万
依托单位国家:
美国
项目类别:
Continuing Grant
财政年份:
2021
资助国家:
美国
项目状态:
未结题
起止时间:
2021-03-01 至 2026-02-28

项目摘要

项目成果

Chengyu Song的其他基金

相似基金

相关文献

中文摘要
翻译
随着我们的日常生活越来越依赖网络系统,查找和纠正编程错误从未像现在这样重要。这类编程错误也称为“错误”,攻击者可以利用这些错误来危害关键系统。然而,发现关键的软件错误/漏洞就像大海捞针:人类编写的测试用例不能触发角落用例引起的错误,随机生成的测试用例无法达到计算机程序的深度执行状态。该项目将通过提出动态符号执行(也称为并发执行)来解决这些限制,该测试用例生成技术可以系统地探索所有可能的执行状态。该项目旨在通过缩小搜索空间和提高搜索速度来提高并发执行的可扩展性。较小的搜索空间将导致更好的代码覆盖率或更快地实现相同的覆盖率。通过使用强化学习技术自动推断和修剪不会导致新的程序状态的执行路径,例如错误路径,将实现缩小搜索空间的目标。通过更高效的符号约束收集和约束求解,达到提高搜索速度的目的。通过用高度优化的动态数据流分析取代传统的符号解释,将完成更高效的约束收集。通过用高吞吐量的局部随机搜索代替传统的定理证明器,可以实现更高效的约束求解。这些技术旨在使关键应用程序(如操作系统内核、物联网固件,甚至硬件设计)更加安全。该奖项反映了NSF的法定使命,并通过使用基金会的智力优势和更广泛的影响审查标准进行评估,被认为值得支持。
英文摘要
As our daily life depends more and more on cyber systems, finding and correcting programming errors are never more important. Such programming errors, also known as "bugs," can be exploited by adversaries to compromise critical systems. However, finding critical software bugs/vulnerabilities are like finding a needle in a haystack: test cases written by humans cannot trigger bugs caused by corner cases, and randomly generated test cases cannot reach deep execution states of a computer program. This project will address these limitations by advancing dynamic symbolic execution (a.k.a., concolic execution), a test case generation technology that can systematically explore all possible execution states.This project aims to advance the scalability of concolic execution by narrowing the search space and improving the search speed. A smaller search space will lead to better code coverage or achieve the same coverage faster. The goal of narrowing the search space will be achieved by using reinforcement learning techniques to automatically infer and prune execution paths that will not lead to new program states, such as error paths. The goal of improving search speed will be achieved with more efficient symbolic constraint collection and constraint solving. More efficient constraint collection will be done by replacing traditional symbolic interpretation with highly optimized dynamic data-flow analysis. More efficient constraint solving will be done by replacing traditional theorem provers with high throughput local stochastic search. The techniques aim to make critical applications, such as OS kernels, IoT firmware, and even hardware designs more secure.This award reflects NSF's statutory mission and has been deemed worthy of support through evaluation using the Foundation's intellectual merit and broader impacts review criteria.
期刊论文(3)
专著(0)
科研奖励(0)
会议论文
DOI: 10.1109/sp46214.2022.9833796
发表时间: 2022-05
期刊: 2022 IEEE Symposium on Security and Privacy (SP)
影响因子: --
作者: [Ju Chen;Jinghan Wang;Chengyu Song;Hengda Yin]
通讯作者: Ju Chen;Jinghan Wang;Chengyu Song;Hengda Yin
DOI: 10.14722/ndss.2021.24486
发表时间: 2021
期刊: Proceedings 2021 Network and Distributed System Security Symposium
影响因子: --
作者: [Jinghan Wang;Chengyu Song;Heng Yin]
通讯作者: Jinghan Wang;Chengyu Song;Heng Yin
DOI: --
发表时间: 2022
期刊:
影响因子: --
作者: [Ju Chen;Wookhyun Han;Mingjun Yin;Haochen Zeng;Chengyu Song;Byoungyoung Lee;Heng Yin;I. Shin]
通讯作者: Ju Chen;Wookhyun Han;Mingjun Yin;Haochen Zeng;Chengyu Song;Byoungyoung Lee;Heng Yin;I. Shin
SaTC: CORE: Small: Practical Whole Kernel Memory Safety Enforcement
  • 批准号:
    1718997
  • 项目类别:
    Standard Grant
  • 资助金额:
    $47.44万
  • 财政年份:
    2017
  • 负责人:
    Chengyu Song
  • 依托单位:
国内基金
海外基金
Scalable Learning and Optimization: High-dimensional Models and Online Decision-Making Strategies for Big Data Analysis