4 citations · 5 across the 2 of their papers we have counts for
2 papers
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.DC2010★ 4 cited
Formal Derivation of Concurrent Garbage Collectors
Dusko Pavlovic, Peter Pepper, Douglas R. Smith
Concurrent garbage collectors are notoriously difficult to implement correctly. Previous approaches to the issue of producing correct collectors have mainly been based on posit-and…