Showing cs.PLShow all
2 papers · 1 filter
cs.PL2024
Proving Functional Program Equivalence via Directed Lemma Synthesis
Yican Sun, Ruyi Ji, Jian Fang +3
Proving equivalence between functional programs is a fundamental problem in program verification, which often amounts to reasoning about algebraic data types (ADTs) and composition…
cs.PL2024
Decomposition-Based Synthesis for Applying Divide-and-Conquer-Like Algorithmic Paradigms
Ruyi Ji, Yuwei Zhao, Yingfei Xiong +3
Algorithmic paradigms such as divide-and-conquer (D&C) are proposed to guide developers in designing efficient algorithms, but it can still be difficult to apply algorithmic paradi…