M. Ducass e. A pragmatic survey of automated debugging. In Proceedings of the 1st Workshop on Automated and Algorithmic Debugging, volume 749 of Lecture Notes in Computer Science. Springer-Verlag, 1993.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....1987] Theo [Mitchell et al. 1989] Prodigy [Veloso et al. 1995] MetaAqua and Meta TS [Cox, 1996] PLUTO [Shippey et al. 1998, Murdock et al. 1997] etc. Additionally, we will want to compare the approach as a whole with approaches from a variety of related fields such as Automated Debugging [Ducass e, 1993] and Software Architectures [Clements, 1996] It is expected that the research proposed here will provide insights which complement many of those from this related research. 6.4 Applicability All theories and tools have a limited scope; they are applicable to some kinds of issues and problems, ....

Ducass'e, M. (1993). A pragmatic survey of automated debugging. In Proceedings of the First International Workshop on Automated and Algorithmic Debugging Linkoping, Sweeden.

....programming systems mature further and larger applications are built, an increased need arises for advanced development and debugging environments. Such environments will likely comprise a variety of co existing tools ranging from declarative debuggers to execution visualizers (see, for example, [1,22,21] for a more comprehensive discussion of tools and possible debugging scenarios) In this paper we concentrate our attention on the particular issue of program validation and debugging via direct static and or dynamic checking of user provided assertions [18,19,8,6,36,2] Classical examples of ....

....as many calls to system predicates with incorrect types, modes, or even more complex properties are indeed detected at compile time. An important remark is that it is usually the case that different parts of the program are perceived by the user as having different levels of reliability [21]. For example, in order to detect a bug it is usually good practice to assume that library predicates are correct. For a tool to be successful, we believe that such different levels of reliability should somehow be reflected during the validation debugging session so that the programmer s ....

M. Ducass'e. A pragmatic survey of automated debugging. In Peter A. Fritzson, editor, Automated and Algorithmic Debugging, volume 749 of Lecture Notes in Computer Science, pages 1--15. Springer Verlag, May 1993.

....z = x.next; Warning: unsafe dereference x.next; Figure 13: Error reported after a conditional. Equal(x, y.next) if (x= y.next) then f x.key = 1; free(y) g else f x.key = y.key; free(x)g] z = x.next; Correct program Figure 14: Localisation of the error. 6 Related work In [4], Ducass e proposes a classification of debugging tools. Our work can be classified in her framework as a verification with respect to specifications strategy. In our setting, specifications gather the axiomatisation of pointer analysis and the dynamic assertions added by the programmer. In this ....

M. Ducass'e, A pragmatic survey of automated debugging. P. Fritzson, editor, Proceedings of the first International Workshop on Automated and Algorithmic Debugging. May 1993. LNCS 749, Springer-Verlag.

....these errors by showing a cycle. However, a Lustre program may be cycle free and still contain real bugs, be they programming or design bugs. That is why we need L u D i C. We can also compare the validation methods and tools of synchronous programming environments to the classification of [Duc93]. M. Ducass e first identifies two categories for classifying debugging tools: tutorial tools, and diagnosis ones. Since we are interested in real life examples, written by experienced programmers, our approach in L u D i C clearly belongs to the diagnosis category. For Lustre, the strategy ....

....because: first, programs have a parallel structure, and not all parts do influence a given erroneous output; second, the dataflow style induces slicing as a basic reasoning mechanism, because the dependency relation between variables is the only relevant piece of information for the programmer. [Duc93] also mention mutation as a technique relevant for the filtering strategy. Program mutation analysis for Lustre has been studied in [TFCM94] for evaluating the quality of a test case suite. It is probably a good idea to investigate this technique in L u D i C, although the aim may not be to ....

M. Ducass'e. A pragmatic survey of automated debugging. In P. Fritzson, editor, first International Workshop on Automated and Algorithmic Debugging, Linkoping, Sweden, May 1993. Lecture Notes in Computer Science 749, Springer-Verlag.

....paradigms and much more interesting debuggers. In particular, a significant amount of work has been done in debuggers for imperative languages, logic programming languages [Duc94] and parallel programming languages. Especially interesting debugging tools include automated and algorithmic debuggers [Sha83, Duc93], and most closely related to this paper, algorithmic debuggers for functional programming languages [NF94] This research area does seem to have some promising applications. High level languages such as Haskell, SML and Prolog each have a formal definition at its foundations so it seems ....

Mireille Ducass'e. A pragmatic survey of automated debugging. In 1st International Workshop on Automated and Algorithmic Debugging, pages 1--15. Department of Computer and Information Science, Linkoping University, May 1993.

....debugging and dynamic debugging. Dynamic assertions can be used to check if some properties hold or if some pieces of code are accessed at run time. We believe that this intimate integration of static analysis and dynamic analysis is a significant advantage of our framework. 6 Related work In [4], Ducass e proposes a classification of debugging tools. Our work can be classified in her framework as a verification with respect to specifications strategy. In our setting, specifications gather the axiomatisation of pointer analysis and the dynamic assertions added by the programmer. In this ....

M. Ducass'e, A pragmatic survey of automated debugging. P. Fritzson, editor, Proceedings of the first International Workshop on Automated and Algorithmic Debugging. May 1993. LNCS 749, SpringerVerlag.

....have to understand rapidly changing situations, examining large amounts of data. In the current state of the art taking the place of programmer s understanding is beyond the capabilities of computers. Nevertheless, computers can significantly help programmers to select the data to be analysed [9]. The data used by program analysis is often restricted to the source code of the analysed programs. However, there is a complementary source of information, namely traces of program executions. An execution trace contains less general information than the program source code, but it tells how ....

....hoc commands. In the first case the functionality and the number of strategies are reduced a priori; in the second case the tool is not usable. Moreover, trying to hard code all possibly needed commands is a non ending process. In our view, not all debugging strategies have been identified so far [9]. Furthermore, for each possible command there are many alternatives. For example, if we consider the simple next trace line command, it can be understood in many different ways, according to the context and users taste: ffl show the next line in the chronology, ffl show the next line which ....

M. Ducass'e. -- A pragmatic survey of automated debugging. -- In P. Fritzson, editor, Proceedings of the First Workshop on Automated and Algorithmic Debugging, volume 749 of Lecture Notes in Computer Sciences, Linkoeping, Sweden, May 1993. SpringerVerlag. -- AADEBUG'93.

....of STk : 12 8 Further Investigations and Questions 12 9 Conclusions 13 A The user evaluations of IIC 14 1 Introduction 1. 1 Goals and Motivations While simple debuggers ( Ber93] HO85] NF93] Dyb87] Cho89] [Duc93], GH92] Kam90] nML92] Nai92] NF92] OCH91] Sha83] Sny90] Tol92] WN88] execution profilers ( San94] Kis92] and trace facilities like those available in Chez Scheme ( Dyb87] FF89] allow you to view events in a functions execution and to traverse the execution stack are ....

Mireille Ducass'e. A pragmatic survey of automated debugging. In 1st International Workshop on Automated and Algorithmic Debugging, pages 1--15. Department of Computer and Information Science, Linkoping University, May 1993.

....of the above methods is in progress; it will allow us to confirm some of the advantages of testing over formal verification. Each of the testing techniques which have been described in the preceding paragraphs share a few characteristics with some automated debugging strategies as classified in [Duc93]. In the latter article, concrete evaluation of assertions and consistency checking with respect to assertions are among the most practical and promising verification oriented techniques. This ensues from the trend to rely on user defined assertions which are more declarative and less sensitive ....

M. Ducassé. A pragmatic survey of automated debugging. In Automated and Algorithmic Debugging. First International Workshop, Linkoping, Sweden, May 1993. Springer Verlag.

....behaviour of the logic programming system, he needs only a declarative knowledge of the expected properties of the program. Unlike Shapiro, we do not consider infinite loops, which need operational notions. A survey on debugging methods in Logic Programming from a procedural view point is in [15, 16]. For a declarative diagnoser system, the input must include at least (1) the actual program, 2) the symptom and (3) some information on the expected semantics of the program. This information on the expected semantics can be given by the programmer during the diagnosis session or it can be ....

M. Ducass'e. A Pragmatic Survey of Automated Debugging. In P. A. Fritzson, editor, Automated and Algorithmic Debugging, volume 749 of Lecture Notes in Computer Science, pages 1--15. Springer-Verlag, 1993.

No context found.

M. Ducass e. A pragmatic survey of automated debugging. In Proceedings of the 1st Workshop on Automated and Algorithmic Debugging, volume 749 of Lecture Notes in Computer Science. Springer-Verlag, 1993.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC