F. Tip. Generic techniques for source-level debugging and dynamic program slicing. In Proceedings of the Sixth International Joint Conference on the Theory and Practice of Software Development. LNCS 915, 1995. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Detecting Local Channels in Distributed Poly/ML - Steckler (1996) (1 citation) (Correct)
....in spirit to the usage analysis of Turner, et al. which tracks the number of uses of a term using an extended Hindley Milner type system [18] although our purposes are quite different. To aid in source level debugging of programs, Tip associates terms with earlier terms in a rewrite system [17]. This technique appears similar to our use of occurrence predecessors. 15 Conclusion We have given a constraint based static analysis for programs in a concurrent language that is provably sound. As far as we know, this is the first constraint based static analysis for a concurrent language. Our ....
Frank Tip. Generic techniques for source-level debugging and dynamic program slicing. In Peter D. Mosses, Mogens Nielsen, and Michael I. Schwartzbach, editors, Proc. TAPSOFT '95, number 915 in Lecture Notes in Computer Science, pages 516--30, Berlin, Heidelberg, and New York, May 1995. Springer-Verlag.
Automatically Closing Open Reactive Programs - Colby, Godefroid, Jagadeesan (1998) (9 citations) (Correct)
....well established technique. For instance, HR92] describes transformations based on the Program Dependence Graph [FOW87, KKL 81] Perhaps the most common such transformation is program slicing, originally introduced by Weiser in [Wei81] and later much investigated and extended (e.g. HRB88, Tip95] The input to a typical slicing tool is a program, a point p within the program, and an identifier x. The output is a possibly reduced program that preserves the trace of values bound to x at p. Note that a correct (albeit useless) slicing algorithm is the identity transformation. Our ....
F. Tip. Generic techniques for source-level debugging and dynamic program slicing. In Proceedings of TAPSOFT '95, volume 915 of Lecture Notes in Computer Science. Springer-Verlag, 1995.
The ASF+SDF Meta-environment: An Annotated Bibliography - van der Meulen (1995) (Correct)
....is illustrated using an example language named CLaX, a Pascal relative. We study how our approach can be extended to the generation of source level debuggers and algorithmic debuggers from specifications of interpreters. Generic Techniques for Source level Debugging and Dynamic Program Slicing [Tip94a] Algebraic specifications have been used successfully as a formal basis for software development. The contribution of this paper is to show that the origin and dynamic dependence relations that are implicitly defined by an algebraic specification can be used to define powerful language specific ....
F. Tip. Generic techniques for source-level debugging and dynamic program slicing. Report CS-R9453, Centrum voor Wiskunde en Informatica (CWI), Amsterdam, 1994.
A Slicing-Based Approach for Locating Type Errors - Dinesh, Tip (1998) (11 citations) Self-citation (Tip) (Correct)
....[25, 34] a programming environment generator that implements algebraic specifications by way of term rewriting. Dependence tracking was previously implemented in the ASF SDF system s term rewriting engine for the purpose of supporting dynamic slicing in generated debugging environments [30]. Fig. 1 shows a snapshot of a type checking environment for the language CLaX, a Pascal like language. The most interesting features of CLaX are: nested scopes, overloaded operators, arrays, goto statements, and procedures with reference and value parameters. The top window of Fig. 1 is a program ....
....for simplification of Pim graphs are implemented as rewriting systems, and dependence tracking is used to obtain program slices for selected program values. By selecting different Pim subsystems, different kinds of slices can be computed, allowing for various cost accuracy tradeoffs to be made. In [30], dynamic program slices are obtained by applying dependence tracking to a previously written specification for a CLaX interpreter. The slice notion presented in the current paper differs from the traditional program slice concept in the following way. In program slicing, the objective is to find ....
[Article contains additional citation context not shown here]
Tip, F. Generic techniques for source-level debugging and dynamic program slicing. In Proceedings of the Sixth International Joint Conference on Theory and Practice of Software Development (Aarhus, Denmark, May 1995), P. D. Mosses, M. Nielsen, and M. I. Schwartzbach, Eds., vol. 915 of LNCS, Springer-Verlag, pp. 516--530.
A Case Study of a Slicing-Based Approach for Locating Type Errors - Dinesh, Tip (1997) Self-citation (Tip) (Correct)
....the error message. The CLaX language was originally developed as the demonstration language of the ESPRIT II Compare (Compiler Generation for Parallel Machines) project [1] Since then, CLaX has been used as a basis for various software tools, including type checkers, interpreters, and debuggers [10, 8, 9, 23, 21], as well as a test bed for origin tracking techniques [7, 5, 14] Several experiments with the ClaX specification revealed that the accuracy of the computed slices depends on a number of specification factors. In particular, we found that decreasing the amount of determinism in the specification ....
....for simplification of PIM graphs are implemented as rewriting systems, and dependence tracking is used to obtain program slices for selected program values. By selecting different PIM subsystems, different kinds of slices can be computed, allowing for various cost accuracy tradeoffs to be made. In [21], dynamic program slices are obtained by applying dependence tracking to a previously written specification for a CLaX interpreter. The slice notion presented in the current paper differs from the traditional program slice concept in the following way. In program slicing, the objective is to ....
[Article contains additional citation context not shown here]
TIP, F. Generic techniques for source-level debugging and dynamic program slicing. In Proceedings of the Sixth International Joint Conference on Theory and Practice of Software Development (Aarhus, Denmark, May 1995), P. D. Mosses, M. Nielsen, and M. I. Schwartzbach, Eds., vol. 915 of LNCS, Springer-Verlag, pp. 516--530.
Dynamic Path Conditions in Dependence Graphs - Hammer, Grimme, Krinke (2006) (Correct)
No context found.
F. Tip. Generic techniques for source-level debugging and dynamic program slicing. In Proceedings of the Sixth International Joint Conference on the Theory and Practice of Software Development. LNCS 915, 1995.
Generic Program Monitoring by Trace Analysis - Jahier, al. (2002) (2 citations) (Correct)
No context found.
F. Tip. Generic techniques for source-level debugging and dynamic program slicing. In Peter D. Mosses, Mogens Nielsen, and Michael I. Schwartzbach, editors, TAPSOFT '95: Theory and Practice of Software Development, volume 915 of LNCS, pages 516530. Springer-Verlag, 1995.
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