Learning Tests Traces

Total Page:16

File Type:pdf, Size:1020Kb

Learning Tests Traces Learning Tests Traces Eyal Hadad Roni Stern Software and Information Systems Engineering Software and Information Systems Engineering Ben Gurion University of the Negev Ben Gurion University of the Negev Be’er Sheva, Israel Be’er Sheva, Israel [email protected] [email protected] Abstract—Modern software projects include automated tests coverage is a standard objective in popular test generation written to check the programs’ functionality. The set of functions frameworks, such as EvoSuite [2]. In bug isolation, traces are invoked by a test is called the trace of the test, and the action used by software diagnosis algorithms such as Barinel [3] to of obtaining a trace is called tracing. There are many tracing tools since traces are useful for a variety of software engineering localize the root cause of observed bugs. Traces are also used tasks such as test generation, fault localization, and test execution to prioritize which tests to execute [4], [5]. planning. A major drawback in using test traces is that obtaining A main drawback in using traces for all of the above tasks them, i.e., tracing, can be costly in terms of computational is that collecting traces is costly in terms of computational resources and runtime. Prior work attempted to address this in resources and runtime. This is because in order to obtain the various ways, e.g., by selectively tracing only some of the software components or compressing the trace on-the-fly. However, all trace of a test, one must build the project and execute the these approaches still require building the project and executing test while applying techniques such as byte-code manipulation the test in order to get its (partial, possibly compressed) trace. to record its trace. All these activities can be very costly in This is still very costly in many cases. In this work, we propose real-sized projects, and the size of the resulting trace can be a method to predict the trace of each test without executing prohibitively large. Prior worked partially addressed this by it, based only on static properties of the test and the tested program, as well as past experience on different tests. This compressing the trace while it is collected [6], [7] and by prediction is done by applying supervised learning to learn the choosing selectively which software components to include in relation between various static features of test and function a trace [8]–[11]. These approaches are very useful, but still and the likelihood that one will include the other in its trace. require executing the test. Then, we show how to use the predicted traces in a recent In this work, we propose to learn to predict the trace automated troubleshooting paradigm called Learn, Diagnose, and Plan (LDP), instead of the actual, costly-to-obtain, test traces. In of a test without executing it. This prediction relies only a preliminary evaluation on real-world open-source projects, we on static properties of the test and the tested program, as observe that our prediction quality is reasonable. In addition, well as previously collected traces of other tests. The first using our trace predictions in LDP yields almost the same contribution of our work is to define the trace prediction results comparing to when using real traces, while requiring less problem and model it as Binary classification problem. Then, overhead. supervised learning Index Terms—Automated debugging, Machine learning, Soft- we propose to use a algorithm over ware diagnosis, Automated testing traces of previously executed tests to solve this classification problem, and suggest easy-to-extract features to do so. This is the second contribution of this work. I. INTRODUCTION One of the benefits of having a trace prediction algorithm is The number of software projects and their size increase that it can be used instead of real traces in software engineering every day, while their time-to-market decreases. As a result, tasks. We show this for the task of software troubleshooting. arXiv:1909.01679v2 [cs.SE] 9 Sep 2019 the number of bugs in software projects increase. Bugs damage In particular, we propose to integrate our test prediction the performance of software products and directly affect their algorithm in a recently proposed automated troubleshooting customers. Therefore, software companies heavily invest in paradigm called LDP [5]. LDP aims to identify the root cause software quality and quality-related costs can consume as of an observed bug, and does so by using a combination much as 60% of the development budget [1]. of techniques from the Artificial Intelligence (AI) literature. To maintain software quality, modern software projects It uses a software diagnosis algorithm to output candidate include automated tests written to check the programs’ func- diagnoses. If this set is too large, LDP uses a test planning tionality. The set of functions invoked by a test is called (TP) algorithm to choose which tests to perform next in order the trace of the test. Many tools and research papers use to collect more information for the diagnosis algorithm. Prior test traces to perform a range of software engineering tasks, work on the TP component of LDP assumed that the test including test generation, bug isolation, and managing test planner knows the traces of the test it is planning to execute. execution. In test generation tools, traces are collected and We propose a simple TP algorithm that can use the predicted used to compute coverage, which is the union of the sets traces instead of the actual, costly-to-obtain, test traces. This of functions in the traces of the generated tests. Maximizing is the third contribution of this work. Finally, we perform a small-scale evaluation of our trace classification task is the task of mapping a label to a given prediction algorithm and our TP algorithm in LDP on real- instance, where the set of possible labels is discrete and finite. world open-source projects. Results show that while prediction A binary classification task is a classification task in which quality can be improved, it is sufficiently accurate to be used there are only two possible labels. by our TP algorithm to guide LDP to troubleshoot bugs almost To solve a classification task using supervised learning, well as when using real traces. one needs to accept as input a set of instance-label pairs, i.e., a set of instances and their label. This is called a II. BACKGROUND AND PROBLEM DEFINITION training set. Supervised learning algorithms work, in general, An automated test is a method that executes a program in or- as follows: they extract features from every instance in the der to check if it is working properly. The outcome of running training set, and then run an optimization algorithm to search a test is either that the test has passed or failed, where a failed for parameters of a chosen mathematical model that maps 1 test indicates that the program is not behaving properly. The values of these features to the correct label. trace of a test is the set of software components, e.g., classes The output of a supervised learning algorithm is this math- or methods, that were activated during the execution of a test. ematical model along with optimized values for its parameter. We denote by outcome(t) and trace(t) the outcome and trace, In the context of classification, this is called a classifier.A respectively, of a test t. classifier can be used to output a label for a previously unseen Modern software programs include a large set of automated instance, by extracting the features of this instance, inserting tests. For a given program of interest, we denote its set of their values to the learned mathematical model, and outputting automated tests by T, and its set of software components by the resulting label. COMPS. Note that for every test t 2 T it holds that trace(t) ⊆ COMPS. There are several techniques for obtaining the trace of test B. Trace Prediction as a Binary Classification Problem after executing it. A common way to obtain the trace of a test t is to modify the program’s source code so that it Trace prediction can be viewed as a binary classification records every function invocation, and then run t. For example, task. An instance in trace prediction is a pair (t; c) where t is a in Java programs such code modification can be done in test and c is a software component. The label is true if and only runtime using byte-code manipulation frameworks such as if c is in the trace of t, i.e., iff c 2 trace(t). The corresponding ASM (http://asm.objectweb.org), BCEL (http://jakarta.apache. binary classifier is a classifier that accepts a pair (t; c) where org/bcel), and SERP (http://serp.sourceforge.net). Another way t 2 T and c 2 COMPS, and outputs true if c 2 trace(t) to obtain the trace of a test is to execute it with a debugging and false otherwise. We refer to such a classifier as a trace tool, and, again, record every function invocation. These classifier. A trace classifier can be used to solve the trace tracing techniques have been used in practice in various tracing prediction problem: for a given test t, run over all software tools, such as iDNA [12] and Clover (https://www.atlassian. components c 2 COMPS, and return only the components com/software/clover). For a survey of tracing tools, see [13]. labeled as true by the classifier. All these tools require running the test in order to obtain To solve this binary classification problem with supervised its trace.
Recommended publications
  • Development and Certification of Mixed-Criticality Embedded
    Development and Certification of Mixed-criticality Embedded Systems based on Probabilistic Timing Analysis Irune Agirre Troncoso Computer Architecture Department Universitat Polit`ecnicade Catalunya A thesis submitted for the degree of PhD in Computer Architecture May 2018 Development and Certification of Mixed-criticality Embedded Systems based on Probabilistic Timing Analysis Irune Agirre Troncoso May 2018 Universitat Polit`ecnicade Catalunya Computer Architecture Department Thesis submitted for the degree of Doctor of Philosophy in Computer Architecture Advisor: Francisco J. Cazorla, Barcelona Supercomputing Center and IIIA-CSIC Co-advisor: Mikel Azkarate-askatsua, IK4-Ikerlan Technology Research Center The work reported in this Thesis has been conducted in collaboration between the Univer- sitat Polit`ecnicade Catalunya, the Dependable Embedded Systems department of IK4-Ikerlan Technology Research Center and the Computer Architecture and Operating Systems (CAOS) group of the Barcelona Supercomputing Center (BSC). i ii Abstract An increasing variety of emerging systems relentlessly replace or aug- ment the functionality of mechanical subsystems with embedded elec- tronics. For quantity, complexity, and use, the safety of such subsys- tems, often subject to regulation, is an increasingly important matter. Those systems are subject to safety certification to demonstrate sys- tem's safety by rigorous development processes and hardware/software constraints. The massive augment in embedded processors' complexity renders the arduous certification task significantly harder to achieve. The focus of this thesis is to address the certification challenges in multicore architectures: despite their potential to integrate several ap- plications on a single platform, their inherent complexity imperils their timing predictability and certification. For the former, Measurement- Based Probabilistic Timing Analysis (MBPTA) has recently emerged as an alternative to deal with hardware/software complexity.
    [Show full text]
  • Improving Software Fault Prediction Using a Data-Driven Approach
    Improving Software Fault Prediction Using a Data-Driven Approach André Sobral Gonçalves Thesis to obtain the Master of Science Degree in Information Systems and Computer Engineering Supervisor: Prof. Rui Filipe Lima Maranhão de Abreu Examination Committee: Chairperson: Prof. Daniel Jorge Viegas Gonçalves Supervisor: Prof. Rui Filipe Lima Maranhão de Abreu Members of the Committee: Prof. João Fernando Peixoto Ferreira September 2019 ii Acknowledgements Firstly, I want to thank my supervisor, Professor Rui Maranhão for his insight, guidance, patience and for having given me the opportunity to do research in such an interesting field. I am grateful to my family for their immense support, patience and love throughout the entire course. In particular, to my parents, João Carlos and Ana Maria Gonçalves, my brother, João Pedro Gonçalves, my parents-in-law, Carlos and Maria José Alves and my beautiful niece Olivia. I want to thank Carolina Alves, for all her love, care, kindness, determination and willingness to review countless times everything I needed. To my friends and colleagues, José Ferreira, Gustavo Enok, Fábio Almeida, Duarte Meneses, Delfim Costa for supporting me all this time. iii Abstract In software development, debugging is one of the most expensive tasks in the life cycle of a project. Repetitive, manual identification of faults in software, which are the source of errors and inefficiencies, is inherently time-consuming and error-prone. The solution to this problem is automated software diagnosis. This approach solves the issues mentioned previously as long as the accuracy of the diagnosis is credible. There are different tools and techniques which ensure this diagnosis, but they neglect valuable data.
    [Show full text]
  • Fault Diagnosis for Functional Safety in Electrified and Automated Vehicles
    Fault Diagnosis for Functional Safety in Electrified and Automated Vehicles Dissertation Presented in Partial Fulfillment of the Requirements for the Degree Doctor of Philosophy in the Graduate School of The Ohio State University By Tianpei Li, Graduate Program in Mechanical Engineering The Ohio State University 2020 Dissertation Committee: Prof. Giorgio Rizzoni, Advisor Prof. Manoj Srinivasan Prof. Ran Dai Prof. Qadeer Ahmed c Copyright by Tianpei Li 2020 Abstract Vehicle safety is one of the critical elements of modern automobile development. With increasing automation and complexity in safety-related electrical/electronic (E/E) systems, and given the functional safety standards adopted by the automo- tive industry, the evolution and introduction of electrified and automated vehicles had dramatically increased the need to guarantee unprecedented levels of safety and security in the automotive industry. The automotive industry has broadly and voluntarily adopted the functional safety standard ISO 26262 to address functional safety problems in the vehicle development process. A V-cycle software development process is a core element of this standard to ensure functional safety. This dissertation develops a model-based diagnostic method- ology that is inspired by the ISO-26262 V-cycle to meet automotive functional safety requirements. Specifically, in the first phase, system requirements for diagnosis are determined by Hazard Analysis and Risk Assessment (HARA) and Failure Modes and Effect Analysis (FMEA). Following the development of system requirements, the second phase of the process is dedicated to modeling the physical subsystem and its fault modes. The implementation of these models using advanced simulation tools (MATLAB/Simulink and CarSim in this dissertation) permits quantification of the fault effects on system safety and performance.
    [Show full text]
  • Ada User Journal 66 Editorial 67 Quarterly News Digest 69 Conference Calendar 97 Forthcoming Events 103 Articles from the Industrial Track of Ada-Europe 2011 R
    ADA Volume 32 USER Number 2 June 2011 JOURNAL Contents Page Editorial Policy for Ada User Journal 66 Editorial 67 Quarterly News Digest 69 Conference Calendar 97 Forthcoming Events 103 Articles from the Industrial Track of Ada-Europe 2011 R. Bridges, F. Dordowsky, H. Tschöpe “Implementing a Software Product Line for a complex Avionics System in Ada 83” 107 Ada Gems 116 Ada-Europe Associate Members (National Ada Organizations) 128 Ada-Europe 2011 Sponsors Inside Back Cover Ada User Journal Volume 32, Number 2, June 2011 66 Editorial Policy for Ada User Journal Publication Original Papers Commentaries Ada User Journal — The Journal for Manuscripts should be submitted in We publish commentaries on Ada and the international Ada Community — is accordance with the submission software engineering topics. These published by Ada-Europe. It appears guidelines (below). may represent the views either of four times a year, on the last days of individuals or of organisations. Such March, June, September and All original technical contributions are articles can be of any length – December. Copy date is the last day of submitted to refereeing by at least two inclusion is at the discretion of the the month of publication. people. Names of referees will be kept Editor. confidential, but their comments will Opinions expressed within the Ada Aims be relayed to the authors at the discretion of the Editor. User Journal do not necessarily Ada User Journal aims to inform represent the views of the Editor, Ada- readers of developments in the Ada The first named author will receive a Europe or its directors.
    [Show full text]
  • Anglia Ruskin University a Type-Safe Apparatus
    ANGLIA RUSKIN UNIVERSITY A TYPE-SAFE APPARATUS EXECUTING HIGHER ORDER FUNCTIONS IN CONJUNCTION WITH HARDWARE ERROR TOLERANCE JONATHAN RICHARD ROBERT KIMMITT A thesis in partial fulfilment of the requirements of Anglia Ruskin University for the degree of Doctor of Philosophy This research programme was carried out in collaboration with The University of Cambridge Submitted: October 2015 Acknowledgements This dissertation was self-funded and prepared in part fulfilment of the requirements of the degree of Doctor of Philosophy under the supervision of Dr David Greaves of The University of Cambridge, and Dr George Wilson and Professor Marcian Cirstea at Anglia Ruskin University, without whose help this dissertation would not have been possible. I am grateful to Dr John O’Donnell of The University of Glasgow and Dr Anil Madhavapeddy of The University of Cambridge for their willingness to examine the degree. Dedication Dedicated to my wife Christine Kimmitt i ANGLIA RUSKIN UNIVERSITY ABSTRACT FACULTY OF SCIENCE AND TECHNOLOGY DOCTOR OF PHILOSOPHY A TYPE-SAFE APPARATUS EXECUTING HIGHER ORDER FUNCTIONS IN CONJUNCTION WITH HARDWARE ERROR TOLERANCE JONATHAN RICHARD ROBERT KIMMITT October 2015 The increasing commoditization of computers in modern society has exceeded the pace of associated developments in reliability. Although theoretical computer science has advanced greatly in the last thirty years, many of the best techniques have yet to find their way into embedded computers, and their failure can have a great potential for disrupting society.
    [Show full text]
  • AI for Software Quality Assurance Blue Sky Ideas Talk
    The Thirty-Fourth AAAI Conference on Artificial Intelligence (AAAI-20) AI for Software Quality Assurance Blue Sky Ideas Talk Meir Kalech, Roni Stern Ben-Gurion University of the Negev, Israel, {kalech, sternron}@bgu.ac.il Abstract Modern software systems are highly complex and often have multiple dependencies on external parts such as other pro- cesses or services. This poses new challenges and exacerbate existing challenges in different aspects of software Quality Assurance (QA) including testing, debugging and repair. The goal of this talk is to present a novel AI paradigm for software QA (AI4QA). A quality assessment AI agent uses machine- learning techniques to predict where coding errors are likely Figure 1: An illustration of the proposed AI4QA paradigm. to occur. Then a test generation AI agent considers the error predictions to direct automated test generation. Then a test execution AI agent executes tests, that are passed to the root- cause analysis AI agent, which applies automatic debugging A quality assessment AI agent (marked 1 in Figure 1) algorithms. The candidate root causes are passed to a code continuously monitors the software development process by repair AI agent that tries to create a patch for correcting the collecting information from existing software engineering isolated error. tools, learning over time to predict where coding errors are likely to occur. A test generation AI agent (2) considers the error predictions to direct automated and manual test genera- 1 Scientific Background tion. The test execution AI agent (3) executes tests and anal- Testing, debugging, and other software Quality Assurance yses their outputs, searching for failed tests and abnormal (QA) activities are performed by software development behaviour.
    [Show full text]
  • Call for Papers the 20Th International Conference on Intelligent Software Methodologies, Tools, and Techniques
    Call for papers The 20th International Conference on Intelligent Software Methodologies, Tools, and Techniques Organization General Chairs: Hamido Fujita, Iwate Prefectural University, Iwate, Japan e-mail: [email protected] Hector Perez-Meana, National Polytechnic Institute, Mexico City, Mexico e-mail: [email protected] Organizing Chairs: Mariko Nakano, National Polytechnic Institute, Mexico City, Mexico About SOMET 2021 e-mail: [email protected] The SOMET conference highlights and reflects the state-of-art and new trends on software methodologies, Andres Hernandez-Matamoros, The tools and techniques. You are invited to participate to help build a forum for exchanging ideas and experiences University of Tokyo, Japan to foster new directions in software development methodologies and related tools and techniques. This e-mail: [email protected] conference is focused on exploring innovations, controversies, and challenges facing the Software Engineering community today. The conference brings together theory and experience to propose and evaluate Program Chairs: solutions to Software Engineering problems. The conference also provides a forum and an opportunity to Gabriel Sanchez-Perez, National assess the current state-of-the-art in intelligent Software techniques and to chart software science initiated Polytechnic Institute, Mexico City, from experience to theory. This conference is an opportunity for us in the software science community to Mexico think about where we are and today and where we are going. e-mail: [email protected] Topics
    [Show full text]
  • Software Evolution
    Software Evolution Miryung Kim, Na Meng, and Tianyi Zhang Abstract Software evolution plays an ever-increasing role in software develop- ment. Programmers rarely build software from scratch but often spend more time in modifying existing software to provide new features to customers and fix defects in existing software. Evolving software systems are often a time-consuming and error-prone process. This chapter overviews key concepts and principles in the area of software evolution and presents the fundamentals of state-of-the art methods, tools, and techniques for evolving software. The chapter first classifies the types of software changes into four types: perfective changes to expand the existing require- ments of a system, corrective changes for resolving defects, adaptive changes to accommodate any modifications to the environments, and finally preventive changes to improve the maintainability of software. For each type of changes, the chapter overviews software evolution techniques from the perspective of three kinds of activities: (1) applying changes, (2) inspecting changes, and (3) validating changes. The chapter concludes with the discussion of open problems and research challenges for the future. 1 Introduction Software evolution plays an ever-increasing role in software development. Program- mers rarely build software from scratch but often spend more time in modifying existing software to provide new features to customers and fix defects in existing All authors have contributed equally to this chapter. M. Kim · T. Zhang University of California, Los Angeles, CA, USA e-mail: [email protected]; [email protected] N. Meng Virginia Tech, Blacksburg, VA, USA e-mail: [email protected] © Springer Nature Switzerland AG 2019 223 S.
    [Show full text]
  • Apply the Principles of Resolving Problems for Single- User and Multi-User Computer Operating Systems 114183
    Apply the principles of resolving problems for single- user and multi-user computer operating systems 114183 PURPOSE OF THE UNIT STANDARD This unit standard is intended: To provide proficient knowledge of the areas covered. For those working in, or entering the workplace in the area of Information Technology and Computer Sciences. People credited with this unit standard are able to: Describe software diagnostic tools for single-user and multi-user computer operating systems. Identify problems for single-user and multi-user computer operating systems and Resolve problems for single-user and multi-user computer operating systems. The performance of all elements is to a standard that allows for further learning in this area. LEARNING ASSUMED TO BE IN PLACE AND RECOGNITION OF PRIOR LEARNING The credit value of this unit is based on a person having prior knowledge and skills to : Use single-user and multi-user computer operating systems and user applications. Resolve technical computer problems. UNIT STANDARD RANGE The level assigned to this unit standard is appropriate because the individual needs to generate ideas through the analysis and the formulation of responses to well and abstract problems. Need to analyse and evaluate information; exercise significant judgement across a range of functions and accept responsibility for determining and achieving personal outcomes. Module 1 – Methodology to troubleshoot hard- and software problems Author: LEARNER MANUAL Rel Date: 27/01/2018 Rev Date: 01/06/2023 Doc Ref: 48573 LM Mod 1 v-1 PAGE 45 INDEX Competence Requirements Page Unit Standard 114183 alignment index Here you will find the different outcomes explained which you need to be proved 47 competent in, in order to complete the Unit Standard 114183.
    [Show full text]
  • Delft University of Technology an Empirical Evaluation of Feedback
    Delft University of Technology An Empirical Evaluation of Feedback-Driven Software Development Beller, Moritz DOI 10.4233/uuid:b2946104-2092-42bb-a1ee-3b085d110466 Publication date 2018 Document Version Final published version Citation (APA) Beller, M. (2018). An Empirical Evaluation of Feedback-Driven Software Development. https://doi.org/10.4233/uuid:b2946104-2092-42bb-a1ee-3b085d110466 Important note To cite this publication, please use the final published version (if applicable). Please check the document version above. Copyright Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons. Takedown policy Please contact us and provide details if you believe this document breaches copyrights. We will remove access to the work immediately and investigate your claim. This work is downloaded from Delft University of Technology. For technical reasons the number of authors shown on this cover page is limited to a maximum of 10. AN EMPIRICAL EVALUATION OF FEEDBACK-DRIVEN SOFTWARE DEVELOPMENT Moritz Beller An Empirical Evaluation of Feedback-Driven Software Development An Empirical Evaluation of Feedback-Driven Software Development Proefschrift ter verkrijging van de graad van doctor aan de Technische Universiteit Delft, op gezag van de Rector Magnificus prof. dr. ir. T.H.J.J. van der Hagen, voorzitter van het College voor Promoties, in het openbaar te verdedigen op vrijdag 23 november 2018 om 15.00 uur door Moritz Marc BELLER Master of Science in Computer Science, Technische Universität München, Duitsland, geboren te Schweinfurt, Duitsland.
    [Show full text]
  • Using Model-Based Diagnosis to Improve Software Testing
    Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence Using Model-Based Diagnosis to Improve Software Testing Tom Zamir and Roni Stern and Meir Kalech [email protected] [email protected] [email protected] Department of Information Systems Engineering Ben Gurion University of the Negev Be’er Sheva, Israel Abstract In this work we propose to enhance the software test- ing and debugging process described above by combining We propose a combination of AI techniques to improve soft- Model-Based Diagnosis (MBD) and planning techniques ware testing. When a test fails, a model-based diagnosis (MBD) algorithm is used to propose a set of possible expla- from the Artificial Intelligence (AI) literature. MBD algo- nations. We call these explanations diagnoses. Then, a plan- rithms have been proposed in the past for the purpose of ning algorithm is used to suggest further tests to identify the diagnosing software bugs (Gonzalez-Sanchez´ et al. 2011; correct diagnosis. A tester preforms these tests and reports Abreu, Zoeteweij, and van Gemund 2011; Wotawa and Nica their outcome back to the MBD algorithm, which uses this 2011; Stumptner and Wotawa 1996). Thus, when a tester information to prune incorrect diagnoses. This iterative pro- encounters a bug, any of these algorithms can be used to cess continues until the correct diagnosis is returned. We call generate a set of possible diagnoses automatically. this testing paradigm Test, Diagnose and Plan (TDP). Several To identify which of these diagnoses is correct, additional test planning algorithms are proposed to minimize the num- tests need to be performed.
    [Show full text]
  • Model–Based Debugging Using Multiple Abstract Models 57
    AADEBUG2003 55 Model–Based Debugging using Multiple Abstract Models Wolfgang Mayer∗, Markus Stumptner∗ 1 ∗ University of South Australia Advanced Computing Research Centre Mawson Lakes, Adelaide SA 5095, Australia ABSTRACT This paper introduces an automatic debugging framework that relies on model–based reasoning techniques to locate faults in programs. In particular, model–based diagnosis, together with an abstract interpretation based conflict detection mechanism is used to derive diagnoses, which correspond to possible faults in pro- grams. Design information and partial specifications are applied to guide a model revision process, which allows for automatic detection and correction of structural faults. KEYWORDS: Model–based Debugging, Diagnosis, Abstract Interpretation, Program Analysis 1 Introduction Detecting a faulty behavior within a program, locating the cause of the fault, and fixing the fault by means of changing the program, continues to be a crucial and challenging task in software de- velopment. Many papers have been published so far in the domain of detecting faults in software, e.g., testing or formal verification [CDH+00], and locating them, e.g., program slicing [Wei84] and automatic program debugging [Llo87]. More recently model–based diagnosis [Rei87] has been used arXiv:cs/0309030v1 [cs.SE] 17 Sep 2003 for locating faults in software [CFD93, MSWW02a]. This paper extends previous research in several directions: Firstly, a parameterized debugging framework is introduced, which integrates dynamic and static properties, as well as design infor- mation of programs. The framework is based on results derived in the field of abstract interpreta- tion [CC77], and can therefore be parameterized with different lattices and context selection strate- gies.
    [Show full text]