|
Search the dblp DataBase
Jeremy Condit:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Jeremy Condit, George C. Necula
Data Slicing: Separating the Heap into Independent Regions. [Citation Graph (0, 0)][DBLP] CC, 2005, pp:172-187 [Conf]
- J. Robert von Behren, Jeremy Condit, Eric A. Brewer
Why Events Are a Bad Idea (for High-Concurrency Servers). [Citation Graph (0, 0)][DBLP] HotOS, 2003, pp:19-24 [Conf]
- Feng Zhou, Jeremy Condit, Zachary R. Anderson, Ilya Bagrak, Robert Ennals, Matthew Harren, George C. Necula, Eric A. Brewer
SafeDrive: Safe and Recoverable Extensions Using Language-Based Techniques. [Citation Graph (0, 0)][DBLP] OSDI, 2006, pp:45-60 [Conf]
- Jeremy Condit, Matthew Harren, Scott McPeak, George C. Necula, Westley Weimer
CCured in the real world. [Citation Graph (0, 0)][DBLP] PLDI, 2003, pp:232-244 [Conf]
- J. Robert von Behren, Jeremy Condit, Feng Zhou, George C. Necula, Eric A. Brewer
Capriccio: scalable threads for internet services. [Citation Graph (0, 0)][DBLP] SOSP, 2003, pp:268-281 [Conf]
- George C. Necula, Jeremy Condit, Matthew Harren, Scott McPeak, Westley Weimer
CCured: type-safe retrofitting of legacy software. [Citation Graph (0, 0)][DBLP] ACM Trans. Program. Lang. Syst., 2005, v:27, n:3, pp:477-526 [Journal]
- Jeremy Condit, Matthew Harren, Zachary R. Anderson, David Gay, George C. Necula
Dependent Types for Low-Level Programming. [Citation Graph (0, 0)][DBLP] ESOP, 2007, pp:520-535 [Conf]
Dynamically replicated memory: building reliable systems from nanoscale resistive memories. [Citation Graph (, )][DBLP]
Beyond Bug-Finding: Sound Program Analysis for Linux. [Citation Graph (, )][DBLP]
Thirty Years Is Long Enough: Getting Beyond C. [Citation Graph (, )][DBLP]
Type-preserving compilation for large-scale optimizing object-oriented compilers. [Citation Graph (, )][DBLP]
Unifying type checking and property checking for low-level code. [Citation Graph (, )][DBLP]
Better I/O through byte-addressable, persistent memory. [Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.003secs
|