1 citations · 1 across the 1 of their papers we have counts for
2 papers
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…
cs.PL2024★ 1 cited
Concurrent Data Structures Made Easy (Extended Version)
Callista Le, Kiran Gopinathan, Koon Wen Lee +2
Design of an efficient thread-safe concurrent data structure is a balancing act between its implementation complexity and performance. Lock-based concurrent data structures, which…