4 papers
Complexity Results in Team Semantics: Nonemptiness Is Not So Complex
Aleksi Anttila, Juha Kontinen, Fan Yang
We initiate the study of the complexity-theoretic properties of convex logics in team semantics. We focus on the extension of classical propositional logic with the nonemptiness at…
Integrating Symbolic Execution with LLMs for Automated Generation of Program Specifications
Fanpeng Yang, Xu Ma, Shuling Wang +5
Automatically generating formal specifications including loop invariants, preconditions, and postconditions for legacy code is critical for program understanding, reuse and verific…
There are (other) ways to negate in propositional team semantics
Fan Yang
The languages of logics based on team semantics typically only allow atomic negation or restricted negation. In this paper, we explore propositional team-based logics with full (in…
Automated Proof Generation for Rust Code via Self-Evolution
Tianyu Chen, Shuai Lu, Shan Lu +11
Ensuring correctness is crucial for code generation. Formal verification offers a definitive assurance of correctness, but demands substantial human effort in proof construction an…