6 citations · 9 across the 6 of their papers we have counts for
Showing 2017 · cs.PLShow all
2 papers · 2 filters
cs.PL2017
Proofs as Relational Invariants of Synthesized Execution Grammars
Caleb Voss, David Heath, William Harris
The automatic verification of programs that maintain unbounded low-level data structures is a critical and open problem. Analyzers and verifiers developed in previous work can synt…
cs.PL2017★ 2 cited
Completely Automated Equivalence Proofs
Qi Zhou, David Heath, William Harris
Verifying partial (i.e., termination-insensitive) equivalence of programs has significant practical applications in software development and education. Conventional equivalence ver…