| Martín Abadi | |
| Birth Place: | Argentina |
| Fields: | Computer science Cryptography |
| Workplaces: | Google University of California, Santa Cruz Collège de France |
| Education: | PhD, Stanford University, 1987 |
| Doctoral Advisor: | Zohar Manna |
| Known For: | Burrows–Abadi–Needham logic Baby Modula-3 A Theory of Objects |
Martín Abadi (born 1963)[1] is an Argentine computer scientist, working at Google .[2] He earned his Doctor of Philosophy (PhD) in computer science from Stanford University in 1987 as a student of Zohar Manna.
He is well known for his work on computer security, on programming languages, and machine learning. In security, Abadi developed (with Michael Burrows and Roger Needham) the Burrows–Abadi–Needham logic for analyzing authentication protocols, and with Needham received the IEEE S&P Test of Time award for his work Prudent engineering practice for cryptographic protocols.[3]
In programming language research, he published a book (with Luca Cardelli) A Theory of Objects, laying out formal calculi for the semantics of object-oriented programming languages.[4] Additionally, In 1993, he published the programming language Baby Modula-3, a safe subset or sublanguage of Modula-3, based on functional programming and set theory ideals.
Abadi is a core developer for the machine learning framework Tensorflow.[5] He has contributed to the development of differentially private stochastic gradient descent.https://arxiv.org/pdf/1607.00133.pdf%20
He is a 2008 Fellow of the Association for Computing Machinery.[6] In 2011, he was a temporary professor at the Collège de France in Paris,[7] teaching computer security. He was elected a member of the National Academy of Engineering in 2018[8] for contributions to the formal theory of computer security.
He is related to Moussa Abadi, a Syrian Jew, and a member of the French Resistance of World War II, and to investment banker and philanthropist Carlos Abadi.[9]