Barbara Liskov Admitted to National Inventors Hall of Fame
Barbara Liskov Admitted to National Inventors Hall of Fame
Written by Sue Gee   
Monday, 05 March 2012

Barbara Liskov is among the 2012 inductees to the National Inventors Hall of Fame in recognition of her contributions to programming languages and system design.

 

Professor Liskov, who is a principal investigator at MIT's Computer Science and Artificial Intelligence Lab (CSAIL), already has several other awards, including the Turing Award (2009) and the Katayanagi Prize in Computer Science (2011).

She received The Society of Women Engineers' Achievement Award in 1996,  the IEEE von Neumann medal in 2004 and in 2008, she was awarded the ACM SIGPLAN Programming Languages Achievement Award. She was also the first U.S. woman to receive a Ph.D. from a computer science department, which she earned at Stanford in 1968.

 

liskov

 

According to a statement on the National Inventors Hall of Fame website:

"MIT Institute Professor Liskov is considered an innovator in the design of computer programming languages, largely for helping to make computer programs more reliable, secure, and easy to use. Her innovations can be found within almost all modern programming languages."

Among her contributions is the Liskov Substitution Principle (LSP), formalized in 1994, which characterizes when it is safe to substitute an object of a subtype for an object of the parent type, thus preventing strange behaviors when the program is run.

More Information

National Inventors Hall of Fame 2012 Inductees Barbara Liskov's profile at CSAIL

Related Articles

4th Annual Katayanagi Prizes Awarded

Covariance and contravariance - a simple guide

 

 
 
 

blog comments powered by Disqus

 

To be informed about new articles on I Programmer, subscribe to the RSS feed, follow us on Google+, Twitter, Linkedin or Facebook or sign up for our weekly newsletter.

 

Banner


Go Language Of The Year With Dart Catching Up
11/01/2017

At the turn of the year we always take a look at the dubious results offered by the TIOBE index. Don't get too hung up on issues of accuracy, this is more about the feeling of the programming communit [ ... ]



//No Comment - Is Parallel Programming Hard; Column Subset Selection Is NP-complete & The Balance Attack Against Proof-Of-Work Blockchains
16/01/2017

Is Parallel Programming Hard, And, If So, What Can You Do About It?  

Column Subset Selection Is NP-complete

The Balance Attack Against Proof-Of-Work Blockchains: The R3 Testbed as an Exam [ ... ]


More News

Last Updated ( Monday, 05 March 2012 )
 
 

   
RSS feed of news items only
I Programmer News
Copyright © 2017 i-programmer.info. All Rights Reserved.
Joomla! is Free Software released under the GNU/GPL License.