Corpus ID: 5497423

Cross-language Program Slicing in the .NET Framework

@inproceedings{Pcza2005CrosslanguagePS,
  title={Cross-language Program Slicing in the .NET Framework},
  author={Kriszti{\'a}n P{\'o}cza and Mih{\'a}ly Bicz{\'o} and Zolt{\'a}n Porkol{\'a}b},
  year={2005}
}
Dynamic program slicing methods are very attractive for debugging because many statements can be ignored in the process of localizing a bug. [...] Key Method The method is utilizing the CLR Debugging Services API, hence it can be applied to large multi-language applications.Expand
Towards Effective Runtime Trace Generation Techniques in the .NET Framework
TLDR
This paper introduces two cross-language trace generation methods based on the .NET Debugging and Profiling Infrastructure that are compared by performance and applicability to real-size executables. Expand
Towards Detailed Trace Generation Using the Profiler in the .NET Framework?
Effective runtime trace generation is vital for understanding, analyzing, and maintaining large-scale applications. In this paper an effective detailed runtime trace generation approach is introducedExpand
ORBS: language-independent program slicing
TLDR
Five variants of ORBS are evaluated on ten programs of different sizes and languages showing that it is less expensive than similar existing techniques and able to handle systems written in multiple languages without specialist analysis tools. Expand
Debugging C++ template metaprograms
TLDR
Templight is a debugging framework that reveals the steps executed by the compiler during the compilation of C++ programs with templates, and aims to take a step forward to help template metaprogramming become more accepted in the software industry. Expand
Seeing Is Slicing: Observation Based Slicing of Picture Description Languages
  • S. Yoo, D. Binkley, R. Eastman
  • Computer Science
  • 2014 IEEE 14th International Working Conference on Source Code Analysis and Manipulation
  • 2014
TLDR
Taking Picture Description Languages as a case study, the challenges and effectiveness of such a generalization are considered and the results show that not only is it possible to generalize the ORBS algorithm, but the resulting slicer is quite effective removing from 27% to 98% of the original source code with an average of 85%. Expand
A General Regression Test Selection Technique
This paper presents a new methodology to select test cases from regression test suites. The selection strategy is based on analyzing the dynamic behavior of the applications that written in anyExpand
Observational slicing based on visual semantics
TLDR
Results show that not only is it possible to generalize the ORBS implementation, but the resulting slicer is quite effective, removing from 8% to 98% of the original source code with an average of 83%. Expand
Regression test Selection technique based on dynamic behaviour
TLDR
A technique is designed that combine the code based technique and model based technique, to allow comparing the object ornieted of an application that written in any programming language. Expand
Inter-Procedural Static Slicing Using Advanced Caching Algorithm *
TLDR
In this paper an advanced caching algorithm intended to decrease average complexity of SDG-based static slicing is proposed and might imply significant speed growth since re-computing dependences between formal input and output parameters is avoidable. Expand
An approach to select regression tests to validate .NET applications upon deployment of components upgrades
TLDR
A regression test strategy based on capturing and analyzing the dynamic behavior of the application, and a prototype tool called InARTS that determines the impact of upgrades on .NET applications and suggests a reduced set of regression tests. Expand
...
1
2
...

References

SHOWING 1-10 OF 19 REFERENCES
Design and implementation of bytecode-based Java slicing system
TLDR
This work proposes a method of constructing a DC slicing system for Java programs which uses both static and dynamic information and has extended a Java virtual machine for extraction of dynamic information. Expand
A slicing method for object-oriented programs using lightweight dynamic information
TLDR
This paper proposes a program slicing method for object-oriented programs and evaluates its effectiveness with Java programs by using static and dynamic analyses appropriately and computes accurate slices with small costs. Expand
Dynamic slicing method for maintenance of large C programs
TLDR
The main advantage of this algorithm is that it can be applied to real-size C programs, because its memory requirements are proportional to the number of different memory locations used by the program (which is in most cases far smaller than the size of the execution history which is the absolute upper bound of the algorithm). Expand
Speeding up slicing
TLDR
A new algorithm for slicing with system dependence graphs that is asymptotically faster than the previous one is defined, providing roughly a 6-fold speedup on examples of 348 to 757 lines. Expand
Program Slicing
TLDR
Applications of program slicing are surveyed, ranging from its first use as a debugging technique to current applications in property verification using finite state models, and a summary of research challenges for the slicing community is discussed. Expand
Advanced slicing of sequential and concurrent programs
  • J. Krinke
  • Computer Science
  • 20th IEEE International Conference on Software Maintenance, 2004. Proceedings.
  • 2004
TLDR
This thesis presents a high-precision approach toslice concurrent procedural programs despite the fact that optimal slicing is known to be undecidable, and is the first approach to slice concurrent programs that does not rely on inlining of called procedures. Expand
Dynamic program slicing
TLDR
This paper investigates the concept of the dynamic slice consisting of all statements that actually affect the value of a variable occurrence for a given program input, and introduces the economical concept of a Reduced Dynamic Dependence Graph, proportional in size to the number of dynamic slices arising during the program execution. Expand
Dependence analysis for recursive java programs
TLDR
A new approach to analyze dependences of a direct or indirect recursive Java program by simulating its execution by developing a new kind of dependence analysis method for recursive Java programs. Expand
The program dependence graph in a software development environment
TLDR
The program dependence graph (PDG) may be a suitable internal form that is amenable to incremental data flow analysis, improving response time to the user in an interactive environment and facilitating debugging through data flow anomaly detection. Expand
The program dependence graph in a software development environment
TLDR
The program dependence graph (PDG) may be a suitable internal form that is amenable to incremental data flow analysis, improving response time to the user in an interactive environment and facilitating debugging through data flow anomaly detection. Expand
...
1
2
...