Next-generation Constraint Solvers for Software Engineering and Security

用于软件工程和安全的下一代约束求解器

• 批准号: 435967-2013
• 负责人: Ganesh, Vijay
• 金额: $ 1.82万
• 依托单位: University of Waterloo
• 依托单位国家: 加拿大
• 项目类别: Discovery Grants Program - Individual
• 财政年份: 2017
• 资助国家: 加拿大
• 起止时间: 2017-01-01 至 2018-12-31
• 项目状态: 已结题
• 来源: https://www.nserc-crsng.gc.ca/ase-oro/Details-Detailles_eng.asp?id=634575
• 关键词: Next; generation; Constraint; Solvers; Software

Constraint solvers, programs that automatically solve mathematical constraints, are used in myriad applications in engineering and science. Solvers can be likened to swiss-army knives, used in applications such as planning a robot's movement, configuring a car or automatically finding bugs in software. Engineers model their problem using mathematical constraints, and then use solvers to automatically solve them. As little as a decade ago, scalable automatic bug-finding of commercial software like word processors and operating systems was considered practically infeasible. Thanks to impressive gains in solver performance (due to many researchers including myself), not only has automatic bug-finding become feasible but is mandatory in companies like Microsoft. While the gains to-date are important, the demand for ever-more powerful and expressive solvers continues to grow unabated as engineers tackle even harder applications such as software synthesis. Hence, I propose a long-term research program to develop new solver techniques that are orders of magnitude faster and more expressive than today's, aimed at software engineering tools for software reliability and security. More precisely, my research program has the following three thrusts: i) I will explore new techniques based on machine learning (ML). There has been a veritable revolution in ML theory and techniques. We can use ML and stochastic inference techniques to learn subtle meta-level patterns in large constraints that enable faster solving (similar to how humans identify deep concepts from data), ii) techniques that leverage ubiquitous and cheap multi-core processors to build scalable parallel solvers, and iii) solver techniques that leverage domain-specific knowledge as keys to unlock solutions to constraints. The proposed research will have deep fundamental scientific, technical, and commercial impact. The foundational results will provide theoretical underpinning for solver heuristics through ideas from parametric complexity and ML. The technical and commercial impact will be a set of new scalable and extensible solvers which have the potential to transform software reliability and security.

约束求解器是自动求解数学约束的程序，在工程和科学领域有着广泛的应用。求解器可以比作瑞士军刀，用于规划机器人的运动、配置汽车或自动查找软件中的错误等应用。工程师使用数学约束对问题进行建模，然后使用求解器自动求解。就在十年前，文字处理器和操作系统等商业软件的可扩展自动错误查找被认为实际上是不可行的。由于求解器性能取得了显着的进步（归功于包括我自己在内的许多研究人员），自动错误查找不仅变得可行，而且在像 Microsoft 这样的公司中是强制性的。虽然迄今为止取得的成果很重要，但随着工程师处理软件合成等更困难的应用程序，对更强大和更具表现力的求解器的需求继续有增无减。因此，我提出了一项长期研究计划，以开发新的求解器技术，这些技术比当今的求解器技术要快几个数量级，更具表现力，旨在开发软件可靠性和安全性的软件工程工具。更准确地说，我的研究计划有以下三个主旨：i）我将探索基于机器学习（ML）的新技术。机器学习理论和技术发生了一场名副其实的革命。我们可以使用机器学习和随机推理技术来学习大约束中微妙的元级模式，从而实现更快的解决（类似于人类如何从数据中识别深层概念），ii）利用普遍存在且廉价的多核处理器来构建可扩展并行的技术求解器，以及 iii) 利用特定领域知识作为解锁约束解决方案的关键的求解器技术。拟议的研究将产生深远的基础科学、技术和商业影响。基础结果将通过参数复杂性和机器学习的思想为求解器启发式提供理论基础。技术和商业影响将是一组新的可扩展和可扩展的求解器，它们有可能改变软件的可靠性和安全性。