The SCEAS System
Navigation Menu

Search the dblp DataBase


Jeremy Condit: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Jeremy Condit, George C. Necula
    Data Slicing: Separating the Heap into Independent Regions. [Citation Graph (0, 0)][DBLP]
    CC, 2005, pp:172-187 [Conf]
  2. 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]
  3. 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]
  4. 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]
  5. 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]
  6. 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]
  7. 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]

  8. Dynamically replicated memory: building reliable systems from nanoscale resistive memories. [Citation Graph (, )][DBLP]

  9. Beyond Bug-Finding: Sound Program Analysis for Linux. [Citation Graph (, )][DBLP]

  10. Thirty Years Is Long Enough: Getting Beyond C. [Citation Graph (, )][DBLP]

  11. Type-preserving compilation for large-scale optimizing object-oriented compilers. [Citation Graph (, )][DBLP]

  12. Unifying type checking and property checking for low-level code. [Citation Graph (, )][DBLP]

  13. Better I/O through byte-addressable, persistent memory. [Citation Graph (, )][DBLP]

Search in 0.023secs, Finished in 0.024secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002