Verifiably Correct Transactional Memory

可验证正确的事务内存

• 批准号: EP/R032556/1
• 负责人: Brijesh Dongol
• 金额: $ 50.67万
• 依托单位: University of Surrey
• 依托单位国家: 英国
• 项目类别: Research Grant
• 财政年份: 2018
• 资助国家: 英国
• 起止时间: 2018 至 无数据
• 项目状态: 已结题
• 来源: https://gtr.ukri.org/projects?ref=EP%2FR032556%2F1
• 关键词: Verifiably; Correct; Transactional; Memory

Abstracts are not currently available in GtR for all funded research. This is normally because the abstract was not required at the time of proposal submission, but may be because it included sensitive information such as personal details.

目前GtR中并没有所有资助研究的摘要。这通常是因为在提交提案时不需要摘要，但也可能是因为摘要中包含个人详细信息等敏感信息。

项目成果

Towards deductive verification of C11 programs with Event-B and ProB

使用 Event-B 和 ProB 进行 C11 程序的演绎验证

• DOI: 10.1145/3340672.3341117
• 发表时间: 2019
• 作者: Dalvandi M

Programming Languages and Systems - 31st European Symposium on Programming, ESOP 2022, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022, Munich, Germany, April 2-7, 2022, Proceedings

编程语言和系统 - 第 31 届欧洲编程研讨会，ESOP 2022，作为欧洲软件理论与实践联合会议的一部分举行，ETAPS 2022，德国慕尼黑，2022 年 4 月 2-7 日，会议记录

• DOI: 10.1007/978-3-030-99336-8_9
• 发表时间: 2022
• 作者: Bila E

Defining and Verifying Durable Opacity: Correctness for Persistent Software Transactional Memory

• DOI: 10.1007/978-3-030-50086-3_3
• 发表时间: 2020-05-13
• 期刊: Formal Techniques for Distributed Objects, Components, and Systems
• 作者: Bila E;Doherty S;Dongol B;Derrick J;Schellhorn G;Wehrheim H
• 通讯作者: Wehrheim H

Formal Methods. FM 2019 International Workshops - Porto, Portugal, October 7-11, 2019, Revised Selected Papers, Part I

正式方法。

• DOI: 10.1007/978-3-030-54994-7_16
• 发表时间: 2020
• 作者: Alves G

Proving Memory Access Violations in Isabelle/HOL

证明 Isabelle/HOL 中的内存访问冲突

• DOI: 10.1145/3563822.3568010
• 发表时间: 2022
• 作者: Ahmadi S