+
|
Reward Augmentation in Reinforcement Learning for Testing Distributed Systems
|
2024
|
Andrea Borgarelli
Constantin Enea
Rupak Majumdar
Srinidhi Nagendra
|
+
PDF
Chat
|
Strong Linearizability using Primitives with Consensus Number 2
|
2024
|
Hagit Attiya
Armando Castañeda
Constantin Enea
|
+
PDF
Chat
|
CSSTs: A Dynamic Data Structure for Partial Orders in Concurrent Execution Analysis
|
2024
|
Hünkar Can Tunç
Ameya Prashant Deshmukh
Berk Çirişci
Constantin Enea
Andreas Pavlogiannis
|
+
PDF
Chat
|
CSSTs: A Dynamic Data Structure for Partial Orders in Concurrent
Execution Analysis
|
2024
|
Hünkar Can Tunç
Ameya Prashant Deshmukh
Berk Çirişci
Constantin Enea
Andreas Pavlogiannis
|
+
PDF
Chat
|
Strong Linearizability using Primitives with Consensus Number 2
|
2024
|
Hagit Attiya
Armando Castañeda
Constantin Enea
|
+
PDF
Chat
|
Dynamic Partial Order Reduction for Checking Correctness against Transaction Isolation Levels
|
2023
|
Ahmed Bouajjani
Constantin Enea
Enrique Román-Calvo
|
+
|
A Pragmatic Approach to Stateful Partial Order Reduction
|
2023
|
Berk Çirişci
Constantin Enea
Azadeh Farzan
Suha Orhun Mutluergil
|
+
|
Quorum Tree Abstractions of Consensus Protocols
|
2023
|
Berk Çirişci
Constantin Enea
Suha Orhun Mutluergil
|
+
|
The Commutativity Quotients of Concurrent Objects
|
2023
|
Constantin Enea
Parisa Fathololumi
Eric Koskinen
|
+
|
A Domain Specific Language for Testing Consensus Implementations
|
2023
|
Cezara Drăgoi
Constantin Enea
Srinidhi Nagendra
Mandayam Srivas
|
+
|
Dynamic Partial Order Reduction for Checking Correctness against Transaction Isolation Levels
|
2023
|
Ahmed Bouajjani
Constantin Enea
Enrique Román-Calvo
|
+
PDF
Chat
|
Quorum Tree Abstractions of Consensus Protocols
|
2023
|
Berk Çirişci
Constantin Enea
Suha Orhun Mutluergil
|
+
|
Blunting an Adversary Against Randomized Concurrent Programs with Linearizable Implementations
|
2022
|
Hagit Attiya
Constantin Enea
Jennifer Welch
|
+
|
Automated Synthesis of Asynchronizations
|
2022
|
Sidi Mohamed Beillahi
Ahmed Bouajjani
Constantin Enea
Shuvendu K. Lahiri
|
+
|
A Pragmatic Approach to Stateful Partial Order Reduction
|
2022
|
Berk Çirişci
Constantin Enea
Azadeh Farzan
Suha Orhun Mutluergil
|
+
|
Automated Synthesis of Asynchronizations
|
2022
|
Sidi Mohamed Beillahi
Ahmed Bouajjani
Constantin Enea
Shuvendu K. Lahiri
|
+
|
Linearizable Implementations Suffice for Termination of Randomized Concurrent Programs.
|
2021
|
Hagit Attiya
Constantin Enea
Jennifer L. Welch
|
+
|
Impossibility of Strongly-Linearizable Message-Passing Objects via Simulation by Single-Writer Registers
|
2021
|
Hagit Attiya
Constantin Enea
Jennifer L. Welch
|
+
PDF
Chat
|
Checking Robustness Between Weak Transactional Consistency Models
|
2021
|
Sidi Mohamed Beillahi
Ahmed Bouajjani
Constantin Enea
|
+
|
MonkeyDB: Effectively Testing Correctness against Weak Isolation Levels.
|
2021
|
Ranadeep Biswas
Diptanshu Kakwani
Jyothi Vedurada
Constantin Enea
Akash Lal
|
+
PDF
Chat
|
Checking causal consistency of distributed databases
|
2021
|
Rachid Zennou
Ranadeep Biswas
Ahmed Bouajjani
Constantin Enea
Mohammed Erradi
|
+
|
Impossibility of Strongly-Linearizable Message-Passing Objects via Simulation by Single-Writer Registers.
|
2021
|
Hagit Attiya
Constantin Enea
Jennifer L. Welch
|
+
|
Blunting an Adversary Against Randomized Concurrent Programs with Linearizable Implementations
|
2021
|
Hagit Attiya
Constantin Enea
Jennifer L. Welch
|
+
|
Impossibility of Strongly-Linearizable Message-Passing Objects via Simulation by Single-Writer Registers
|
2021
|
Hagit Attiya
Constantin Enea
Jennifer L. Welch
|
+
|
MonkeyDB: Effectively Testing Correctness against Weak Isolation Levels
|
2021
|
Ranadeep Biswas
Diptanshu Kakwani
Jyothi Vedurada
Constantin Enea
Akash Lal
|
+
|
Checking Robustness Between Weak Transactional Consistency Models
|
2021
|
Sidi Mohamed Beillahi
Ahmed Bouajjani
Constantin Enea
|
+
PDF
Chat
|
Proving highly-concurrent traversals correct
|
2020
|
Yotam M. Y. Feldman
Artem Khyzha
Constantin Enea
Adam Morrison
Aleksandar Nanevski
Noam Rinetzky
Sharon Shoham
|
+
|
Proving Highly-Concurrent Traversals Correct
|
2020
|
Yotam M. Y. Feldman
Artem Khyzha
Constantin Enea
Adam Morrison
Aleksandar Nanevski
Noam Rinetzky
Sharon Shoham
|
+
PDF
Chat
|
On the complexity of checking transactional consistency
|
2019
|
Ranadeep Biswas
Constantin Enea
|
+
|
Robustness Against Transactional Causal Consistency.
|
2019
|
Sidi Mohamed Beillahi
Ahmed Bouajjani
Constantin Enea
|
+
PDF
Chat
|
Replication-aware linearizability
|
2019
|
Chao Wang
Constantin Enea
Suha Orhun Mutluergil
Gustavo Petri
|
+
|
Checking Robustness Against Snapshot Isolation
|
2019
|
Sidi Mohamed Beillahi
Ahmed Bouajjani
Constantin Enea
|
+
|
Replication-Aware Linearizability
|
2019
|
Constantin Enea
Suha Orhun Mutluergil
Gustavo Petri
Chao Wang
|
+
|
Putting Strong Linearizability in Context: Preserving Hyperproperties in Programs that Use Concurrent Objects
|
2019
|
Hagit Attiya
Constantin Enea
|
+
|
Robustness Against Transactional Causal Consistency
|
2019
|
Sidi Mohamed Beillahi
Ahmed Bouajjani
Constantin Enea
|
+
PDF
Chat
|
Checking Causal Consistency of Distributed Databases
|
2019
|
Rachid Zennou
Ranadeep Biswas
Ahmed Bouajjani
Constantin Enea
Mohammed Erradi
|
+
|
Putting Strong Linearizability in Context: Preserving Hyperproperties in Programs that Use Concurrent Objects.
|
2019
|
Hagit Attiya
Constantin Enea
|
+
|
On the Complexity of Checking Transactional Consistency
|
2019
|
Ranadeep Biswas
Constantin Enea
|
+
|
Checking Robustness Against Snapshot Isolation
|
2019
|
Sidi Mohamed Beillahi
Ahmed Bouajjani
Constantin Enea
|
+
|
Verifying Visibility-Based Weak Consistency
|
2019
|
Siddharth Krishna
Michael Emmi
Constantin Enea
Dejan Jovanović
|
+
PDF
Chat
|
Datalog-based scalable semantic diffing of concurrent programs
|
2018
|
Chungha Sung
Shuvendu K. Lahiri
Constantin Enea
Chao Wang
|
+
|
Reasoning About TSO Programs Using Reduction and Abstraction.
|
2018
|
Ahmed Bouajjani
Constantin Enea
Suha Orhun Mutluergil
Serdar Taşiran
|
+
PDF
Chat
|
On reducing linearizability to state reachability
|
2018
|
Ahmed Bouajjani
Michael Emmi
Constantin Enea
Jad Hamza
|
+
|
Order out of Chaos: Proving Linearizability Using Local Views
|
2018
|
Yotam M. Y. Feldman
Constantin Enea
Adam Morrison
Noam Rinetzky
Sharon Shoham
|
+
|
Datalog-based Scalable Semantic Diffing of Concurrent Programs
|
2018
|
Chungha Sung
Shuvendu K. Lahiri
Constantin Enea
Chao Wang
|
+
|
On the Completeness of Verifying Message Passing Programs under Bounded Asynchrony
|
2018
|
Ahmed Bouajjani
Constantin Enea
Kailiang Ji
Shaz Qadeer
|
+
|
Reasoning About TSO Programs Using Reduction and Abstraction
|
2018
|
Ahmed Bouajjani
Constantin Enea
Suha Orhun Mutluergil
Serdar Taşiran
|
+
|
Proving linearizability using forward simulations
|
2017
|
Ahmed Bouajjani
Michael Emmi
Constantin Enea
Suha Orhun Mutluergil
|
+
PDF
Chat
|
Proving Linearizability Using Forward Simulations
|
2017
|
Ahmed Bouajjani
Michael Emmi
Constantin Enea
Suha Orhun Mutluergil
|
+
|
Checking Linearizability of Concurrent Priority Queues
|
2017
|
Ahmed Bouajjani
Constantin Enea
Chao Wang
|
+
|
Exposing Non-Atomic Methods of Concurrent Objects
|
2017
|
Michael Emmi
Constantin Enea
|
+
PDF
Chat
|
On verifying causal consistency
|
2017
|
Ahmed Bouajjani
Constantin Enea
Rachid Guerraoui
Jad Hamza
|
+
|
Proving linearizability using forward simulations
|
2017
|
Ahmed Bouajjani
Michael Emmi
Constantin Enea
Suha Orhun Mutluergil
|
+
PDF
Chat
|
On verifying causal consistency
|
2016
|
Ahmed Bouajjani
Constantin Enea
Rachid Guerraoui
Jad Hamza
|
+
|
On Verifying Causal Consistency
|
2016
|
Ahmed Bouajjani
Constantin Enea
Rachid Guerraoui
Jad Hamza
|
+
|
On the path-width of integer linear programming
|
2016
|
Constantin Enea
Peter Habermehl
Omar Inverso
Gennaro Parlato
|
+
|
On Verifying Causal Consistency
|
2016
|
Ahmed Bouajjani
Constantin Enea
Rachid Guerraoui
Jad Hamza
|
+
|
On Reducing Linearizability to State Reachability
|
2015
|
Ahmed Bouajjani
Michael Emmi
Constantin Enea
Jad Hamza
|
+
PDF
Chat
|
On Automated Lemma Generation for Separation Logic with Inductive Definitions
|
2015
|
Constantin Enea
Mihaela Sighireanu
Zhilin Wu
|
+
PDF
Chat
|
On Reducing Linearizability to State Reachability
|
2015
|
Ahmed Bouajjani
Michael Emmi
Constantin Enea
Jad Hamza
|
+
|
On Reducing Linearizability to State Reachability
|
2015
|
Ahmed Bouajjani
Michael Emmi
Constantin Enea
Jad Hamza
|
+
PDF
Chat
|
On the Path-Width of Integer Linear Programming
|
2014
|
Constantin Enea
Peter Habermehl
Omar Inverso
Gennaro Parlato
|
+
|
Model Checking an Epistemic mu-calculus with Synchronous and Perfect Recall Semantics
|
2013
|
Rodica Bozianu
Cătălin Dima
Constantin Enea
|
+
|
Model-checking an Epistemic μ-calculus with Synchronous and Perfect Recall Semantics
|
2012
|
Rodica Bozianu
Cătălin Dima
Constantin Enea
|
+
PDF
Chat
|
Model-Checking an Alternating-time Temporal Logic with Knowledge, Imperfect Information, Perfect Recall and Communicating Coalitions
|
2010
|
Cătălin Dima
Constantin Enea
Dimitar P. Guelev
|
+
PDF
Chat
|
A Generic Framework for Reasoning about Dynamic Networks of Infinite-State Processes
|
2009
|
Ahmed Bouajjani
Cezara Drăgoi
Constantin Enea
Yan Jurski
Mihaela Sighireanu
|