| Publication | Date of Publication | Type |
|---|
Blunting an Adversary Against Randomized Concurrent Programs with Linearizable Implementations
Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
Gradual consistency checking
Computer Aided Verification | 2024-02-16 | Paper |
Checking robustness against snapshot isolation
Computer Aided Verification | 2024-02-16 | Paper |
On the complexity of checking consistency for replicated data types
Computer Aided Verification | 2024-02-16 | Paper |
scientific article; zbMATH DE number 7774258 (Why is no real title available?)
(available as arXiv preprint) | 2023-12-08 | Paper |
| Quorum tree abstractions of consensus protocols | 2023-11-24 | Paper |
A pragmatic approach to stateful partial order reduction
Lecture Notes in Computer Science | 2023-08-17 | Paper |
Automated synthesis of asynchronizations
Static Analysis | 2023-07-28 | Paper |
Monitoring weak consistency
Computer Aided Verification | 2023-05-26 | Paper |
On the completeness of verifying message passing programs under bounded asynchrony
Computer Aided Verification | 2023-05-05 | Paper |
Reasoning about TSO programs using reduction and abstraction
Computer Aided Verification | 2023-05-05 | Paper |
| Putting strong linearizability in context: preserving hyperproperties in programs that use concurrent objects | 2023-02-03 | Paper |
Robustness Against Transactional Causal Consistency.
(available as arXiv preprint) | 2023-02-03 | Paper |
Boosting Sequential Consistency Checking Using Saturation
1517.68086 | 2022-12-22 | Paper |
Verifying visibility-based weak consistency
Programming Languages and Systems | 2022-10-13 | Paper |
Checking causal consistency of distributed databases
Computing | 2022-09-27 | Paper |
Proving linearizability using forward simulations
(available as arXiv preprint) | 2022-08-12 | Paper |
Order out of chaos: proving linearizability using local views
(available as arXiv preprint) | 2022-07-21 | Paper |
Checking robustness between weak transactional consistency models
(available as arXiv preprint) | 2021-10-18 | Paper |
| On the path-width of integer linear programming | 2021-06-24 | Paper |
On the path-width of integer linear programming
(available as arXiv preprint) | 2021-06-24 | Paper |
scientific article; zbMATH DE number 7327945 (Why is no real title available?)
(available as arXiv preprint) | 2021-03-26 | Paper |
| scientific article; zbMATH DE number 7327945 (Why is no real title available?) | 2021-03-26 | Paper |
| scientific article; zbMATH DE number 7311252 (Why is no real title available?) | 2021-02-16 | Paper |
| Root causing linearizability violations | 2021-02-04 | Paper |
| Formalizing and checking multilevel consistency | 2020-08-05 | Paper |
Checking linearizability of concurrent priority queues
(available as arXiv preprint) | 2020-05-27 | Paper |
| On atomicity in presence of non-atomic writes | 2019-09-17 | Paper |
Abstract Semantic Diffing of Evolving Concurrent Programs
Static Analysis | 2019-09-16 | Paper |
Abstract semantic diffing of evolving concurrent programs
Formal Methods in System Design | 2019-09-04 | Paper |
On reducing linearizability to state reachability
Information and Computation | 2018-06-14 | Paper |
Compositional entailment checking for a fragment of separation logic
Formal Methods in System Design | 2018-01-08 | Paper |
On verifying causal consistency
Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages | 2017-10-20 | Paper |
Verifying robustness of event-driven asynchronous programs against concurrency
Programming Languages and Systems | 2017-05-19 | Paper |
On the path-width of integer linear programming
Information and Computation | 2017-03-16 | Paper |
Symbolic abstract data type inference
Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages | 2016-10-24 | Paper |
Tractable refinement checking for concurrent objects
Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages | 2016-09-29 | Paper |
Compositional entailment checking for a fragment of separation logic
Programming Languages and Systems | 2016-02-26 | Paper |
On automated lemma generation for separation logic with inductive definitions
Automated Technology for Verification and Analysis | 2016-01-08 | Paper |
On reducing linearizability to state reachability
Lecture Notes in Computer Science | 2015-11-04 | Paper |
Verifying eventual consistency of optimistic replication systems
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages | 2014-04-10 | Paper |
Verifying concurrent programs against sequential specifications
Programming Languages and Systems | 2013-08-05 | Paper |
Compositional invariant checking for overlaid and nested linked lists
Programming Languages and Systems | 2013-08-05 | Paper |
| Nondeducibility on strategies in the temporal logic of knowledge | 2012-12-29 | Paper |
Accurate invariant checking for programs manipulating lists and arrays with infinite data
Automated Technology for Verification and Analysis | 2012-11-21 | Paper |
An alternating-time temporal logic with knowledge, perfect recall and past: axiomatisation and model-checking
Journal of Applied Non-Classical Logics | 2012-07-17 | Paper |
Abstract domains for automated reasoning about list-manipulating programs with infinite data
Lecture Notes in Computer Science | 2012-06-15 | Paper |
A Logic-Based Framework for Reasoning about Composite Data Structures
CONCUR 2009 - Concurrency Theory | 2009-10-22 | Paper |
A Generic Framework for Reasoning about Dynamic Networks of Infinite-State Processes
Logical Methods in Computer Science | 2009-06-30 | Paper |
Abstractions of Multi-agent Systems
Multi-Agent Systems and Applications V | 2008-09-25 | Paper |
Abstractions of data types
Acta Informatica | 2006-05-26 | Paper |
SE-SYSTEMS, TIMING MECHANISMS, AND TIME-VARYING CODES
International Journal of Computer Mathematics | 2002-10-21 | Paper |
