DOCSLIB.ORG

CRA-W Newletter April 2007.V8

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
CRA-W Newletter April 2007.V8 CRA-W Newsletter April 2007 Inside This Issue Highlight on CRA-W Alum Frances Allen Receives Amie Souter Greenwald Prestigious Turing Award Alum News 2-3 Daycare at Conferences 4 Amie Souter On February 20, 2007, the Association for Tribute to Fran Allen 4 Greenwald, a DMP mentee in Computing Machinery Profile of the Month 5 1994 and 1995, (ACM) announced that Frances (Fran) Allen is Cohort of Associate 7 graduated with the recipient of the 2006 Professors her Ph.D. in 2002. After a few A.M. Turing Award for News of Affiliated 8 years as assistant “contributions that fun- Groups professor at Drexel University, Amie made damentally improved the performance of the move to Alcatel-Lucent in 2006, where computer programs in solving problems, Upcoming Events she is member of Technical Staff, Software and accelerated the use of high perform- and Deadlines Test Lead, Technology Commercialization. ance computing.” Allen, an IBM Fellow Emerita at T.J. Watson Research Center, is May 1, 2007: CREU applica- She is applying her expertise in automated the first woman to receive this honor. The tions due software testing to next-generation commu- nication systems. Turing Award, first presented in 1966, and May 9-11: Programming named for British mathematician Alan M. Languages Workshop Q: Tell us about your job at Alcatel-Lucent. Turing, is considered to be the “Nobel May 15: Anita Borg Early Currently, I am part of small team (10 peo- Prize of computing.” Financial support for Career Award recipient an- ple) developing location-based service ap- the award, a $100,000 prize, is provided by nounced plications. The goal of our system is to de- Intel Corporation. May 17-19: CRA-W Steering Continued on page 5 Continued on page 4 Committee, Board Meetings June 9-10: Career Mentoring Soffa, Cuny, and Irwin Receive Prestigious Service Awards Workshop at FCRC Professors Mary Lou Soffa, Janice (Jan) Cuny and October 14-17: Richard Tapia Mary Jane (Janie) Irwin have received prestigious Celebration of Diversity in service awards from national organizations. Computing Conference Mary Lou Soffa October 17-19: Grace Hop- CRA A. Nico Habermann Award 2006 per Celebration of Women in Computing Conference Mary Lou Soffa, the Owen R. Cheatham Profes- sor and Chair of Computer Science at the Univer- Mary Lou Soffa (left), Janice Cuny Editors sity of Virginia, received the Computing Research (center), and Mary Jane Irwin (right). Association’s A. Nico Habermann award in 2006. Anne Condon The award is given “to a person who has made outstanding contributions aimed at increas- U. British Columbia ing the numbers and/or successes of underrepresented members in the computing research [email protected] community.” Professor Soffa was the founder of CRA-W's Affiliate Distributed Mentoring Mary Jean Harrold Project and co-founder (with Jan Cuny) of the CRA-W Graduate Student Cohort and the Georgia Tech Cohort for Associate Professors (CAPP). She is also extremely active in individual mentor- [email protected] ing. She has graduated 21 Ph.D. and 54 M.S students; more than half of these are women. Continued on page 6 CRA-W Newsletter April 2007 Alum News Shawna Thomas [[email protected]] Jen Mankoff [[email protected]] DMP 2001 (participant); CMW 2003 (participant); CREU 2002-2003 (mentor) CREU/CMP Reunion 2004 (participant) I’m an assistant pro- This (academic) year, I fessor in the Human have a DOE GAANN Computer Interac- Fellowship. I just found tion Institute, part out last week that I was of the School of awarded an IBM Ph.D. Computer Science at Fellowship for 2007-08! CMU. This year, I Pretty exciting! I also have kicked off a new several new research publi- effort to explore cations, which you can get issues of sustainabil- from my curriculum vita ity in technology, online starting with a col- (http://parasol.tamu.edu/~sthomas). laborative effort to educate people and encourage behavior change surrounding energy use Jo-Anne Ting [[email protected]] (collaborators include Sue Fussell, Michael Johnson, and Grad Cohort 2004 (participant); Deanna Matthews). I've also continued my work on assis- Grad Cohort 2005 (student speaker) tive technology with my graduate student Amy Hurst, who is focused on automated, cross-application techniques for I’m currently a fourth year supporting individuals with motor impairments. My Ph.D. student at the Univer- work is funded by the NSF, an IBM Faculty fellowship, sity of Southern California and am enjoying research very Intel, and a Sloan fellowship. much. I attended and pre- sented at the first Workshop Tony Farley [[email protected]] for Women in Machine Learn- Grad Cohort 2004-05 (participant) ing last October, which was co-located with the Grace Since my last update, I’ve been Hopper Conference in San given a full-time faculty posi- Diego. I never thought there tion! It's really been a great ex- were many women in machine perience. I've attached my offi- learning—but apparently there cial faculty photo, and my up- are! It was a pleasant surprise date follows. and offered me a chance to re-unite with some former I am currently a doctoral candi- Grad Cohort participants as well. date, and serving as a full-time faculty member at Arizona State University. My first paper Ellen Spertus [[email protected]] on the topic of my doctoral CMW 2003 (speaker); CMW 2005 (participant) research was accepted by the One of my essays was journal Networks. published in the anthol- This paper, currently in press, is entitled, "Multiterminal ogy She's Such a Geek: Resilience for Series-Parallel Networks". In my faculty posi- Women Write About Science, tion as a Lecturer, I teach computer science classes to un- Technology, and Other Nerdy dergraduate students in the Schools of Computing and In- Stuff (Seal Press, 2006). formatics, and Interdisciplinary Studies. I am chair of the Dept. of All this keeps me busy, but it's well worth it. It's amazing Mathematics & Com- how much you learn when you teach! puter Science at Mills. 2 CRA-W Newsletter April 2007 April 2007 Alum News Mary Jean Harrold [[email protected]] Anne Condon [[email protected]] CRA-W member 1998-present; CRA-W Co-chair 2003-2006; CRA-W member 1995-present; CRA-W Co-chair 2000-2003; DMP Chair 1999-2001; CMW 2005 (speaker); DMP chair 1996-1998; Fundraiser, Canadian DMP 2002- Grad Cohort 2004-07 (speaker); CREW/DMP Reunion 2004; present; DMP 1994, 2001(mentor); CAPP 2004, 2006 CAPP 2004 (distinguished speaker); DMP 2001 (mentor) (distinguished speaker); CMW 2003,2005 (speaker); Grad Cohort My big news is per- 2004-2007 (speaker); CREW/DMP Reunion 2004 (organizer) sonal—not professional. I'm loving my job as a Full On November 1, 2006, Professor in CS at UBC. My my grandson, Thomas research mostly focuses on Henry Harrold, was born prediction of nucleic acid to my son, Tom, and (DNA and RNA) secondary daughter-in-law, Linda. I structure, and I am fortunate had been looking forward to have an incredible group of to this event for a long students to work with. As time. Being a grand- NSERC/General Motors Can- mother is even more ada Chair for Women in Sci- wonderful than I had an- ence and Engineering ticipated. (www.jadeproject.ca), I'm working on many initiatives to increase the representation of Tracy Camp [[email protected]] women, including development of an interdisciplinary CMW 1993 (participant); CAPP 2004-05 (participant); CS101 course. This work has been synergistic with my role Expanding the Pipeline Column 2005 as Associate Head for Faculty Affairs since September - I've I was selected as an ACM helped develop faculty mentoring, for example. I've espe- Distinguished Scientist cially enjoyed meeting many Canadian students and faculty (October 2006). I was also at CRA-W events this year, and hope to meet many of you the Keynote Speaker at the at the Grace Hopper Conference this Fall. Australian Women in IT Conference (AusWIT) on Dec. 4 and 5 in Adelaide, Annie Antón [[email protected]] South Australia. DMP 2000-01, 2004-05 (mentor); CMW 2005 (speaker); CRA-W member 2006; CMW chair 2007 Lastly, I was invited to join the Editorial Board of the I was appointed by Depart- Pervasive and Mobile ment of Homeland Security Computing Journal (DHS) Secretary Michael (February 2007). Chertoff to serve on the DHS Data Privacy and In- tegrity Advisory Committee. Karen Panetta [[email protected]] The committee advises Sec- DMP 1997 (mentor) retary Chertoff and the DHS Chief Privacy Officer I was named the IEEE on “programmatic, policy, Women in Engineering operational, administrative (WIE) Committee Chair for and technological issues 2007. As chair, I will oversee relevant to DHS that affect the 140 WIE affinity groups individual privacy, data in- and its 11,000 members. tegrity and data interopera- bility and other privacy- related issues.” I will serve a four-year term on the commit- tee. 3 CRA-W Newsletter April 2007 Daycare at Conferences (Continued from page 1: Allen) Elaine Weyuker Allen, the first woman to be named an IBM Fellow, has received numerous other awards. Throughout her illus- For those of you old enough to have read one of the earli- trious career, she has been an inspirational mentor to est CRA-W columns in CRA News that I wrote about younger researchers and has worked to increase partici- strategies for arranging childcare while attending confer- pation of women in computing. In 2000, IBM created ences, here is an update about the infant and young child the Frances E. Allen Women in Technology Mentoring that I schlepped around to those conferences.
Load more

Recommended publications
  • SIGSOFT CFP-ICSE04.Qxd
    General Chair Richard N. Taylor Call for Participation University of California, Irvine [email protected] ACM SIGSOFT 2004 Program Chair Matthew B. Dwyer Twelfth International Symposium on the Kansas State University Foundations of Software Engineering FSE-12 [email protected] Newport Beach Program Committee Ken Anderson, U Colorado, Boulder, USA October 31 - November 5, 2004 Annie Antón, North Carolina State U, USA Hyatt Newporter Hotel, Newport Beach, California, USA Joanne Atlee, U Waterloo, Canada Prem Devanbu, U California, Davis, USA http://www.isr.uci.edu/FSE-12/ Mary Jean Harrold, Georgia Tech, USA John Hatcliff, Kansas State U, USA Jim Herbsleb, Carnegie Mellon U, USA SIGSOFT 2004 brings together researchers and practitioners from academia and industry to André van der Hoek, U California, Irvine, exchange new results related to both traditional and emerging fields of software engineer- USA ing. SIGSOFT 2004 will feature four workshops, one day of tutorials organized through the Paola Inverardi, U L'Aquila, Italy Educator's Grant Program (EGP), a student resarch forum with posters, along with FSE-12. Gregor Kiczales, U British Columbia, Canada Jeff Kramer, Imperial College London, UK FSE-12 will be held Tuesday-Thursday, November 2-4. We are pleased to announce the Shriram Krishnamurthi, Brown U, USA keynotes: Shinji Kusumoto, Osaka U, Japan Axel van Lamsweerde, U Catholique de Alexander L. Wolf, University of Colorado at Boulder, Tues. Nov. 2 Louvain, Belgium Bashar Nuseibeh, The Open U, UK Joe Marks, Director, Mitsubishi Electric Research Laboratories, Cambridge, Wed. Nov. 3 Mauro Pezzé, U Milano-Bicocca, Italy SIGSOFT Distinguished Research Award winner, Thur.
    [Show full text]
  • Parallel Program Graphs and Their Classi Cation
    Parallel Program Graphs and their Classication Vivek Sarkar Barbara Simons IBM Santa Teresa Lab oratory Bailey Avenue San Jose CA fvivek sarkarsimonsgvnetib mcom Abstract We categorize and compare dierent representations of pro gram dep endence graphs including the Control Flow Graph CFG which is a sequential representation lacking data dep endences the Program Dep endence Graph PDG which is a parallel representation of a se quential program and is comprised of control and data dep endences and more generally the Parallel Program Graph PPG which is a parallel representation of sequential and inherently parallel programs and is comprised of parallel control ow edges and synchronization edges PPGs are classied according to their graphical structure and prop erties related to deadlo ck detection and serializabil i ty Intro duction The imp ortance of optimizing compilers has increased dramatically with the development of multipro cessor computers Writing correct and ecient parallel co de is quite dicult at b est writing such software and making it p ortable cur rently is almost imp ossible Intermediate forms are required b oth for optimiza tion and p ortability A natural intermediate form is the graph that represents the instructions of the program and the dep endences that exist b etween them This is the role played by the Parallel Program Graph PPG The Control Flow Graph CFG in turn is required once p ortions of the PPG have b een mapp ed onto individual pro cessors PPGs are a generalization of Program Dep endence Graphs PDGs which have
    [Show full text]
  • Improving Web Services Maintenance Through Regression Testing Divya Rohatgi, Prof
    Volume 3, Issue 5, May-2016, pp. 261-265 ISSN (O): 2349-7084 International Journal of Computer Engineering In Research Trends Available online at: www.ijcert.org Improving Web Services Maintenance through Regression Testing Divya Rohatgi, Prof. (Col) Gurmit Singh 1. Research Scholar, Computer Science and Engineering Department Sam Higginbottom Institute of Agriculture, Technology and Sciences Deemed University, Allahabad, India 2. Professor, Computer Science and Engineering Department Sam Higginbottom Institute of Agriculture, Technology and Sciences Deemed University, Allahabad, India Abstract: - Software maintenance is considered to be the most expensive activity in software development and is used to ensure quality to the product. Regression Testing is a part of software maintainers which is done every time the software is changed. For software like Web services which represent a class of Service oriented architectures this activity is a challenging task. Since web services incorporate business functionality thus maintaining proper quality is an important concern. Due to inherent distributed, heterogeneous and dynamic in nature, regression testing is difficult and time consuming activity. Thus in order to reduce maintenance cost we have to reduce regression testing cost. Thus in this paper, we have given a comprehensive study of regression testing of web services exploring the challenges, approaches and tools used for them to ensure proper quality and inherently reducing the maintenance costs. Keywords – Software Engineering, Software Maintenance, Regression Testing, Web Service. —————————— —————————— 1. INTRODUCTION implications deriving from the adoption of the standardized stack of technology underlying web In today’s growing and competitive scenario Service– services (e.g., SOAP, WSDL, UDDI, etc.); oriented architectures are having a crucial role in the way in which systems are developed and designed.
    [Show full text]
  • Incremental Computation of Static Single Assignment Form
    Incremental Computation of Static Single Assignment Form Jong-Deok Choi 1 and Vivek Sarkar 2 and Edith Schonberg 3 IBM T.J. Watson Research Center, P. O. Box 704, Yorktown Heights, NY 10598 ([email protected]) 2 IBM Software Solutions Division, 555 Bailey Avenue, San Jose, CA 95141 ([email protected]) IBM T.J. Watson Research Center, P. O. Box 704, Yorktown Heights, NY 10598 ([email protected]) Abstract. Static single assignment (SSA) form is an intermediate rep- resentation that is well suited for solving many data flow optimization problems. However, since the standard algorithm for building SSA form is exhaustive, maintaining correct SSA form throughout a multi-pass com- pilation process can be expensive. In this paper, we present incremental algorithms for restoring correct SSA form after program transformations. First, we specify incremental SSA algorithms for insertion and deletion of a use/definition of a variable, and for a large class of updates on intervals. We characterize several cases for which the cost of these algorithms will be proportional to the size of the transformed region and hence poten- tially much smaller than the cost of the exhaustive algorithm. Secondly, we specify customized SSA-update algorithms for a set of common loop transformations. These algorithms are highly efficient: the cost depends at worst on the size of the transformed code, and in many cases the cost is independent of the loop body size and depends only on the number of loops. 1 Introduction Static single assignment (SSA) [8, 6] form is a compact intermediate program representation that is well suited to a large number of compiler optimization algorithms, including constant propagation [19], global value numbering [3], and program equivalence detection [21].
    [Show full text]
  • FINAL PROGRAM University of California, Irvine [email protected] Program Chair Matthew B
    General Chair Richard N. Taylor FINAL PROGRAM University of California, Irvine [email protected] Program Chair Matthew B. Dwyer ACM SIGSOFT 2004 University of Nebraska-Lincoln [email protected] Twelfth International Symposium on the Program Committee Ken Anderson, U Colorado, Boulder, USA Foundations of Software Engineering FSE-12 Annie Antón, North Carolina State U, USA Joanne Atlee, U Waterloo, Canada Prem Devanbu, U California, Davis, USA Mary Jean Harrold, Georgia Tech, USA John Hatcliff, Kansas State U, USA Jim Herbsleb, Carnegie Mellon U, USA André van der Hoek, U Calif., Irvine, USA Paola Inverardi, U L'Aquila, Italy Gregor Kiczales, U British Columbia, Canada Jeff Kramer, Imperial College London, UK Shriram Krishnamurthi, Brown U, USA Shinji Kusumoto, Osaka U, Japan Axel van Lamsweerde, U Catholique de Louvain, Belgium Bashar Nuseibeh, The Open U, UK Mauro Pezzé, U Milano-Bicocca, Italy Gian Pietro Picco, Politecnico di Milano, Italy David Rosenblum, U College London, UK Gregg Rothermel, U Nebraska-Lincoln, USA Wilhelm Schäfer, U Paderborn, Germany Douglas Schmidt, Vanderbilt U, USA Peri Tarr, IBM T.J. Watson, USA Frank Tip, IBM T.J. Watson, USA Willem C. Visser, NASA Ames, USA http://www.isr.uci.edu/FSE-12/ Student and Diversity Programs Co-Chairs October 31 - November 5, 2004 Educators Grant Program and Tutorials Hyatt Newporter Hotel, Newport Beach, California, USA Mary Jean Harrold Georgia Tech [email protected] Mary Lou Soffa SIGSOFT 2004 brings together researchers and practitioners from academia and industry to University of Virginia exchange new results related to both traditional and emerging fields of software engineering.
    [Show full text]
  • Curriculum Vitae James A
    Curriculum Vitae James A. Jones General Information Bio Highlights Professor Jones is perhaps best known for the creation of the influential Tarantula technique that spawned a new field of \spectra-based" fault localization. For this work, he was awarded the prestigious ACM SIGSOFT Award in 2015. Also, he is a recipient of the prestigious National Science Foundation Faculty Early Career Development (CAREER) Award, which recognizes outstanding research and excellent education. Jones's research contributions span the duration of his undergrad, professional, graduate, and professorial career. Throughout this time, Jones created tools and techniques for software analysis (static and dynamic), techniques to help manage test suites for safety-critical software systems, techniques to support several aspects of software debugging and comprehension, and has studied the ways that software behaves in order to better model and predict it. Jones received the Ph.D. in Computer Science at Georgia Tech, advised by Professor Mary Jean Harrold. At UC Irvine, Jones leads the Spider Lab (http://spideruci.org) and advises Ph.D., Masters, and undergraduate students to study and improve software development and maintenance processes. Jones is a regular author and reviewer for top-tier research conferences (e.g., ICSE, FSE, ISSTA, ASE) and has co-organized events such as the 1st Working Conference on Software Visualization (VISSOFT) and the 10th Workshop on Dynamic Analysis (WODA). Contact Information University of California, Irvine Bren School of Information and Computer Sciences Department of Informatics Institute for Software Research Spider Lab Research Group (http://spideruci.org) 5214 Bren Hall, Irvine, CA 92697-3440 +1 (949) 824-0942 +1 (949) 824-4056 [email protected] http://jamesajones.com http://spideruci.org Jones, James A.
    [Show full text]
  • Arxiv:2106.11534V1 [Cs.DL] 22 Jun 2021 2 Nanjing University of Science and Technology, Nanjing, China 3 University of Southampton, Southampton, U.K
    Noname manuscript No. (will be inserted by the editor) Turing Award elites revisited: patterns of productivity, collaboration, authorship and impact Yinyu Jin1 · Sha Yuan1∗ · Zhou Shao2, 4 · Wendy Hall3 · Jie Tang4 Received: date / Accepted: date Abstract The Turing Award is recognized as the most influential and presti- gious award in the field of computer science(CS). With the rise of the science of science (SciSci), a large amount of bibliographic data has been analyzed in an attempt to understand the hidden mechanism of scientific evolution. These include the analysis of the Nobel Prize, including physics, chemistry, medicine, etc. In this article, we extract and analyze the data of 72 Turing Award lau- reates from the complete bibliographic data, fill the gap in the lack of Turing Award analysis, and discover the development characteristics of computer sci- ence as an independent discipline. First, we show most Turing Award laureates have long-term and high-quality educational backgrounds, and more than 61% of them have a degree in mathematics, which indicates that mathematics has played a significant role in the development of computer science. Secondly, the data shows that not all scholars have high productivity and high h-index; that is, the number of publications and h-index is not the leading indicator for evaluating the Turing Award. Third, the average age of awardees has increased from 40 to around 70 in recent years. This may be because new breakthroughs take longer, and some new technologies need time to prove their influence. Besides, we have also found that in the past ten years, international collabo- ration has experienced explosive growth, showing a new paradigm in the form of collaboration.
    [Show full text]
  • Alan Mathison Turing and the Turing Award Winners
    Alan Turing and the Turing Award Winners A Short Journey Through the History of Computer TítuloScience do capítulo Luis Lamb, 22 June 2012 Slides by Luis C. Lamb Alan Mathison Turing A.M. Turing, 1951 Turing by Stephen Kettle, 2007 by Slides by Luis C. Lamb Assumptions • I assume knowlege of Computing as a Science. • I shall not talk about computing before Turing: Leibniz, Babbage, Boole, Gödel... • I shall not detail theorems or algorithms. • I shall apologize for omissions at the end of this presentation. • Comprehensive information about Turing can be found at http://www.mathcomp.leeds.ac.uk/turing2012/ • The full version of this talk is available upon request. Slides by Luis C. Lamb Alan Mathison Turing § Born 23 June 1912: 2 Warrington Crescent, Maida Vale, London W9 Google maps Slides by Luis C. Lamb Alan Mathison Turing: short biography • 1922: Attends Hazlehurst Preparatory School • ’26: Sherborne School Dorset • ’31: King’s College Cambridge, Maths (graduates in ‘34). • ’35: Elected to Fellowship of King’s College Cambridge • ’36: Publishes “On Computable Numbers, with an Application to the Entscheindungsproblem”, Journal of the London Math. Soc. • ’38: PhD Princeton (viva on 21 June) : “Systems of Logic Based on Ordinals”, supervised by Alonzo Church. • Letter to Philipp Hall: “I hope Hitler will not have invaded England before I come back.” • ’39 Joins Bletchley Park: designs the “Bombe”. • ’40: First Bombes are fully operational • ’41: Breaks the German Naval Enigma. • ’42-44: Several contibutions to war effort on codebreaking; secure speech devices; computing. • ’45: Automatic Computing Engine (ACE) Computer. Slides by Luis C.
    [Show full text]
  • First Woman to Receive ACM Turing Award Contact: Virginia Gold 212-626-0505 [email protected]
    First Woman to Receive ACM Turing Award Contact: Virginia Gold 212-626-0505 [email protected] Cameron Wilson 202-659-9712 [email protected] IBM Fellow Emerita Frances Allen Responsible for Innovations to High Speed Computing; Work Inspired Generations of Computer Scientists New York, NY, February 21, 2007 – ACM, the Association for Computing Machinery, has named Frances E. Allen the recipient of the 2006 A.M. Turing Award for contributions that fundamentally improved the performance of computer programs in solving problems, and accelerated the use of high performance computing. This award marks the first time that a woman has received this honor. The Turing Award, first presented in 1966, and named for British mathematician Alan M. Turing, is widely considered the "Nobel Prize in Computing." It carries a $100,000 prize, with financial support provided by Intel Corporation. Allen, an IBM Fellow Emerita at the T.J. Watson Research Center, made fundamental contributions to the theory and practice of program optimization, which translates the users' problem-solving language statements into more efficient sequences of computer instructions. Her contributions also greatly extended earlier work in automatic program parallelization, which enables programs to use multiple processors simultaneously in order to obtain faster results. These techniques have made it possible to achieve high performance from computers while programming them in languages suitable to applications. They have contributed to advances in the use of high performance computers for solving problems such as weather forecasting, DNA matching, and national security functions. "Fran Allen's work has led to remarkable advances in compiler design and machine architecture that are at the foundation of modern high-performance computing," said Ruzena Bajcsy, Chair of ACM's Turing Award Committee, and professor of Electrical and Engineering and Computer Science at the University of California, Berkeley.
    [Show full text]
  • Automated Test Cases Prioritization for Self-Driving Cars in Virtual
    111 Automated Test Cases Prioritization for Self-driving Cars in Virtual Environments CHRISTIAN BIRCHLER, Zurich University of Applied Science, Switzerland SAJAD KHATIRI, Zurich University of Applied Science & Software Institute - USI, Lugano, Switzerland POURIA DERAKHSHANFAR, Delft University of Technology, Netherlands SEBASTIANO PANICHELLA, Zurich University of Applied Science, Switzerland ANNIBALE PANICHELLA, Delft University of Technology, Netherlands Testing with simulation environments help to identify critical failing scenarios emerging autonomous systems such as self-driving cars (SDCs) and are safer than in-field operational tests. However, these tests are very expensive and aretoo many to be run frequently within limited time constraints. In this paper, we investigate test case prioritization techniques to increase the ability to detect SDC regression faults with virtual tests earlier. Our approach, called SDC-Prioritizer, prioritizes virtual tests for SDCs according to static features of the roads used within the driving scenarios. These features are collected without running the tests and do not require past execution results. SDC-Prioritizer utilizes meta-heuristics to prioritize the test cases using diversity metrics (black-box heuristics) computed on these static features. Our empirical study conducted in the SDC domain shows that SDC-Prioritizer doubles the number of safety-critical failures that virtual tests can detect at the same level of execution time compared to baselines: random and greedy-based test case orderings. Furthermore, this meta-heuristic search performs statistically better than both baselines in terms of detecting safety-critical failures. SDC-Prioritizer effectively prioritize test cases for SDCs with a large improvement in fault detection while its overhead(upto 0.34% of the test execution cost) is negligible.
    [Show full text]
  • Mary Lou Soffa: Curriculum Vitae
    Mary Lou Soffa Department of Computer Science 421 Rice Hall Phone: (434) 982-2277 85 Engineer’s Way Fax: (434) 982-2214 P.O. Box 400740 Email: [email protected] University of Virginia Homepage: http://www.cs.virginia.edu/ Charlottesville, VA 22904 Research Interests Optimizing compilers, software engineering, program analysis, instruction level parallelism, program debugging and testing tools, software systems for the multi-core processors, testing cloud applications, testing for machine learning applications Education Ph.D. in Computer Science, University of Pittsburgh, 1977 M.S. in Mathematics, Ohio State University B.S. in Mathematics, University of Pittsburgh, Magna Cum Laude, Phi Beta Kappa Academic Employment Owen R.Cheatham Professor of Sciences, Department of Computer Science, University of Virginia, 2004-present Chair, Department of Computer Science, University of Virginia, 2004-2012 Professor, Department of Computer Science, University of Pittsburgh, 1990-2004 Graduate Dean in Arts and Sciences, University of Pittsburgh, 1991-1996 Visiting Associate Professor, Department of Electrical Engineering and Computer Science, University of California at Berkeley, 1987 Associate Professor, Department of Computer Science, University of Pittsburgh, 1983-1990 Assistant Professor, Department of Computer Science, University of Pittsburgh, 1977-1983 Honors/Awards SEAS Distinguished Faculty Award, 2020 NCWIT Harrold - Notkin Research and Mentoring Award, 2020 University of Virginia Research Award, 2020 Distinguished Paper, A Statistics-Based
    [Show full text]
  • Dissertation Towards Model-Based Regression
    DISSERTATION TOWARDS MODEL-BASED REGRESSION TEST SELECTION Submitted by Mohammed Al-Refai Department of Computer Science In partial fulfillment of the requirements For the Degree of Doctor of Philosophy Colorado State University Fort Collins, Colorado Summer 2019 Doctoral Committee: Advisor: Sudipto Ghosh Co-Advisor: Walter Cazzola James M. Bieman Indrakshi Ray Leo Vijayasarathy Copyright by Mohammed Al-Refai 2019 All Rights Reserved ABSTRACT TOWARDS MODEL-BASED REGRESSION TEST SELECTION Modern software development processes often use UML models to plan and manage the evolu- tion of software systems. Regression testing is important to ensure that the evolution or adaptation did not break existing functionality. Regression testing can be expensive and is performed with limited resources and under time constraints. Regression test selection (RTS) approaches are used to reduce the cost. RTS is performed by analyzing the changes made to a system at the code or model level. Existing model-based RTS approaches that use UML models have some limitations. They do not take into account the impact of changes to the inheritance hierarchy of the classes on test case selection. They use behavioral models to perform impact analysis and obtain traceability links between model elements and test cases. However, in practice, structural models such as class diagrams are most commonly used for designing and maintaining applications. Behavioral models are rarely used and even when they are used, they tend to be incomplete and lack fine-grained details needed to obtain the traceability links, which limits the applicability of the existing UML- based RTS approaches. The goal of this dissertation is to address these limitations and improve the applicability of model-based RTS in practice.
    [Show full text]