2 citations · 3 across the 4 of their papers we have counts for
4 papers
A benchmark for vericoding: formally verified program synthesis
Sergiu Bursuc, Theodore Ehrenborg, Shaowei Lin +10
We present and test the largest benchmark for vericoding, LLM-generation of formally verified code from formal specifications - in contrast to vibe coding, which generates potentia…
Software-Based Memory Erasure with relaxed isolation requirements: Extended Version
Sergiu Bursuc, Reynaldo Gil-Pons, Sjouke Mauw +1
A Proof of Secure Erasure (PoSE) is a communication protocol where a verifier seeks evidence that a prover has erased its memory within the time frame of the protocol execution. De…
Provably Unlinkable Smart Card-based Payments
Sergiu Bursuc, Ross Horne, Sjouke Mauw +1
The most prevalent smart card-based payment method, EMV, currently offers no privacy to its users. Transaction details and the card number are sent in cleartext, enabling the profi…
Automated verification of dynamic root of trust protocols (long version)
Sergiu Bursuc, Christian Johansen, Shiwei Xu
Automated verification of security protocols based on dynamic root of trust, typically relying on protected hardware such as TPM, involves several challenges that we address in thi…