Jeannette Wing | |
---|---|
![]() | |
Born | Jeannette Marie Wing 4 December 1956 |
Nationality | American |
Alma mater | Massachusetts Institute of Technology (BS, MS, PhD) |
Scientific career | |
Fields | Computer science |
Institutions | Columbia University, Carnegie Mellon University, University of Southern California |
Thesis | A Two-Tiered Approach to Specifying Programs (1983) |
Doctoral advisor | John Guttag [1] |
Doctoral students | Greg Morrisett [1] |
Website | cs |
Jeannette Marie Wing is Avanessians Director of the Data Science Institute at Columbia University, where she is also a professor of computer science. [2] Until June 30, 2017, she was Corporate Vice President of Microsoft Research with oversight of its core research laboratories around the world and Microsoft Research Connections. [3] [4] Prior to 2013, she was the President's Professor of Computer Science at Carnegie Mellon University, Pittsburgh, Pennsylvania, United States. She also served as assistant director for Computer and Information Science and Engineering at the NSF from 2007 to 2010. [5] [6] [7] [8] [9] [10] [11] [12] [13] [14] She was appointed the Columbia University executive vice president for research in 2021. [15]
Wing earned her S.B. and S.M. in Electrical Engineering and Computer Science at MIT in June 1979. Her advisers were Ronald Rivest and John Reiser. In 1983, she earned her Ph.D. in Computer Science at MIT under John Guttag. [1] She is a fourth-degree black belt in Tang Soo Do. [16]
Wing was on the faculty of the University of Southern California from 1982 to 1985 and then the faculty of Carnegie Mellon from 1985 to 2012. She served as the head of the Computer Science Department from 2004 to 2007 and from 2010 to 2012. In January 2013, she took a leave from Carnegie Mellon to work at Microsoft Research.
Wing has been a leading member of the formal methods community, especially in the area of Larch. She has led many research projects and has published widely. [17]
With Barbara Liskov, she developed the Liskov substitution principle, published in 1993.
She has also been a strong promoter of computational thinking, expressing the algorithmic problem-solving and abstraction techniques used by computer scientists and how they might be applied in other disciplines. [5]
She is a member of the editorial board of the following journals:
Wing was named a Fellow of the IEEE in 2003, "for contributions to methods for software systems". [18]
Sir Charles Antony Richard Hoarehor is a British computer scientist who has made foundational contributions to programming languages, algorithms, operating systems, formal verification, and concurrent computing. His work earned him the Turing Award, usually regarded as the highest distinction in computer science, in 1980.
The Liskov substitution principle (LSP) is a particular definition of a subtyping relation, called strong behavioral subtyping, that was initially introduced by Barbara Liskov in a 1987 conference keynote address titled Data abstraction and hierarchy. It is based on the concept of "substitutability" – a principle in object-oriented programming stating that an object may be replaced by a sub-object without breaking the program. It is a semantic rather than merely syntactic relation, because it intends to guarantee semantic interoperability of types in a hierarchy, object types in particular. Barbara Liskov and Jeannette Wing described the principle succinctly in a 1994 paper as follows:
Subtype Requirement: Let be a property provable about objects of type T. Then should be true for objects of type S where S is a subtype of T.
The Gödel Prize is an annual prize for outstanding papers in the area of theoretical computer science, given jointly by the European Association for Theoretical Computer Science (EATCS) and the Association for Computing Machinery Special Interest Group on Algorithms and Computational Theory. The award is named in honor of Kurt Gödel. Gödel's connection to theoretical computer science is that he was the first to mention the "P versus NP" question, in a 1956 letter to John von Neumann in which Gödel asked whether a certain NP-complete problem could be solved in quadratic or linear time.
A Byzantine fault is a condition of a computer system, particularly distributed computing systems, where components may fail and there is imperfect information on whether a component has failed. The term takes its name from an allegory, the "Byzantine generals problem", developed to describe a situation in which, to avoid catastrophic failure of the system, the system's actors must agree on a concerted strategy, but some of these actors are unreliable.
The Larch Prover, or LP for short, is an interactive theorem proving system for multi-sorted first-order logic. It was used at MIT and elsewhere during the 1990s to reason about designs for circuits, concurrent algorithms, hardware, and software.
Barbara Liskov is an American computer scientist who has made pioneering contributions to programming languages and distributed computing. Her notable work includes the introduction of abstract data types and the accompanying principle of data abstraction, along with the Liskov substitution principle, which applies these ideas to object-oriented programming, subtyping, and inheritance. Her work was recognized with the 2008 Turing Award, the highest distinction in computer science.
James Jay Horning was an American computer scientist and ACM Fellow.
John Vogel Guttag is an American computer scientist, professor, and former head of the department of electrical engineering and computer science at MIT. He conducts research on computer networks and medical applications of AI as co-lead of the MIT Computer Science and Artificial Intelligence Laboratory's Networks and Mobile Systems Group.
Maurice Peter Herlihy is an American computer scientist active in the field of multiprocessor synchronization. Herlihy has contributed to areas including theoretical foundations of wait-free synchronization, linearizable data structures, applications of combinatorial topology to distributed computing, as well as hardware and software transactional memory. He is the An Wang Professor of Computer Science at Brown University, where he has been a member of the faculty since 1994.
Virgil Dorin Gligor is a Romanian-American professor of electrical and computer engineering who specializes in the research of network security and applied cryptography.
Oscar Peter Buneman, is a British computer scientist who works in the areas of database systems and database theory.
Computational thinking (CT) refers to the thought processes involved in formulating problems so their solutions can be represented as computational steps and algorithms. In education, CT is a set of problem-solving methods that involve expressing problems and their solutions in ways that a computer could also execute. It involves automation of processes, but also using computing to explore, analyze, and understand processes.
Daniel Jackson is a professor of Computer Science at the Massachusetts Institute of Technology (MIT). He is the principal designer of the Alloy modelling language, and author of the books Software Abstractions: Logic, Language, and Analysis and The Essence of Software. He leads the Software Design Group at MIT's Computer Science and Artificial Intelligence Laboratory.
Amos Fiat is an Israeli computer scientist, a professor of computer science at Tel Aviv University. He is known for his work in cryptography, online algorithms, and algorithmic game theory.
Liuba Shrira is a professor of computer science at Brandeis University, whose research interests primarily involve distributed systems. Shrira is accredited with having coined the phrase "promise" when referring to the completion of an asynchronous operation and its resulting value for the JavaScript programming language
Mathai Joseph is an Indian computer scientist and author.
Sergiy A. Vilkomir was a Ukrainian-born computer scientist.
Hussein S. M. Zedan was a computer scientist of Egyptian descent, mainly based in the United Kingdom.