| MonkeyDB: effectively testing correctness under weak isolation levels | 0 | 0.34 | 2021 |
| Checking Robustness Between Weak Transactional Consistency Models. | 0 | 0.34 | 2021 |
| Impossibility of Strongly-Linearizable Message-Passing Objects via Simulation by Single-Writer Registers. | 0 | 0.34 | 2021 |
| Testing consensus implementations using communication closure | 0 | 0.34 | 2020 |
| Verifying Visibility-Based Weak Consistency | 0 | 0.34 | 2020 |
| Proving Highly-Concurrent Traversals Correct | 0 | 0.34 | 2020 |
| Behavioral simulation for smart contracts | 0 | 0.34 | 2020 |
| Boosting Sequential Consistency Checking Using Saturation. | 0 | 0.34 | 2020 |
| Verifying Visibility-Based Weak Consistency. | 0 | 0.34 | 2020 |
| Inductive sequentialization of asynchronous programs | 1 | 0.35 | 2020 |
| Violat: Generating Tests Of Observational Refinement For Concurrent Objects | 0 | 0.34 | 2019 |
| Replication-Aware Linearizability. | 0 | 0.34 | 2019 |
| Verification, Model Checking, and Abstract Interpretation - 20th International Conference, VMCAI 2019, Cascais, Portugal, January 13-15, 2019, Proceedings. | 0 | 0.34 | 2019 |
| Robustness Against Transactional Causal Consistency | 0 | 0.34 | 2019 |
| SL-COMP: Competition of Solvers for Separation Logic | 0 | 0.34 | 2019 |
| Gradual Consistency Checking | 0 | 0.34 | 2019 |
| Putting Strong Linearizability in Context: Preserving Hyperproperties in Programs that Use Concurrent Objects. | 0 | 0.34 | 2019 |
| SL-COMP: Competition of Solvers for Separation Logic. | 0 | 0.34 | 2019 |
| On The Complexity Of Checking Consistency For Replicated Data Types | 0 | 0.34 | 2019 |
| On the complexity of checking transactional consistency | 0 | 0.34 | 2019 |
| Weak-consistency specification via visibility relaxation. | 0 | 0.34 | 2019 |
| Checking Causal Consistency of Distributed Databases. | 0 | 0.34 | 2019 |
| Checking Robustness Against Snapshot Isolation | 0 | 0.34 | 2019 |
| Reasoning About Tso Programs Using Reduction And Abstraction | 0 | 0.34 | 2018 |
| Order out of Chaos: Proving Linearizability Using Local Views. | 0 | 0.34 | 2018 |
| On The Completeness Of Verifying Message Passing Programs Under Bounded Asynchrony | 1 | 0.35 | 2018 |
| Datalog-based Scalable Semantic Diffing of Concurrent Programs. | 0 | 0.34 | 2018 |
| Sound, complete, and tractable linearizability monitoring for concurrent collections | 1 | 0.38 | 2018 |
| Monitoring Weak Consistency | 0 | 0.34 | 2018 |
| On Verifying TSO Robustness for Event-Driven Asynchronous Programs. | 0 | 0.34 | 2018 |
| SPEN: A Solver for Separation Logic. | 0 | 0.34 | 2017 |
| Checking Linearizability of Concurrent Priority Queues. | 0 | 0.34 | 2017 |
| Verifying Robustness of Event-Driven Asynchronous Programs Against Concurrency. | 0 | 0.34 | 2017 |
| Abstract Semantic Diffing of Evolving Concurrent Programs. | 2 | 0.36 | 2017 |
| Verifying Robustness of Event-Driven Asynchronous Programs Against Concurrency. | 2 | 0.37 | 2017 |
| On Automated Lemma Generation for Separation Logic with Inductive Definitions | 10 | 0.53 | 2015 |
| On Reducing Linearizability to State Reachability. | 4 | 0.40 | 2015 |
| Checking Correctness of Concurrent Objects: Tractable Reductions to Reachability (Invited Talk). | 0 | 0.34 | 2015 |
| Tractable Refinement Checking for Concurrent Objects | 17 | 0.66 | 2015 |
| Verifying eventual consistency of optimistic replication systems | 19 | 0.83 | 2014 |
| Verifying concurrent programs against sequential specifications | 21 | 0.83 | 2013 |
| Local Shape Analysis for Overlaid Data Structures. | 5 | 0.43 | 2013 |
| Model Checking an Epistemic mu-calculus with Synchronous and Perfect Recall Semantics. | 3 | 0.39 | 2013 |
| Compositional invariant checking for overlaid and nested linked lists | 13 | 0.60 | 2013 |
| Model-checking an Epistemic μ-calculus with Synchronous and Perfect Recall Semantics | 0 | 0.34 | 2012 |
| Accurate invariant checking for programs manipulating lists and arrays with infinite data | 18 | 0.75 | 2012 |
| Abstract domains for automated reasoning about list-manipulating programs with infinite data | 20 | 0.70 | 2012 |
| An alternating-time temporal logic with knowledge, perfect recall and past: axiomatisation and model-checking. | 13 | 0.53 | 2011 |
| On inter-procedural analysis of programs with lists and data | 18 | 0.73 | 2011 |
| Model-Checking An Alternating-Time Temporal Logic With Knowledge, Imperfect Information, Perfect Recall And Communicating Coalitions | 16 | 0.64 | 2010 |
