2016 - ACM Distinguished Member
2003 - Fellow of Alfred P. Sloan Foundation
2001 - ACM Grace Murray Hopper Award For his seminal work on the concept and implementation of Proof Carrying Code, which has had a great impact on the field of programming languages and compilers and has given a new direction to applications of theorem proving to program correctness, such as safety of mobile code and component-based software.
His scientific interests lie mostly in Programming language, Proof-carrying code, Type safety, Dead code elimination and Source code. His study in Typed assembly language, Memory safety, Single Compilation Unit, Functional compiler and Inline expansion is carried out as part of his Programming language studies. His work in Proof-carrying code covers topics such as Assembly language which are related to areas like Formal proof, Network packet and Machine code.
The various areas that he examines in his Type safety study include Program transformation and Compile time. His Dead code elimination study combines topics from a wide range of disciplines, such as Intrinsic function, Compiler construction, Compiler correctness, Manifest expression and Dynamic compilation. His work deals with themes such as Unreachable code, Code, Redundant code, Code generation and Code Access Security, which intersect with Source code.
His primary areas of study are Programming language, Proof-carrying code, Theoretical computer science, Code and Algorithm. Programming language is represented through his Source code, Compiler, Correctness, Type safety and Java research. His study focuses on the intersection of Source code and fields such as Code Access Security with connections in the field of Sandbox.
His Type safety study also includes fields such as
George C. Necula focuses on Programming language, JavaScript, Thread, Correctness and Nondeterministic algorithm. His research is interdisciplinary, bridging the disciplines of Code generation and Programming language. His JavaScript research also works with subjects such as
His research on Thread also deals with topics like
George C. Necula mainly focuses on Programming language, Thread, JavaScript, Troubleshooting and Spark. His Programming language study frequently links to other fields, such as Android. His Thread research includes elements of Event, Web application, Real-time computing and User interface.
His JavaScript research integrates issues from Concolic testing, Scalability and Theoretical computer science. His research in Troubleshooting intersects with topics in SIGNAL, Minification, Distributed computing and Parallel computing.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Proof-carrying code
George C. Necula.
symposium on principles of programming languages (1997)
Proof-carrying code
George C. Necula.
symposium on principles of programming languages (1997)
CIL: Intermediate Language and Tools for Analysis and Transformation of C Programs
George C. Necula;Scott McPeak;Shree Prakash Rahul;Westley Weimer.
compiler construction (2002)
CIL: Intermediate Language and Tools for Analysis and Transformation of C Programs
George C. Necula;Scott McPeak;Shree Prakash Rahul;Westley Weimer.
compiler construction (2002)
CCured: type-safe retrofitting of legacy code
George C. Necula;Scott McPeak;Westley Weimer.
symposium on principles of programming languages (2002)
CCured: type-safe retrofitting of legacy code
George C. Necula;Scott McPeak;Westley Weimer.
symposium on principles of programming languages (2002)
Safe kernel extensions without run-time checking
George C. Necula;Peter Lee.
operating systems design and implementation (1996)
Safe kernel extensions without run-time checking
George C. Necula;Peter Lee.
operating systems design and implementation (1996)
Translation validation for an optimizing compiler
George C. Necula.
programming language design and implementation (2000)
Translation validation for an optimizing compiler
George C. Necula.
programming language design and implementation (2000)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:
Carnegie Mellon University
University of California, Berkeley
Microsoft (United States)
University of Michigan–Ann Arbor
Institute of Science and Technology Austria
University of California, Berkeley
University of Stuttgart
University of California, San Diego
Stanford University
Lacework
Hitachi (Japan)
Bulgarian Academy of Sciences
ETH Zurich
Waseda University
Spaulding Rehabilitation Hospital
University of Iowa
Institució Catalana de Recerca i Estudis Avançats
University of Florence
University of Washington
Osaka University
Rutgers, The State University of New Jersey
University of California, Riverside
University of Michigan–Ann Arbor
University of Tennessee Health Science Center
Johns Hopkins University
University of Maryland, College Park