2 papers
cs.CR2026
Beluga: Block Synchronization for BFT Consensus Protocols
Tasos Kichidis, Lefteris Kokoris-Kogias, Arun Koshy +4
Modern high-throughput BFT consensus protocols use streamlined push-pull mechanisms to disseminate blocks and keep happy-path performance optimal. Yet state-of-the-art designs lack…
cs.PL2026
Grammar Repair with Examples and Tree Automata: Extended Version
Yunjeong Lee, Gokul Rajiv, Ilya Sergey
Context-free grammars (CFGs) are the de-facto formalism for declaratively describing concrete syntax for programming languages and generating parsers. One of the major challenges i…