10 citations · 11 across the 2 of their papers we have counts for
3 papers
cs.LO2017
Verifying Equivalence of Database-Driven Applications
Yuepeng Wang, Isil Dillig, Shuvendu K. Lahiri +1
This paper addresses the problem of verifying equivalence between a pair of programs that operate over databases with different schemas. This problem is particularly important in t…
cs.SE2012★ 1 cited
Theory and Techniques for Synthesizing a Family of Graph Algorithms
Srinivas Nedunuri, William R. Cook, Douglas R. Smith
Although Breadth-First Search (BFS) has several advantages over Depth-First Search (DFS) its prohibitive space requirements have meant that algorithm designers often pass it over i…
cs.PL2011★ 10 cited
Tutorial on Online Partial Evaluation
William R. Cook, Ralf Lämmel
This paper is a short tutorial introduction to online partial evaluation. We show how to write a simple online partial evaluator for a simple, pure, first-order, functional program…