research
∙
07/28/2023
Context-Aware Separation Logic
Separation logic is often praised for its ability to closely mimic the l...
share
research
∙
05/04/2023
Contextual Equivalence for Alternation and Urgency
We propose a new programming model with support for alternation, imperfe...
research
∙
04/10/2023
Make flows small again: revisiting the flow framework
We present a new flow framework for separation logic reasoning about pro...
research
∙
09/27/2022
Embedding Hindsight Reasoning in Separation Logic
Proving linearizability of concurrent data structures remains a key chal...
research
∙
08/30/2022
Model-based Fault Classification for Automotive Software
Intensive testing using model-based approaches is the standard way of de...
research
∙
08/26/2022
I still know it's you! On Challenges in Anonymizing Source Code
The source code of a program not only defines its semantics but also con...
research
∙
07/05/2022
A Concurrent Program Logic with a Future and History
Verifying fine-grained optimistic concurrent programs remains an open pr...
research
∙
11/30/2021
Verifying and Optimizing Compact NUMA-Aware Locks on Weak Memory Models
Developing concurrent software is challenging, especially if it has to r...
research
∙
01/28/2021
Safety Verification of Parameterized Systems under Release-Acquire
We study the safety verification problem for parameterized systems under...
research
∙
10/25/2019
Pointer Life Cycle Types for Lock-Free Data Structures with Memory Reclamation
We consider the verification of lock-free data structures that manually ...
research
∙
09/26/2019
Complexity of Liveness in Parameterized Systems
We investigate the fine-grained complexity of liveness verification for ...
research
∙
10/25/2018
Decoupling Lock-Free Data Structures from Memory Reclamation for Static Analysis
Verification of concurrent data structures is one of the most challengin...
research
∙
07/16/2018
Fast Witness Counting
We study the witness-counting problem: given a set of vectors V in the d...
research
∙
05/08/2018
Parity to Safety in Polynomial Time for Pushdown and Collapsible Pushdown Systems
We give a direct polynomial-time reduction from parity games played over...
research
∙
03/26/2018
Bounded Context Switching for Valence Systems
We study valence systems, finite-control programs over infinite-state me...
research
∙
02/15/2018
Fine-Grained Complexity of Safety Verification
We study the fine-grained complexity of Leader Contributor Reachability ...
research
∙
05/02/2016
