Sciweavers

114 search results - page 3 / 23
» Cost effective dynamic program slicing
Sort
View
ISSTA
2009
ACM
13 years 11 months ago
Memory slicing
Traditional dynamic program slicing techniques are code-centric, meaning dependences are introduced between executed statement instances, which gives rise to various problems such...
Bin Xin, Xiangyu Zhang
ICSM
2007
IEEE
13 years 11 months ago
Indexing Noncrashing Failures: A Dynamic Program Slicing-Based Approach
Recent software systems usually feature an automated failure reporting component, with which a huge number of failures are collected from software end-users. With a proper support...
Xiangyu Zhang Chao Liu, Yu Zhang, Jiawei Han, Bhar...
ICSE
2004
IEEE-ACM
14 years 5 months ago
Using Compressed Bytecode Traces for Slicing Java Programs
Dynamic slicing is a well-known program debugging technique. Given a program P and input I, it finds all program statements which directly/indirectly affect the values of some var...
Tao Wang, Abhik Roychoudhury
APSEC
2009
IEEE
13 years 8 months ago
Sequence Diagram Slicing
Software visualization with sequence diagrams is one of the promising techniques aimed at helping developers comprehend the behavior of object-oriented systems effectively. However...
Kunihiro Noda, Takashi Kobayashi, Kiyoshi Agusa, S...
PLDI
2010
ACM
13 years 10 months ago
Finding low-utility data structures
Many opportunities for easy, big-win, program optimizations are missed by compilers. This is especially true in highly layered Java applications. Often at the heart of these misse...
Guoqing Xu, Nick Mitchell, Matthew Arnold, Atanas ...