


Остановите войну!
for scientists:


default search action
George C. Necula
Person information

- affiliation: University of California, Berkeley, USA
- award (2001): Grace Murray Hopper Award
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
- [c67]Wontae Choi, Koushik Sen, George C. Necula, Wenyu Wang
:
DetReduce: minimizing Android GUI test suites for regression testing. ICSE 2018: 445-455 - 2016
- [c66]Colin Scott, Aurojit Panda, Vjekoslav Brajkovic, George C. Necula, Arvind Krishnamurthy, Scott Shenker:
Minimizing Faulty Executions of Distributed Systems. NSDI 2016: 291-309 - 2015
- [c65]Wontae Choi, Satish Chandra, George C. Necula, Koushik Sen:
SJS: A Type System for JavaScript with Fixed Object Layout. SAS 2015: 181-198 - [c64]Michael Pradel, Parker Schuh, George C. Necula, Koushik Sen:
EventBreak: Analyzing the Responsiveness of User Interfaces through Performance-Guided Test Generation. Software Engineering & Management 2015: 131 - [c63]Koushik Sen, George C. Necula, Liang Gong, Wontae Choi:
MultiSE: multi-path symbolic execution using value summaries. ESEC/SIGSOFT FSE 2015: 842-853 - 2014
- [c62]Michael Pradel, Parker Schuh, George C. Necula, Koushik Sen:
EventBreak: analyzing the responsiveness of user interfaces through performance-guided test generation. OOPSLA 2014: 33-47 - 2013
- [c61]Philip Reames, George C. Necula:
Towards hinted collection: annotations for decreasing garbage collector pause times. ISMM 2013: 3-14 - [c60]Wontae Choi, George C. Necula, Koushik Sen:
Guided GUI testing of android apps with minimal restart and approximate learning. OOPSLA 2013: 623-640 - [c59]Tayfun Elmas, Jacob Burnim, George C. Necula, Koushik Sen:
CONCURRIT: a domain specific language for reproducing concurrency bugs. PLDI 2013: 153-164 - 2012
- [j7]George C. Necula, Scott McPeak, Westley Weimer:
CCured: type-safe retrofitting of legacy code. ACM SIGPLAN Notices 47(4a): 74-85 (2012) - [c58]Jacob Burnim, Tayfun Elmas, George C. Necula, Koushik Sen:
CONCURRIT: Testing Concurrent Programs with Programmable State-Space Exploration. HotPar 2012 - [c57]Jacob Burnim, Tayfun Elmas, George C. Necula, Koushik Sen:
NDetermin: inferring nondeterministic sequential specifications for parallelism correctness. PPoPP 2012: 329-330 - [i1]Derrick Coetzee, Anand Bhaskar, George C. Necula:
A model and framework for reliable build systems. CoRR abs/1203.2704 (2012) - 2011
- [c56]Jacob Burnim, George C. Necula, Koushik Sen:
Specifying and checking semantic atomicity for multithreaded programs. ASPLOS 2011: 79-90 - [c55]Jacob Burnim, Tayfun Elmas, George C. Necula, Koushik Sen:
NDSeq: runtime checking for nondeterministic sequential specifications of parallel correctness. PLDI 2011: 401-414 - [r1]George C. Necula:
Proof-Carrying Code. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 984-986
2000 – 2009
- 2008
- [j6]Westley Weimer, George C. Necula:
Exceptional situations and program reliability. ACM Trans. Program. Lang. Syst. 30(2): 8:1-8:51 (2008) - [e5]George C. Necula, Philip Wadler:
Proceedings of the 35th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2008, San Francisco, California, USA, January 7-12, 2008. ACM 2008, ISBN 978-1-59593-689-9 [contents] - 2007
- [j5]Sumit Gulwani, George C. Necula:
A polynomial-time algorithm for global value numbering. Sci. Comput. Program. 64(1): 97-114 (2007) - [j4]Ajay Chander, David Espinosa, Nayeem Islam, Peter Lee, George C. Necula:
Enforcing resource bounds via static verification of dynamic checks. ACM Trans. Program. Lang. Syst. 29(5): 28 (2007) - [c54]Jeremy Condit, Matthew Harren, Zachary R. Anderson, David Gay, George C. Necula:
Dependent Types for Low-Level Programming. ESOP 2007: 520-535 - [c53]Zachary R. Anderson, Eric A. Brewer, Jeremy Condit, Robert Ennals, David Gay, Matthew Harren, George C. Necula, Feng Zhou:
Beyond Bug-Finding: Sound Program Analysis for Linux. HotOS 2007 - [c52]Bor-Yuh Evan Chang, Xavier Rival, George C. Necula:
Shape Analysis with Structural Invariant Checkers. SAS 2007: 384-401 - [e4]Jens Knoop, George C. Necula, Wolf Zimmermann:
Proceedings of the 5th International Workshop on Compiler Optimization meets Compiler Verification, COCV@ETAPS 2006, Vienna, Austria, April 2, 2006. Electronic Notes in Theoretical Computer Science 176(3), Elsevier 2007 [contents] - [e3]François Pottier, George C. Necula:
Proceedings of TLDI'07: 2007 ACM SIGPLAN International Workshop on Types in Languages Design and Implementation, Nice, France, January 16, 2007. ACM 2007, ISBN 1-59593-393-X [contents] - 2006
- [c51]George C. Necula:
Using Dependent Types to Port Type Systems to Low-Level Languages. CC 2006: 1 - [c50]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. OSDI 2006: 45-60 - [c49]Úlfar Erlingsson, Martín Abadi, Michael Vrable, Mihai Budiu, George C. Necula:
XFI: Software Guards for System Address Spaces. OSDI 2006: 75-88 - [c48]Bor-Yuh Evan Chang, Matthew Harren, George C. Necula:
Analysis of Low-Level Code Using Cooperating Decompilers. SAS 2006: 318-335 - [c47]Bor-Yuh Evan Chang, Adam Chlipala, George C. Necula:
A Framework for Certified Program Analysis and Its Applications to Mobile-Code Safety. VMCAI 2006: 174-189 - [c46]Jens Knoop, George C. Necula, Wolf Zimmermann:
Preface. COCV@ETAPS 2006: 1-2 - 2005
- [j3]Sumit Gulwani, George C. Necula:
A randomized satisfiability procedure for arithmetic and uninterpreted function symbols. Inf. Comput. 199(1-2): 107-131 (2005) - [j2]George C. Necula, Jeremy Condit, Matthew Harren, Scott McPeak, Westley Weimer:
CCured: type-safe retrofitting of legacy software. ACM Trans. Program. Lang. Syst. 27(3): 477-526 (2005) - [c45]George C. Necula, Sumit Gulwani:
Randomized Algorithms for Program Analysis and Verification. CAV 2005: 1 - [c44]Ajay Chander, David Espinosa, Nayeem Islam, Peter Lee, George C. Necula:
JVer: A Java Verifier. CAV 2005: 144-147 - [c43]Scott McPeak, George C. Necula:
Data Structure Specifications via Local Equality Axioms. CAV 2005: 476-490 - [c42]Jeremy Condit, George C. Necula:
Data Slicing: Separating the Heap into Independent Regions. CC 2005: 172-187 - [c41]Ajay Chander, David Espinosa, Nayeem Islam, Peter Lee, George C. Necula:
Enforcing Resource Bounds via Static Verification of Dynamic Checks. ESOP 2005: 311-325 - [c40]Sumit Gulwani, George C. Necula:
Precise interprocedural analysis using random interpretation. POPL 2005: 324-337 - [c39]Matthew Harren, George C. Necula:
Using Dependent Types to Certify the Safety of Assembly Code. SAS 2005: 155-170 - [c38]Westley Weimer, George C. Necula:
Mining Temporal Specifications for Error Detection. TACAS 2005: 461-476 - [c37]Bor-Yuh Evan Chang
, Adam Chlipala, George C. Necula, Robert R. Schneck:
The open verifier framework for foundational verifiers. TLDI 2005: 1-12 - [c36]Bor-Yuh Evan Chang
, Adam Chlipala, George C. Necula, Robert R. Schneck:
Type-based verification of assembly language for compiler debugging. TLDI 2005: 91-102 - [c35]Jens Knoop, George C. Necula, Wolf Zimmermann:
Preface. COCV@ETAPS 2005: 1-3 - [e2]Jens Knoop, George C. Necula, Wolf Zimmermann:
Proceedings of the 3rd International Workshop on Compiler Optimization Meets Compiler Verification, COCV@ETAPS 2004, Barcelona, Spain, April 3, 2004. Electronic Notes in Theoretical Computer Science 132(1), Elsevier 2005 [contents] - [e1]Jens Knoop, George C. Necula, Wolf Zimmermann:
Proceedings of the Fourth International Workshop on Compiler Optimization meets Compiler Verification, COCV@ETAPS 2005, Edinburgh, UK, April 3, 2005. Electronic Notes in Theoretical Computer Science 141(2), Elsevier 2005 [contents] - 2004
- [c34]Scott McPeak, George C. Necula:
Elkhound: A Fast, Practical GLR Parser Generator. CC 2004: 73-88 - [c33]Nathan Whitehead, Martín Abadi, George C. Necula:
By Reason and Authority: A System for Authorization of Proof-Carrying Code. CSFW 2004: 236-250 - [c32]Sumit Gulwani, Ashish Tiwari, George C. Necula:
Join Algorithms for the Theory of Uninterpreted Functions. FSTTCS 2004: 311-323 - [c31]Westley Weimer, George C. Necula:
Finding and preventing run-time error handling mistakes. OOPSLA 2004: 419-431 - [c30]Sumit Gulwani, George C. Necula:
Global value numbering using random interpretation. POPL 2004: 342-352 - [c29]Sumit Gulwani, George C. Necula:
A Polynomial-Time Algorithm for Global Value Numbering. SAS 2004: 212-227 - [c28]Sumit Gulwani, George C. Necula:
Path-Sensitive Analysis for Linear Arithmetic and Uninterpreted Functions. SAS 2004: 328-343 - [c27]Jens Knoop, George C. Necula, Wolf Zimmermann:
Preface. COCV@ETAPS 2004: 1-3 - 2003
- [c26]Sumit Gulwani, George C. Necula:
A Randomized Satisfability Procedure for Arithmetic and Uninterpreted Function Symbols. CADE 2003: 167-181 - [c25]Matthew Harren, George C. Necula:
Lightweight Wrappers for Interfacing with Binary Code in CCured. ISSS 2003: 209-225 - [c24]George C. Necula, Robert R. Schneck:
A Sound Framework for Untrusted Verification-Condition Generators. LICS 2003: 248-260 - [c23]Jeremy Condit, Matthew Harren, Scott McPeak, George C. Necula, Westley Weimer:
CCured in the real world. PLDI 2003: 232-244 - [c22]Sumit Gulwani, George C. Necula:
Discovering affine equalities using random interpretation. POPL 2003: 74-84 - [c21]J. Robert von Behren, Jeremy Condit, Feng Zhou, George C. Necula, Eric A. Brewer:
Capriccio: scalable threads for internet services. SOSP 2003: 268-281 - 2002
- [c20]Robert R. Schneck, George C. Necula:
A Gradual Approach to a More Trustworthy, Yet Scalable, Proof-Carrying Code. CADE 2002: 47-62 - [c19]Thomas A. Henzinger, Ranjit Jhala, Rupak Majumdar, George C. Necula, Grégoire Sutre, Westley Weimer:
Temporal-Safety Proofs for Systems Code. CAV 2002: 526-538 - [c18]George C. Necula, Scott McPeak, Shree Prakash Rahul, Westley Weimer:
CIL: Intermediate Language and Tools for Analysis and Transformation of C Programs. CC 2002: 213-228 - [c17]George C. Necula, Robert R. Schneck:
Proof-Carrying Code with Untrusted Proof Rules. ISSS 2002: 283-298 - [c16]George C. Necula, Scott McPeak, Westley Weimer:
CCured: type-safe retrofitting of legacy code. POPL 2002: 128-139 - 2001
- [c15]George C. Necula:
A Scalable Architecture for Proof-Carrying Code. FLOPS 2001: 21-39 - [c14]George C. Necula, Shree Prakash Rahul:
Oracle-based checking of untrusted software. POPL 2001: 142-154 - 2000
- [j1]George C. Necula, Shree Prakash Rahul:
A logic-based approach to software system safety and security. ACM SIGSOFT Softw. Eng. Notes 25(1): 67-68 (2000) - [c13]George C. Necula, Peter Lee:
Proof Generation in the Touchstone Theorem Prover. CADE 2000: 25-44 - [c12]Christopher Colby, Peter Lee, George C. Necula:
A Proof-Carrying Code Architecture for Java. CAV 2000: 557-560 - [c11]George C. Necula:
Translation validation for an optimizing compiler. PLDI 2000: 83-94 - [c10]Christopher Colby, Peter Lee, George C. Necula, Fred Blau, Mark Plesko, Kenneth Cline:
A certifying compiler for Java. PLDI 2000: 95-107 - [c9]George C. Necula:
Proof-carrying code: design, implementation and applications (abstract). PPDP 2000: 175-177
1990 – 1999
- 1999
- [c8]George C. Necula:
Enforcing Security and Safety with Proof-Carrying Code. MFPS 1999: 117-131 - 1998
- [c7]George C. Necula, Peter Lee:
Efficient Representation and Validation of Proofs. LICS 1998: 93-104 - [c6]George C. Necula, Peter Lee:
Safe, Untrusted Agents Using Proof-Carrying Code. Mobile Agents and Security 1998: 61-91 - [c5]George C. Necula, Peter Lee:
The Design and Implementation of a Certifying Compiler. PLDI 1998: 333-344 - [c4]George C. Necula, Peter Lee:
The design and implementation of a certifying compiler (with retrospective). Best of PLDI 1998: 612-625 - 1997
- [c3]George C. Necula:
Proof-Carrying Code. POPL 1997: 106-119 - [c2]George C. Necula, Peter Lee:
Research on Proof-Carrying Code for Untrusted-Code Security. S&P 1997: 204 - 1996
- [c1]George C. Necula, Peter Lee:
Safe Kernel Extensions Without Run-Time Checking. OSDI 1996: 229-243
Coauthor Index

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2023-10-22 22:09 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint