B. Bruegge, "Adaptability and Portability of Symbolic Debuggers", Ph.D. Thesis, Department of Computer Science, Carnegie Mellon University, CMU-CS-85-174, September 1985.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....safe PAs, will be defined and 1 proven equivalent to k safe Petri nets. The second system for modelling safe concurrency is a language based system, called Data Path Expressions (DPEs) which is an extension of Bruegge and Hibbard s generalized path expressions for debugging sequential programs [Bruegge 85, Bruegge 83] This work is in turn an application to debugging of Campbell and Habermann s classical work on path expressions for describing process behavior in operating systems [Campbell 74] We have classified DPEs into five subclasses according to syntactic criteria, and characterized the ....

.... close (fork;child) display Limitations no concurrency no process no unbounded no joining for open question splitting parallelism unbounded following parallelism program branching Related Generalized path COSY [Lauer 81] EBBA [Bates 83] Concurrent regular Work expressions expressions [Bruegge 85] Garg 88] Table 3 2: DPE Hierarchy The first subclass is well known as regular expressions or path expressions. The path expression 15 open ; write read) close states that a file has to be opened, before an arbitrary sequence of reads and writes is performed, and then closed. The ....

Bernd Bruegge. Adaptability and Portability of Symbolic Debuggers. PhD thesis, Carnegie Mellon University, 1985. CMU-CS-85-174.

....a client interface so that it can be used by other programs, e.g. user interfaces. If gdb and dbx defined client interfaces, it would simplify the implementation of better user interfaces (e.g. dbxtool [1] and of higher level debugging tools (e.g. Dalek [19] Event action debugging techniques [3, 5, 19] seem well suited for implementation above ldb. ldb can debug on multiple architectures simultaneously, so it can process events from pieces of client server applications that execute on different hardware. ldb s abstract memory model is low level, close to the hardware. By contrast, the Cedar ....

B. Bruegge. Adaptability and Portability of Symbolic Debuggers. PhD thesis, Carnegie Mellon University, September 1985.

....object at run time requires extensive reverse engineering, which is difficult. As a result, source level debuggers are typically characterized by limited functionality, poor portability, and considerable inter ################## Supported in part by NSF Grant CCR 8806121. nal complexity [Bruegge85]. These problems are greatly exacerbated by the presence of compiler optimization, which often makes the task of mapping the machine code back to the original source essentially impossible [Hennessy82,Zellwegger84] Standard ML of New Jersey (SML NJ) Appel87a] is a very highly optimizing compiler ....

. B. Bruegge, "Adaptability and portability of symbolic debuggers," (Thesis) CMU-CS-85-174, Carnegie-Mellon University Dept. of Computer Science, Sept 1985.

....a visibility list (section 4.2) and by search modes (section 4.3) Language features that can be dealt with by dynamic abstractions include separate compilation (section 4.4) and overloading (section 4. 5) Finally the problem of debugging tasks and exceptions is discussed and the use of PATHRULES [Bruegge, 1985] for these language constructs (section 5 and 6) is proposed. The paper discusses the issues of extending a Pascal debugger to an Ada debugger on the design level. We are currently modifying the KRAUT debugger to debug Ada programs according to the proposals of this paper. Section 7 describes the ....

....notion of visibility when debugging. Instead of static scope rules they often apply dynamic scope rules. Users often refer to locals of routines that are currently not visible with respect to the scope rules of the programming language. This hypothesis is supported by experiments described in [Bruegge, 1985]: Violation of scope rules are used if they are provided by the debugger. There is another aspect where the violation of the visibility rules at debug time is important, namely abstract data types. This has not been so problematic in languages like Pascal, which do not support abstract data types ....

[Article contains additional citation context not shown here]

B. Bruegge, "Adaptability and Portability of Symbolic Debuggers", Ph.D. Thesis, Department of Computer Science, Carnegie Mellon University, CMU-CS-85-174, September 1985.

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