Elaine Weyuker

Elaine Weyuker

Elaine Weyuker is an ACM Fellow, an IEEE Fellow, and an AT&T Fellow at Bell Labs for research in software metrics and testing as well as elected to the National Academy of Engineering. She is the author of over 130 papers in journals and refereed conference proceedings.

"Weyuker" received a Ph.D. in Computer Science from Rutgers University, and an M.S.E. from the University of Pennsylvania. Prior to moving to AT&T Labs, she was on the faculty of the Courant Institute of Mathematical Sciences of New York University, was a faculty member at the City University of New York, a Systems' Engineer at I.B.M. and a programmer at Texaco.

She is the co-chair of the ACM-W committee, a member of the steering committee of the Coalition to Diversify Computing, a member of the Rutgers University Graduate School Advisory Board and was a member of the Board of Directors of the Computing Research Association. She is a member of the editorial boards of IEEE Transactions on Software Engineering, IEEE Transactions on Dependable and Secure Computing, IEEE Spectrum, the Empirical Software Engineering Journal and the Journal of Systems and Software, and was a founding editor of the ACM Transactions of Software Engineering and Methodology. She was the Secretary/Treasurer of ACM SIGSOFT and was an ACM National Lecturer.


Wikimedia Foundation. 2010.

Игры ⚽ Поможем написать курсовую

Look at other dictionaries:

  • Beyond Bias and Barriers — Beyond Bias and Barriers: Fulfilling the Potential of Women in Academic Science and Engineering (ISBN 0309100429) is a major report about the status of women in science from the United States National Academy of Sciences. Published in 2006, the… …   Wikipedia

  • Turing machine — For the test of artificial intelligence, see Turing test. For the instrumental rock band, see Turing Machine (band). Turing machine(s) Machina Universal Turing machine Alternating Turing machine Quantum Turing machine Read only Turing machine… …   Wikipedia

  • Post–Turing machine — The article Turing machine gives a general introduction to Turing machines, while this article covers a specific class of Turing machines. A Post–Turing machine is a program formulation of an especially simple type of Turing machine, comprising a …   Wikipedia

  • Domain testing — is one of the most widely practiced software testing techniques. It is a method of selecting a small number of test cases from a nearly infinite group of candidate test cases.[1][2][3][4] …   Wikipedia

  • Chomsky hierarchy — Within the field of computer science, specifically in the area of formal languages, the Chomsky hierarchy (occasionally referred to as Chomsky–Schützenberger hierarchy) is a containment hierarchy of classes of formal grammars. This hierarchy of… …   Wikipedia

  • Finite state machine — A finite state machine (FSM) or finite state automaton (plural: automata ) or simply a state machine, is a model of behavior composed of a finite number of states, transitions between those states, and actions. A finite state machine is an… …   Wikipedia

  • Theory of computation — In theoretical computer science, the theory of computation is the branch that deals with whether and how efficiently problems can be solved on a model of computation, using an algorithm. The field is divided into three major branches: automata… …   Wikipedia

  • Martin Davis — This page is on the mathematician. For the former tennis player see Martin Davis (tennis). Martin Davis Photo courtesy George M. Bergman Born …   Wikipedia

  • Martin Davis — Nombre Martin David Davis …   Wikipedia Español

  • Finite-state machine — State machine redirects here. For infinite state machines, see State transition system. For fault tolerance methodology, see State machine replication. SFSM redirects here. For the Italian railway company, see Circumvesuviana. A finite state… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”