research
∙
08/23/2023
State Merging with Quantifiers in Symbolic Execution
We address the problem of constraint encoding explosion which hinders th...
share
research
∙
06/02/2021
Putting the Squeeze on Array Programs: Loop Verification via Inductive Rank Reduction
Automatic verification of array manipulating programs is a challenging p...
research
∙
10/02/2020
Proving Highly-Concurrent Traversals Correct
Modern highly-concurrent search data structures, such as search trees, o...
research
∙
09/06/2020
A Thread-Local Semantics and Efficient Static Analyses for Race Free Programs
Data race free (DRF) programs constitute an important class of concurren...
research
∙
07/10/2020
Hypothetical Reasoning via Provenance Abstraction
Data analytics often involves hypothetical reasoning: repeatedly modifyi...
research
∙
07/10/2020
COBRA: Compression via Abstraction of Provenance for Hypothetical Reasoning
Data analytics often involves hypothetical reasoning: repeatedly modifyi...
research
∙
05/10/2018
Order out of Chaos: Proving Linearizability Using Local Views
Proving the linearizability of highly concurrent data structures, such a...
research
∙
01/12/2018
Safe Privatization in Transactional Memory
Transactional memory (TM) facilitates the development of concurrent appl...
research
∙
01/12/2018
