Garp: Graph Abstractions for Concurrent Programming
No abstract available.
Related papers
- YOGAR-CBMC: CBMC with Scheduling Constraint Based Abstraction Refinement - (Competition Contribution) TACAS 2018
- Verifying Concurrent Graph Algorithms APLAS 2016
- A Concurrent Generational Garbage Collector for a Parallel Graph Reducer ISMM 1992
- Universal Causality Graphs: A Precise Happens-Before Model for Detecting Bugs in Concurrent Programs CAV 2010
- Scalable concurrency debugging with distributed graph processing CGO 2018
- Verification and Design Aspects of "True" Concurrency POPL 1978
- Connectivity graphs: a method for proving deadlock freedom based on separation logic POPL 2022
- Local Reasoning for Global Graph Properties ESOP 2020