Constantin Enea
where else to find them
linkedin:constantin-enea-441448189
what they talk about
all 7 in the filters
where they keep going back
- OOPSLA3 editions2020–2024
all 5 in the filters
on a stage with
all 30 in the filters
who talks about the same things
- Rupak Majumdar21 talks
- Michalis Kokologiannakis12 talks
- Ranadeep Biswas3 talks
- Ankush Desai10 talks
- Andreas Pavlogiannis18 talks
- Umang Mathur20 talks
| title | conference | date |
|---|---|---|
| Verifying Almost-Sure Termination for Randomized Distributed Algorithms | POPL 2026 | 2026-01-11 |
Presents a sound proof rule that combines martingale-based arguments with reasoning about weak fairness and produces SMT-based proofs for almost-sure… | ||
| Arbitration-Free Consistency Is Available (and Vice Versa) | POPL 2026 | 2026-01-11 |
Claims a tight iff theorem: a storage specification admits an available implementation under partitions exactly when it is arbitration-free — no requirement… | ||
| Model Checking Distributed Protocols in Must | OOPSLA 2024 | 2024-10-20 |
Must is a bounded model checker that verifies real distributed implementations by instrumenting a mainstream language (example: Rust) with a tiny concurrency… | ||
| Reward Augmentation in Reinforcement Learning for Testing Distributed Systems | OOPSLA 2024 | 2024-10-20 |
Paper proposes using reinforcement learning to bias randomized testing of real consensus implementations, implemented in Go, by adding a decaying exploration… | ||
| Scenario-based Proofs for Concurrent Objects | OOPSLA 2024 | 2024-10-20 |
Defines a small set of representative interleavings — the commutativity quotient — and an expression language (regular/context-free) that encodes them so… | ||
| Dynamic Partial Order Reduction for Checking Correctness Against Transaction Isolation(…) | PLDI 2023 | 2023-06-17 |
First DPOR-based stateless model checking algorithm for transactional apps that is sound, complete and optimal and runs in polynomial memory. It is parametric… | ||
| A Pragmatic Approach to Stateful Partial Order Reduction | VMCAI 2023 | 2023-01-15 |
Proposes stateful POR variants: a cheap static safe-set pass plus two dynamic source-set trackers (eager and lazy) implemented in Java Pathfinder. Benchmarks… | ||
| Behavioral simulation for smart contracts | SPLASH 2022 | 2022-12-05 |
Automated method claims to verify unannotated smart contracts by synthesizing behavioral refinement as simulation relations between a few manually annotated… | ||
| MonkeyDB: Effectively Testing Correctness under Weak Isolation Levels | OOPSLA 2021 | 2021-10-17 |
MonkeyDB is a mock storage that computes, from an axiomatic isolation spec, the full set of values a read could legally return and returns a random value from… | ||
| Testing Consensus Implementations using Communication Closure | OOPSLA 2020 | 2020-11-15 |
Presents a randomized tester that exploits communication closure to sample k-periodic uniform lossy synchronous executions instead of all asynchronous… | ||
| Proving Highly-Concurrent Traversals Correct | OOPSLA 2020 | 2020-11-15 |
Paper proves that optimistic lock-free traversals are correct by reducing concurrent traversal correctness to sequential reasoning plus two concrete… | ||
| nothing matches | ||