Year |
Citation |
Score |
2015 |
Sen K, Necula G, Gong L, Choi W. MultiSE: Multi-path symbolic execution using value summaries 2015 10th Joint Meeting of the European Software Engineering Conference and the Acm Sigsoft Symposium On the Foundations of Software Engineering, Esec/Fse 2015 - Proceedings. 842-853. DOI: 10.1145/2786805.2786830 |
0.527 |
|
2015 |
Choi W, Chandra S, Necula G, Sen K. SJS: A type system for javascript with fixed object layout Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9291: 181-198. DOI: 10.1007/978-3-662-48288-9_11 |
0.591 |
|
2012 |
Burnim J, Elmas T, Necula G, Sen K. NDetermin: Inferring nondeterministic sequential specifications for parallelism correctness Acm Sigplan Notices. 47: 329-330. DOI: 10.1145/2370036.2145879 |
0.511 |
|
2012 |
Burnim J, Necula G, Sen K. Specifying and checking semantic atomicity for multithreaded programs Acm Sigplan Notices. 47: 79-90. DOI: 10.1145/2248487.1950377 |
0.38 |
|
2011 |
Burnim J, Elmas T, Necula G, Sen K. NDSeq: Runtime checking for nondeterministic sequential specifications of parallel correctness Proceedings of the Acm Sigplan Conference On Programming Language Design and Implementation (Pldi). 401-414. DOI: 10.1145/1993498.1993545 |
0.52 |
|
2008 |
Weimer W, Necula GC. Exceptional situations and program reliability Acm Transactions On Programming Languages and Systems. 30. DOI: 10.1145/1330017.1330019 |
0.796 |
|
2007 |
Chander A, Espinosa D, Islam N, Lee P, Necula GC. Enforcing resource bounds via static verification of dynamic checks Acm Transactions On Programming Languages and Systems. 29. DOI: 10.1145/1275497.1275503 |
0.531 |
|
2007 |
Gulwani S, Necula GC. A polynomial-time algorithm for global value numbering Science of Computer Programming. 64: 97-114. DOI: 10.1016/J.Scico.2006.03.005 |
0.677 |
|
2007 |
Condit J, Harren M, Anderson Z, Gay D, Necula GC. Dependent types for low-level programming Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4421: 520-535. |
0.48 |
|
2006 |
Chang BYE, Chlipala A, Necula GC. A framework for certified program analysis and its applications to mobile-code safety Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3855: 174-189. |
0.525 |
|
2006 |
Chang BYE, Harren M, Necula GC. Analysis of low-level code using cooperating decompilers Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4134: 318-335. |
0.353 |
|
2005 |
Necula GC, Condit J, Harren M, McPeak S, Weimer W. CCured: Type-safe retrofitting of legacy software Acm Transactions On Programming Languages and Systems. 27: 477-526. DOI: 10.1145/1065887.1065892 |
0.357 |
|
2005 |
Gulwani S, Necula GC. Precise interprocedural analysis using random interpretation Conference Record of the Annual Acm Symposium On Principles of Programming Languages. 324-337. DOI: 10.1145/1047659.1040332 |
0.655 |
|
2005 |
Gulwani S, Necula GC. A randomized satisfiability procedure for arithmetic and uninterpreted function symbols Information and Computation. 199: 107-131. DOI: 10.1016/j.ic.2004.10.006 |
0.593 |
|
2005 |
Harren M, Necula GC. Using dependent types to certify the safety of assembly code Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3672: 155-170. DOI: 10.1007/11547662_12 |
0.441 |
|
2005 |
Chang BYE, Necula GC, Chlipala A, Schneck RR. The open verifier framework for foundational verifiers Proceedings of the Tldi'05: 2005 Acm Sigplan International Workshop On Types in Languages Design and Implementation. 1-12. |
0.776 |
|
2005 |
Weimer W, Necula GC. Mining temporal specifications for error detection Lecture Notes in Computer Science. 3440: 461-476. |
0.47 |
|
2005 |
Necula GC, Gulwani S. Randomized algorithms for program analysis and verification Lecture Notes in Computer Science. 3576: 1. |
0.688 |
|
2005 |
Chang BYE, Chlipala A, Necula GC, Schneck RR. Type-based verification of assembly language for compiler debugging Proceedings of the Tldi'05: 2005 Acm Sigplan International Workshop On Types in Languages Design and Implementation. 91-102. |
0.756 |
|
2004 |
Necula GC, Lee P. The design and implementation of a certifying compiler Acm Sigplan Notices. 39: 614-625. DOI: 10.1145/989393.989454 |
0.561 |
|
2004 |
Weimer W, Necula GC. Finding and preventing run-time error handling mistakes 19th Annual Acm Conference On Object-Oriented Programming, Systems, Languages, and Applications, Oopsla'04. 419-431. DOI: 10.1145/1035292.1029011 |
0.446 |
|
2004 |
Harren M, Necula GC. Lightweight Wrappers for Interfacing with Binary Code in CCured Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3233: 209-225. |
0.33 |
|
2004 |
Gulwani S, Necula GC. Global value numbering using random interpretation Conference Record of the Annual Acm Symposium On Principles of Programming Languages. 31: 342-352. |
0.657 |
|
2004 |
Whitehead N, Abadi M, Necula G. By reason and authority: A system for authorization of proof-carrying code Proceedings of the Computer Security Foundations Workshop. 17: 236-250. |
0.368 |
|
2004 |
McPeak S, Necula GC. Elkhound: A fast, practical GLR parser generator Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2985: 73-88. |
0.333 |
|
2004 |
Gulwani S, Tiwari A, Necula GC. Join algorithms for the theory of uninterpreted functions Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3328: 311-323. |
0.582 |
|
2004 |
Gulwani S, Necula GC. Path-sensitive analysis for linear arithmetic and uninterpreted functions Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3148: 328-343. |
0.677 |
|
2003 |
Necula GC, Schneck RR. Proof-carrying code with untrusted proof rules Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2609: 283-298. |
0.383 |
|
2003 |
Von Behren R, Condit J, Zhou F, Necula GC, Brewer E. Capriccio: Scalable threads for internet services Operating Systems Review (Acm). 37: 268-281. |
0.354 |
|
2003 |
Necula GC, Schneck RR. A sound framework for untrusted verification-condition generators Proceedings - Symposium On Logic in Computer Science. 248-260. |
0.735 |
|
2003 |
Condit J, Harren M, McPeak S, Necula GC, Weimer W. CCured in the real world Proceedings of the Acm Sigplan Conference On Programming Language Design and Implementation (Pldi). 232-244. |
0.658 |
|
2003 |
Gulwani S, Necula GC. Discovering affine equalities using random interpretation Conference Record of the Annual Acm Symposium On Principles of Programming Languages. 74-84. |
0.666 |
|
2002 |
Necula GC, McPeak S, Rahul SP, Weimer W. CIL: Intermediate language and tools for analysis and transformation of C programs Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2304: 213-228. DOI: 10.1007/3-540-45937-5_16 |
0.478 |
|
2002 |
Necula GC, McPeak S, Weimer W. CCured: Type-safe retrofitting of legacy code Conference Record of the Annual Acm Symposium On Principles of Programming Languages. 128-139. |
0.626 |
|
2002 |
Henzinger TA, Jhala R, Majumdar R, Necula GC, Sutre G, Weimer W. Temporal-Safety proofs for systems code Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2404: 526-538. |
0.32 |
|
2002 |
Schneck RR, Necula GC. Gradual approach to a more trustworthy, yet scalable, proof-carrying code Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2392: 47-62. |
0.769 |
|
2001 |
Necula GC. A scalable architecture for proof-carrying code Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2024: 21-39. DOI: 10.1007/3-540-44716-4_2 |
0.366 |
|
2001 |
Necula GC, Rahul SP. Oracle-based checking of untrusted software Sigplan Notices (Acm Special Interest Group On Programming Languages). 36: 142-154. |
0.511 |
|
2000 |
Necula GC. Translation validation for an optimizing compiler Proceedings of the Acm Sigplan Conference On Programming Language Design and Implementation (Pldi). 83-94. |
0.392 |
|
2000 |
Colby C, Lee P, Necula GC. A certifying compiler for Java Proceedings of the Acm Sigplan Conference On Programming Language Design and Implementation (Pldi). 95-107. |
0.44 |
|
1999 |
Necula GC. Enforcing security and safety with proof-carrying code Electronic Notes in Theoretical Computer Science. 20: 117-131. DOI: 10.1016/S1571-0661(04)80070-7 |
0.365 |
|
1998 |
Necula GC, Lee P. Design and implementation of a certifying compiler Proceedings of the Acm Sigplan Conference On Programming Language Design and Implementation (Pldi). 333-344. |
0.523 |
|
1997 |
Necula G, Lee P. Research on proof-carrying code for untrusted-code security Proceedings of the Ieee Computer Society Symposium On Research in Security and Privacy. 204. |
0.343 |
|
Show low-probability matches. |