Natarajan Shankar
From Wikipedia the free encyclopedia
Natarajan Shankar | |
|---|---|
| Born | |
| Alma mater | IIT Madras University of Texas at Austin |
| Known for | Prototype Verification System |
| Awards | SRI International Fellow 2009 |
| Scientific career | |
| Fields | Computer Science |
| Institutions | SRI International |
Natarajan Shankar is a computer scientist working at SRI International in Menlo Park, California, where he leads the Symbolic Analysis Laboratory.[1]
Education[edit]
Shankar received his Ph.D. degree in computer science, under advisors Robert S. Boyer and J Strother Moore, from the University of Texas at Austin in 1986.[1]
His Ph.D. thesis was published as the book "Metamathematics, Machines, and Goedel's Proof" by Cambridge University Press in 1994.[2]
Career[edit]
Shankar initially served as a research associate at Stanford University, from 1986 to 1988.[1] In 1989, he joined SRI International's Computer Science Laboratory. While at SRI, he has used the Boyer–Moore theorem prover to prove metatheorems such as the tautology theorem, Godel's incompleteness theorem and the Church-Rosser theorem. He has contributed to the development of automated reasoning technology, deductive systems and computational engines, including the Prototype Verification System.[1]
In 2009, he was named an SRI Fellow.[3] The fellowship recognizes exceptional staff members for their outstanding contributions to science. The other SRI Fellows in the Computer Science Laboratory at SRI are Peter G. Neumann, John Rushby, Patrick Lincoln and Carolyn Talcott.[3]
References[edit]
- ^ a b c d "Natarajan Shankar". Federated Logic Conference 2002. Retrieved 2012-03-11.
- ^ "Metamathematics, Machines, and Goedel's Proof". SRI International. Retrieved 2012-03-11.
- ^ a b "SRI Fellows". SRI International. Retrieved 2012-03-11.
External links[edit]
| International | |
|---|---|
| National | |
| Academics | |
| Other | |
