Reasoning about Data Structures, Concurrency, and Resources

关于数据结构、并发性和资源的推理

• 批准号: 0541021
• 负责人: John Reynolds
• 金额: --
• 依托单位: Carnegie-Mellon University
• 依托单位国家: 美国
• 项目类别: Continuing Grant
• 财政年份: 2006
• 资助国家: 美国
• 起止时间: 2006-04-15 至 2010-03-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=0541021&HistoricalAwards=false
• 关键词: Reasoning; about; Data; Structures; Concurrency

Abstract0541021John C. ReynoldsCarnegie Mellon UniversityReasoning about Shared Structure and ConcurrencyThe specification and verification of computer programs is investigated, along with the semantics needed to insure the soundness of verification. Of specific interest are:Separation Logic, which treats programs employing shared mutable data structures or shared-variable concurrency. The goal is to extend the logic to high-level languages using safe type systems and automaticstorage reclamation, and also to machine-level languages permitting pointers to code to be embedded within data structures.Grainless Semantics, which treats shared-variable concurrency without imposing any default level of atomic operations, by regarding race conditions (i.e., simultaneous access to the same storage by concurrentprocesses) as catastrophic events. The goal is to simplify the understanding of programs by avoiding useless distinctions between programs with unacceptable behavior.The intellectual merit of this research is that it will substantially increase the domain of discourse of separation logic, and facilitate soundness arguments for this and other logics for shared-variableconcurrency.The broader impact is that it will become easier to avoid errors in an important class of useful but difficult computer programs. Eventually, it should be possible to automate proof-checking in the logic so thatprograms in this class can be accompanied by machine-checkable proofs of their correctness.

摘要0541021 John C. Carnegie Mellon University关于共享结构和并发性的推理研究了计算机程序的规范和验证，沿着确保验证可靠性所需的语义。 特别感兴趣的是：分离逻辑，它处理使用共享可变数据结构或共享变量并发的程序。 目标是将逻辑扩展到使用安全类型系统和自动存储回收的高级语言，以及允许将指向代码的指针嵌入数据结构中的机器级语言。无粒度语义，其处理共享变量并发而不施加任何默认级别的原子操作，通过考虑竞争条件（即，并发进程对同一存储器的同时访问）作为灾难性事件。 其目标是通过避免具有不可接受行为的程序之间的无用区别来简化对程序的理解。这项研究的智力价值在于，它将大大增加分离逻辑的话语域，并促进健全的论点，为这个和其他逻辑共享-更广泛的影响是，在一类重要的有用但困难的计算机程序中避免错误将变得更容易。 最后，在逻辑中自动化检验应该是可能的，这样这个类中的程序就可以伴随着 机器可检查的证明其正确性。