1 citations · 1 across the 3 of their papers we have counts for
3 papers
Toward Inferring Accurate Context-free Grammars for Big Languages in a Black-box Setting
Mohammad Rifat Arefin, Nuhiat Arefin, Shanto Rahman +1
Black-box context-free grammar inference is crucial for program analysis, reverse engineering, program understanding, fuzzing, and security. But existing approaches such as Arvada,…
Black-box Context-free Grammar Inference for Readable & Natural Grammars
Mohammad Rifat Arefin, Shanto Rahman, Christoph Csallner
Black-box context-free grammar inference is crucial for program analysis, reverse engineering, and security, yet existing tools such as Arvada, TreeVada, and Kedavra struggle with…
Fast Deterministic Black-box Context-free Grammar Inference
Mohammad Rifat Arefin, Suraj Shetiya, Zili Wang +1
Black-box context-free grammar inference is a hard problem as in many practical settings it only has access to a limited number of example programs. The state-of-the-art approach A…