Showing cs.SEShow all
2 papers · 1 filter
cs.SE2026
How Powerful are LLMs in Generating Formal Program Specifications?
Fanpeng Yang, Xing Li, Shuling Wang +7
Formal verification provides strong guarantees of software correctness, but its adoption is limited by the high cost of writing precise formal specifications. While recent large la…
cs.SE2025
Efficient Decomposition Identification of Deterministic Finite Automata from Examples
Junjie Meng, Jie An, Yong Li +4
The identification of deterministic finite automata (DFAs) from labeled examples is a cornerstone of automata learning, yet traditional methods focus on learning monolithic DFAs, w…