23 citations · 25 across the 4 of their papers we have counts for
5 papers
Local Reasoning for Global Graph Properties
Siddharth Krishna, Alexander J. Summers, Thomas Wies
Separation logics are widely used for verifying programs that manipulate complex heap-based data structures. These logics build on so-called separation algebras, which allow expres…
Verifying Visibility-Based Weak Consistency
Siddharth Krishna, Michael Emmi, Constantin Enea +1
Multithreaded programs generally leverage efficient and thread-safe concurrent objects like sets, key-value maps, and queues. While some concurrent-object operations are designed t…
On the tensor rank of permanent and determinant
Siddharth Krishna, Visu Makam
The tensor rank and border rank of the determinant tensor is known to be if characteristic is not two. In this paper, we show that the tensor rank remains for…
Go with the Flow: Compositional Abstractions for Concurrent Data Structures (Extended Version)
Siddharth Krishna, Dennis Shasha, Thomas Wies
Concurrent separation logics have helped to significantly simplify correctness proofs for concurrent data structures. However, a recurring problem in such proofs is that data struc…
Learning Invariants using Decision Trees
Siddharth Krishna, Christian Puhrsch, Thomas Wies
The problem of inferring an inductive invariant for verifying program safety can be formulated in terms of binary classification. This is a standard problem in machine learning: gi…