George Necula#C Intermediate Language

{{Short description|Romanian computer scientist}}

{{Infobox scientist

| name = George Necula

| image = George Necula.jpg

| image_size =

| caption = George Necula in Berkeley in 2010.

| birth_date =

| birth_place =

| death_date =

| death_place =

| residence =

| citizenship =

| nationality = Romanian

| ethnicity =

| field = Computer Science

| work_institution = Google

| alma_mater = Polytechnic University of Bucharest

| doctoral_advisor = Peter Lee

| doctoral_students =

| known_for = Proof-carrying code

| author_abbreviation_bot =

| author_abbreviation_zoo =

| prizes =

| religion =

| footnotes =

}}

George Ciprian Necula is a Romanian computer scientist, engineer at Google, and former professor at the University of California, Berkeley who does research in the area of programming languages and software engineering, with a particular focus on software verification and formal methods. He is best known for his Ph.D. thesis work first describing proof-carrying code,George C. Necula. [http://www.cs.berkeley.edu/~necula/Papers/thesis.pdf Compiling with Proofs]. PhD thesis, School of Computer Science, Carnegie Mellon Univ., Sept. 1998. a work that received the 2007 SIGPLAN Most Influential POPL Paper Award.{{cite web |url=http://www.sigplan.org/award-popl.htm |title=Most Influential POPL Paper Award |author=SIGPLAN |date=2010-01-24 |publisher=ACM |access-date=2010-02-02 |url-status=dead |archive-url=https://web.archive.org/web/20090802224413/http://www.sigplan.org/award-popl.htm |archive-date=2009-08-02 }}

Life and work

Originally from Baia Mare, Romania,{{cite web |url=http://www.eecs.berkeley.edu/~necula/ |title=George Necula's Home Page |author=George Necula |date=Spring 2010 |access-date=2010-02-03}} Necula received a BS in Computer Science (1992) from the Polytechnic University of Bucharest. He then came to Carnegie Mellon University in the United States, completing his MS in Computer Science (1995) and PhD in Computer Science (1998) under programming-languages researcher Peter Lee. His PhD work introduced proof-carrying code, which was influential as a mechanism to allow untrusted machine code to run safely without performance overhead. He joined as faculty at the University of California, Berkeley in 1998.

More recently, Necula's work has focused on open-source analysis, verification, and transformation tools for C, including the C Intermediate Language (CIL), CCured [https://web.archive.org/web/20100701155129/http://hal.cs.berkeley.edu/ccured/], and Deputy [https://web.archive.org/web/20100619124453/http://deputy.cs.berkeley.edu/].

=C Intermediate Language=

C Intermediate Language (CIL) is a simplified subset of the C programming language, as well as a set of tools for transforming C programs into that language.{{cite conference

|author1=George C. Necula

|author2=Scott McPeak

|author3=Shree Prakash Rahul

|author4=Westley Weimer

|year=2002

|title=CIL: Intermediate Language and Tools for Analysis and Transformation of C Programs

|conference=Proc. 11th Int'l Conf. on Compiler Construction

|publisher=Springer

|isbn=3-540-43369-4

|pages=213–228

}}{{Cite web|url=https://github.com/cil-project/cil|title = GitHub - cil-project/Cil: C Intermediate Language| website=GitHub }}http://portal.acm.org/citation.cfm?id=727796 CIL: Intermediate Language and Tools for Analysis and Transformation of C Programs Lecture Notes in Computer Science; Vol. 2304 Proceedings of the 11th International Conference on Compiler Construction Pages: 213 - 228. Year of Publication: 2002. {{ISBN|3-540-43369-4}}

Several other tools use CIL as a way to have access to a C abstract syntax tree. One of these programs is Frama-C (Framework to Analyze C programs).

Awards

Necula is a Fellow of the Okawa Foundation and the Alfred P. Sloan Foundation (see Sloan Fellowship). He received the Grace Murray Hopper Award in 2001,{{cite web |url=http://awards.acm.org/citation.cfm?id=0142067&aw=145&ao=GMHOPPER&yr=2001 |title=ACM Award Citation / George Necula |author=Association for Computing Machinery |year=2001 |access-date=2010-02-02 |archive-date=2012-04-19 |archive-url=https://web.archive.org/web/20120419234420/http://awards.acm.org/citation.cfm?id=0142067&aw=145&ao=GMHOPPER&yr=2001 |url-status=dead }} the National Science Foundation CAREER Award in 1999,{{cite web |url=https://www.nsf.gov/awardsearch/showAward.do?AwardNumber=9875171 |title=Award Abstract #9875171 - CAREER: A Logic-Based Approach to Software System Integrity and Security |author=National Science Foundation |date=2002-06-22 |access-date=2010-02-02}} and the ACM SIGOPS Hall of Fame Award in 2006.{{cite web |url=http://www.sigops.org/award-hof.html |title=SIGOPS - Hall of Fame Award |author=Association for Computing Machinery |year=2010 |access-date=2010-02-02}}

References

{{Reflist}}