23 citations · 24 across the 3 of their papers we have counts for
3 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…
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…