Proof automation for linearizability in separation logic
I Mulder, R Krebbers - Proceedings of the ACM on Programming …, 2023 - dl.acm.org
Recent advances in concurrent separation logic enabled the formal verification of
increasingly sophisticated fine-grained (ie, lock-free) concurrent programs. For such …
increasingly sophisticated fine-grained (ie, lock-free) concurrent programs. For such …
Coq's vibrant ecosystem for verification engineering (invited talk)
AW Appel - Proceedings of the 11th ACM SIGPLAN International …, 2022 - dl.acm.org
Program verification in the large is not only a matter of mechanizing a program logic to
handle the semantics of your programming language. You must reason in the mathematics …
handle the semantics of your programming language. You must reason in the mathematics …
Deadlock-Free Separation Logic: Linearity Yields Progress for Dependent Higher-Order Message Passing
We introduce a linear concurrent separation logic, called LinearActris, designed to
guarantee deadlock and leak freedom for message-passing concurrency. LinearActris …
guarantee deadlock and leak freedom for message-passing concurrency. LinearActris …
[PDF][PDF] 基于交互式定理证明的并发程序验证工作综述
王中烨， 吴姝姝， 曹钦翔 - 软件学报, 2024 - jos.org.cn
并发程序与并发系统可以拥有非常高的执行效率和相对串行系统较快的响应速度,
在现实中有着非常广泛的应用. 但是并发程序与并发系统往往难以保证其实现的正确性 …
在现实中有着非常广泛的应用. 但是并发程序与并发系统往往难以保证其实现的正确性 …
A Survey of Interactive Theorem Proving Based Concurrent Program Verifications
王中烨， 吴姝姝， 曹钦翔 - Journal of Software, 2024 - jos.org.cn
并发程序与并发系统可以拥有非常高的执行效率和相对串行系统较快的响应速度,
在现实中有着非常广泛的应用. 但是并发程序与并发系统往往难以保证其实现的正确性 …
在现实中有着非常广泛的应用. 但是并发程序与并发系统往往难以保证其实现的正确性 …
[PDF][PDF] Guarantees by Construction
J Jacobs - 2024 - repository.ubn.ru.nl
This thesis is about type systems for deadlock and leak free concurrency, separation logics
for verified message passing, paradox-free probabilistic programming, and general and …
for verified message passing, paradox-free probabilistic programming, and general and …