Abstract
Program slicing is a technique to extract program parts with respect to some special computation. Since Weiser first proposed the notion of slicing in 1979, hundreds of papers have been presented in this area. Tens of variants of slicing have been studied, as well as algorithms to compute them. Different notions of slicing have different properties and different applications. These notions vary from Weiser's syntax-preserving static slicing to amorphous slicing which is not syntax-preserving, and the algorithms can be based on dataflow equations, information-flow relations or dependence graphs.Slicing was first-developed to facilitate debugging, but it is then found helpful in many aspects of the software development life cycle, including program debugging, software testing, software measurement, program comprehension, software maintenance, program parallelization and so on.Over the last two decades, several surveys on program slicing have been presented. However, most of them only reviewed parts of researches on program slicing or have now been out of date. People who are interested in program slicing need more information about the up to date researches. Our survey fills this gap. In this paper, we briefly review most of existing slicing techniques including static slicing, dynamic slicing and the latest slicing techniques. We also discuss the contribution of each work and compare the major difference between them. Researches on slicing are classified by the research hot spots such that people can be kept informed of the overall program slicing researches.
- {Abadi 1999} Martin Abadi, Anindya Banerjee, Nevin Heintze and Jon G. Riecke, Dynamic slicing in High-Order programming languages, Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pp. 147--160, 1999.]] Google ScholarDigital Library
- {Agrawal 1988} Hiralal Agrawal, Richard DeMillo and Eugene Spafford, A process state model to relate testing and debugging. Technical Report SERC-TR-27-P, Purdue University, 1988.]]Google Scholar
- {Agrawal 1989} Hiralal Agrawal and Joseph R. Horgan, Dynamic program slicing, Technical Report SERC-TR-56-P, Purdue University, 1989.]]Google Scholar
- {Agrawal 1990} Hiralal Agrawal and Joseph R. Horgan, Dynamic program slicing, Proceedings of the ACM SIGPLAN'90 Conference on Programming Language Design and Implementation, pp. 246--256, Jun. 1990. (SIGPLAN Notices 25(6), Jun. 1990)]] Google ScholarDigital Library
- {Agrawal 1991} Hiralal Agrawal, Richard A. DeMillo and Eugene H. Spafford. Dynamic slicing in the presence of unconstrained pointers, Proceeding of ACM Fourth Symposium on Testing, Analysis, and Verification (TAV4), pp. 60--73, 1991.]] Google ScholarDigital Library
- {Agrawal 1992} Hiralal Agrawal, Towards automatic debugging of Computer Programs, PhD thesis, Purdue University, 1992.]] Google ScholarDigital Library
- {Agrawal 1993a} Hiralal Agrawal, Richard DeMillo and Eugene Spafford, Debugging with dynamic slicing and backtracking, Software--- Practice and Experience, 23(6), pp. 589--616, Jun. 1993.]] Google ScholarDigital Library
- {Agrawal 1993b} Hiralal Agrawal, Joseph R. Horgan, Edward W. Krauser and Saul A. London, Incremental regression testing, Proceedings of the Conference on Software Maintenance-1993, pp. 1--10, 1993.]] Google ScholarDigital Library
- {Agrawal 1994} Hiralal Agrawal, On slicing program with jump statements, Proceedings of the ACM SIGPLAN'94 Conference on Programming Language Design and Implementation (Orlando, Florida, 1994).]] Google ScholarDigital Library
- {Agrawal 2001} Gagan Agrawal and Liang Guo, Evaluating explicitly context-sensitive program slicing, PASTE 2001, pp. 6--12.]] Google ScholarDigital Library
- {Ahn 1999} Joonseon Ahn and Taisook Han, Static slicing of a first-order functional language based on operational semantics, Korea Advanced Institute of Science & Technology (KAIST) Technical Report CS/TR-99-144, Dec. 1999.]]Google Scholar
- {Allen 1972} Frances E. Allen and John Cocke, Graph theoretic constructs for program control flow analysis, Technical Report RC 3923 (No. 17789), IBM, Thomas J. Watson Research Center, New York, July 1972.]]Google Scholar
- {Allen 1983} J. R. Allen, Ken Kennedy, Carrie Porterfield, and Joe Warren, Conversion of control dependence to data dependence, Conf. Rec. of the POPL-10, Austin, Texas, pp. 177--189, Jan. 1983.]] Google ScholarDigital Library
- {Allen 2003} Matthew Allen and Susan Horwitz, Slicing java programs that throw and catch exceptions, ACM SIGPLAN Notices, 2003.]] Google ScholarDigital Library
- {Ammarguellat 1992} Zahira Ammarguellat, A control-flow normalization algorithm and its complexity, IEEE Trans. on Software Eng., 18(3), pp. 237--250, 1992.]] Google ScholarDigital Library
- {Amme 1998} Wolfram Amme and Eberhard Zehendner, Data dependence analysis in programs with pointers, Parallel Computing, 24(3-4), pp. 505--525, May 1998.]] Google ScholarDigital Library
- {Andersen 1994} Lars Ole. Andersen, Program analysis and specialization for the C programming language, PhD thesis, DIKU, University of Copenhagen, May 1994.]]Google Scholar
- {Anderson 2001} Paul Anderson and Tim Teitelbaum, Software inspection using Codesurfer, In Workshop on Inspection in Software Engineering (CAV 2001), 2001.]]Google Scholar
- {Antoniol 1997} Giuliano Antoniol, Roberto Fiutem, G. Lutteri, Paolo Tonella, S. Zanfei and Ettore Merlo, Program understanding and maintenance with the CANTO environment, Proceedings of International Conference on Software Maintenance, pp. 72--81, 1997.]] Google ScholarDigital Library
- {Antoniol 1999} Giuliano Antoniol, F. Calzolari, Paolo Tonella, Impact of function pointers on the call graph, Proceedings of the Third European Conference on Software Maintenance and Reengineering, p. 51, 1999.]] Google ScholarDigital Library
- {Ashcroft 1971} E. Ashcroft and Zohar Manna, The translation of verb -goto- programs into verb -while- programs, IFIP Congress, Amsterdam, 1971.]]Google Scholar
- {Atkinson 1996} Darren C. Atkinson, William G. Griswold, The design of whole-program analysis tools, Proceedings of the 18th International Conference on Software Engineering, Berlin, IEEE, pp. 16--27, Mar. 1996.]] Google ScholarDigital Library
- {Atkinson 1998} Darren C. Atkinson and William G. Griswold, Effective whole-program analysis in the presence of pointers, Proceedings of the ACM SIGSOFT Symposium on the Foundations of Software Engineering, pp. 131--142, Nov. 1998.]] Google ScholarDigital Library
- {Atkinson 2001} Darren C. Atkinson and William G. Griswold, Implementation techniques for efficient data-flow analysis of large programs, Proceedings of International Conference on Software Maintenance, pp. 52--61, 2001.]] Google ScholarDigital Library
- {Atkinson 2002} Darren C. Atkinson, Markus Mock, Craig Chambers and Susan J. Eggers, Program slicing using dynamic points-to data, ACM SIGSOFT 10th Symposium on the Foundations of Software Engineering (FSE), Nov. 2002.]] Google ScholarDigital Library
- {Ball 1989} Thomas Ball, Susan Horwitz and Thomas Reps, Correctness of an algorithm for reconstituting a program from a dependence graph, Computer Sciences Dept., Univ. of Wisconsin, Madison, Technical Report in preparation, Spring 1989.]]Google Scholar
- {Ball 1993a} Thomas Ball and Susan Horwitz, Slicing program with arbitrary control-flow, Proceedings of the First International Workshop on Automated and Algorithmic Debugging (1993), P. Fritzson, Ed., vol. 749 of Lecture Notes in Computer Science, Springer-Verlag, pp. 206--222.]] Google ScholarDigital Library
- {Ball 1993b} Thomas Ball, The use of control-flow and control dependence in software tools, PhD thesis, University of Wisconsin-Madison, 1993.]] Google ScholarDigital Library
- {Ball 1994a} Thomas Ball and Stephen G. Eick, Visualizing program slices, Proceedings of IEEE Symposium on Visual Languages, pp. 288--295, 1994.]]Google Scholar
- {Ball 1994b} Thomas Ball and James R. Larus, Optimally profiling and tracing programs, ACM Transactions on Programming Languages and Systems, 16(4), pp. 1319--1360, July 1994.]] Google ScholarDigital Library
- {Balance 1992} Robert A. Balance and Arthur B. Maccabe, Program dependence graphs for the rest of us, Technical Report, The University of New Mexico, Oct. 1992.]]Google Scholar
- {Balmas 2001} Francoise Balmas, Displaying dependence graphs: a hierarchical approach, Proceedings of 8th Working Conference on Reverse Engineering, pp. 261--270, 2001.]] Google ScholarDigital Library
- {Baker 1977} Brenda S. Baker, An algorithm for structuring flowgraphs, Journal of the ACM, 24(1), pp. 98--120, 1977.]] Google ScholarDigital Library
- {Banerjee 1979} Utpal Banerjee, Speedup of ordinary programs, PhD thesis, University of Illinois at Urbana-champaign, Oct. 1979.]] Google ScholarDigital Library
- {Banerjee 1988} Utpal Banerjee, Dependence analysis for supercomputing, Kluwer Academic, 1988.]] Google ScholarDigital Library
- {Bates 1993} Samuel Bates and Susan Horwitz, Incremental program testing using program dependence graphs, Conference Record of the Twentieth ACM Symposium on Principles of Programming Languages, pp. 384--396, 1993.]] Google ScholarDigital Library
- {Beck 1993} John Beck and David Eichmann, Program and interface slicing for reverse engineering, Proceedings of 15th International Conference on Software Engineering, pp. 509--518, 1993.]] Google ScholarDigital Library
- {Beizer 1990} Boris Beizer, Software Testing Techniques, van Nostrand Reinhold, second edition, 1990.]] Google ScholarDigital Library
- {Bent 2000} Leeann Bent, Darren C. Atkinson and William G. Griswold, A qualitative study of two whole-program slicers for C, Technical Report CS2000-0643, Univ. of California at San Diego, (a preliminary version appeared at FSE 2000) (2000).]] Google ScholarDigital Library
- {Bergeretti 1985} Jean Francois Bergeretti and Bernard A. Carré, Information-flow and data-flow analysis of while-programs, ACM Transactions on Programming Languages and Systems, 7(1), pp. 37--61, Jan. 1985.]] Google ScholarDigital Library
- {Berzins 1995} Valdis Berzins, Software merging and slicing, IEEE Computer Society Press, Los Alamitos, 1995.]] Google ScholarDigital Library
- {Beszédes 2001a} Árpád Beszédes, Tamás Gergely, Zsolt Mihály Szabó, Csaba Faragó and Tibor Gyimóthy, Forward computation of dynamic slices of C programs. Technical Report TR-2000-001, RDAI, 2000.]]Google Scholar
- {Beszédes 2001b} Árpád Beszédes, Tamás Gergely, Zsolt Mihály Szabó, János Csirik and Tibor Gyimóthy, Dynamic slicing method for maintenance of large C programs. Proceedings of the 5th European Conference on Software Maintenance and Reengineering (CSMR 2001), Lisbon, Portugal, Mar. 2001.]] Google ScholarDigital Library
- {Beszedes 2002a} Arpad Beszedes, Csaba Farago, Zsolt Mihaly Szabo and Tibor Gyimothy, Union slices for program maintenance, International Conference on Software Maintenance, Montreal, Oct. 2002.]] Google ScholarDigital Library
- {Beszedes 2002b} Arpad Beszedes and Tibor Gyimothy, Union slices for the approximation of the precise slice, IEEE International Conference on Software Maintenance (ICSM'02), pp. 12--20, Montreal, Canada, Oct. 2002.]]Google Scholar
- {Bieman 1994} James M. Bieman and Linda M. Ott, Measuring functional cohesion, IEEE Transactions on Software Engineering, 20(8), pp. 644--657, 1994.]] Google ScholarDigital Library
- {Bieman 1998} James M. Bieman and Byung-Kyoo Kang, Measuring design-level cohesion, IEEE Transaction on Software Engineering, 24(2), pp. 111--124, Feb. 1998.]] Google ScholarDigital Library
- {Binkley 1992} David Binkley, Using semantic differencing to reduce the cost of regression testing, Proc. IEEE Conference on Software Maintenance, Washington, D. C., pp. 41--50, Nov. 1992.]]Google Scholar
- {Binkley 1993a} David Binkley, Precise executable interprocedural slices, ACM Letters on Programming Languages and Systems, 2(1-4), pp. 31--45, 1993.]] Google ScholarDigital Library
- {Binkley 1993b} David Binkley, Slicing in the presence of parameter aliasing. Proceedings of the 1993 Software Engineering Research Forum, (Orlando, FL), pp. 261--268, Nov. 1993.]]Google Scholar
- {Binkley 1995a} David Binkley, Susan Horwitz, and Thomas Reps, Program integration for languages with procedure calls, ACM Transactions on Software Engineering and Methodology, 4(1), pp. 3--35, Jan. 1995.]] Google ScholarDigital Library
- {Binkley 1995b} David Binkley, Reducing the cost of regression testing by semantics guided test case selection, IEEE International Conference on Software Maintenance, 1995.]] Google ScholarDigital Library
- {Binkley 1996} David Binkley and Keith Brian Gallagher, Program slicing, Advances in Computers, 43, pp. 1--50, 1996.]]Google ScholarCross Ref
- {Binkley 1997} David Binkley, Semantics guided regression test cost reduction, IEEE Transactions on Software Engineering, 23(8), pp. 489--516, Aug. 1997.]] Google ScholarDigital Library
- {Binkley 1998a} David W. Binkley and James R. Lyle, Application of the pointer state subgraph to static program slicing, The Journal of Systems and Software, pp. 17--27, 1998.]] Google ScholarDigital Library
- {Binkley 1998b} David Binkley, The application of program slicing to regression testing, Information and Software Technology, 40(11-12), pp. 583--594, 1998.]]Google ScholarCross Ref
- {Binkley 1999} David Binkley, Computing amorphous program slices using dependence graphs and a data-flow model, ACM Symposium on Applied Computing, pp. 519--525, 1999.]] Google ScholarDigital Library
- {Binkley 2000} David Binkley, L. Ross Raszewski, Christopher Smith and Mark Harman, An empirical study of amorphous slicing as a program comprehension support tool, Proceedings of the IEEE Eighth International Workshop on Program Comprehension, Limerick, Ireland, pp. 161--170, Jun. 2000.]] Google ScholarDigital Library
- {Binkley 2002} David Binkley, An empirical study of the effect of semantic differences on programmer comprehension, Proceedings of the IEEE Eighth International Workshop on Program Comprehension, Paris, France, pp. 97--106, Jun. 2002.]] Google ScholarDigital Library
- {Binkley 2003} David Binkley, Mark Harman, A large-scale empirical study of forward and backward static slice size and context sensitivity, Proceeding of IEEE International Conference on Software Maintenance (ICSM 2003), Amsterdam, Netherlands, p. 44, 2003.]] Google ScholarDigital Library
- {Binkley 2004a} David Binkley and Mark Harman, A survey of empirical result on program slicing, Advances in Computers, 62, pp. 105--178, 2004.]]Google ScholarCross Ref
- {Binkley 2004b} David Binkley, Sebastian Danicic, Tibor Gyimóthy, Mark Harman, Ákos Kiss and Lahcen Ouarbya, Formalizing executable dynamic and forward slicing, Proceedings of the 4th IEEE Workshop on Source Code Analysis and Manipulation, Chicago, USA, pp. 15--16, Sep. 2004.]] Google ScholarDigital Library
- {Bisas 1997} Sandip K. Biswas, Dynamic slicing in higher-order programming languages, PhD thesis, University OF Pennsylvania, 147 pages, 1997.]] Google ScholarDigital Library
- {Bodik 1997}. Rastislav Bodik and Rajiv Gupta, Partial dead code elimination using slicing transformations, Proceedings of Conference on Programming Language Design and Implementation, pp. 159--170, 1997.]] Google ScholarDigital Library
- {Burke 1994} Michael Burke, Paul Carini, Jong-Deok Choi and Michael Hind, Flow-insensitive interprocedural alias analysis in the presence of pointers, In Proceedings of the Seventh International Workshop on Languages and Compilers for Parallel Computing, Aug. 1994.]] Google ScholarDigital Library
- {Callahan 1988} David Callahan, The program summary graph and flow-sensitive interprocedural data flow analysis, Proceedings of the ACM SIGPLAN 88 Conference on Programming Language Design and Implementation, (Atlanta, GA, June 1988), ACM SIGPLAN Notices 23(7), pp. 47--56, July 1988.]] Google ScholarDigital Library
- {Callahan 1990} David Callahan, Alan Carle, Mary Wolcott Hall and Ken Kennedy, Constructing the procedure call multigraph, IEEE Transactions on Software Engineering, 16(4), pp. 483--487, 1990.]] Google ScholarDigital Library
- {Canfora 1994a} Gerardo Canfora, Andrea De Lucia, Giuseppe A. Di Lucca and A. R. Fasolino, Slicing large programs to isolate reusable functions, Proceedings of EUROMICRO Conference, Liverpool, U.K, IEEE CS Press, pp. 140--147, 1994.]]Google Scholar
- {Canfora 1994b} Gerardo Canfora, Andrea De Cimitile, A. De Lucia, Giuseppe A. Di Lucca, Software salvaging based on conditions, Proceedings of International Conference on Software Maintenance, pp. 424--433, 1994.]] Google ScholarDigital Library
- {Canfora 1998} Gerardo Canfora, Aniello Cimitile, and Andrea De Lucia. Conditioned program slicing. In Mark Harman and Keith Gallagher, editors, Information and Software Technology Special Issue on Program Slicing, volume 40, pages 595--607. Elsevier Science B.V., 1998.]]Google Scholar
- {Canfora 2000} Gerardo Canfora, Aniello Cimitile, Andrea De Lucia and Giuseppe A. Di Lucca, Decomposing legacy programs: a first step towards migrating to client-server platforms, The Journal of Systems and Software, 54, pp. 99--110, 2000.]] Google ScholarDigital Library
- {Cartwright 1989} Robert Cartwright and Matthias Felleisen, The semantics of program dependence, ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 13--27, 1989.]] Google ScholarDigital Library
- {Chang 1994} Juei Chang and Debra J. Richardson, Static and dynamic specification slicing, Proceedings of the Fourth Irvine Software Symposium, Irvine, CA, Apr. 1994.]]Google Scholar
- {Chase 1990} David R. Chase, Mark Wegman and F. Kenneth Zadek, Analysis of pointers and structures, Proceedings of the SIGPLAN '90 Conference on Program Language Design and Implementation, White Plains, NY, pp. 296--310, Jun. 1990.]] Google ScholarDigital Library
- {Chen 1997a} Jiun-Liang Chen, Feng-Jian Wang and Yung-Lin. Chen, An object-oriented dependency graph for program slicing, Technology of Object-Oriented Languages and Systems Tools, Beijing, China, 24, Sep. 1997.]] Google ScholarDigital Library
- {Chen 1997b} Jiun-Liang Chen, Feng-Jian Wang and Yung-Lin Chen, Slicing object-oriented programs, 4th Asia-Pacific Software Engineering and International Computer Science Conference (APSEC '97 / ICSC '97), Clear Water Bay, HONG KONG, Dec. 1997.]] Google ScholarDigital Library
- {Chen 2000} Guilin Chen, Bo Huang, Binyu Zang, and Chuanqi Zhu, Transformation of programs to remove nonlocal control flow, The Fourth International Conference on High-Performance Computing in the Asia-Pacific Region, Beijing, China, 1, pp. 14--17, May 2000.]]Google Scholar
- {Chen 1993} T. Y. Chen and Y. Y. Cheung, Dynamic program dicing, Proceedings of IEEE Conference on Software Maintenance (ICSM 1993), pp. 378--385, 1993.]] Google ScholarDigital Library
- {Chen 1997} T. Y. Chen and Y. Y. Cheung, On program dicing, Software Maintenance: Research and Practice, 9, pp. 33--46, 1997.]] Google ScholarDigital Library
- {Chen 1999a} Zhenqiang Chen, Baowen Xu, Dependence Analysis and Static Slices of Concurrent Programs, In 5th International Conference for Young Computer Scientist (ICYCS'99), 1999.]]Google Scholar
- {Chen 1999b} Zhenqiang Chen and Baowen Xu, Dependency analysis based dynamic slicing for debugging. International Software Engineering Symposium 2001 (ISES'01), Wuhan, China, pp. 398--404, 2001. Engineering and Technology (ASSET '99), IEEE CS Press, pp. 230--237, 1999.]]Google Scholar
- {Chen 2000} Zhenqiang Chen, Baowen Xu, Hongji Yang, Kecheng Liu and Jianping Zhang, An approach to analyzing dependency of concurrent programs, Proceedings of APAQS'2000, IEEE CS Press, Hongkong, pp. 34--39, 2000.]] Google ScholarDigital Library
- {Chen 2001a} Zhenqiang Chen and Baowen Xu, Slicing object-oriented Java programs, ACM SIGPLAN Notices, 36, pp. 33--40, Apr. 2001.]] Google ScholarDigital Library
- {Chen 2001b} Zhenqiang Chen, Baowen Xu and Hongji Yang, Slicing Tagged Objects in Ada, Ada-Europe 2001, pp. 100--112, 2001.]] Google ScholarDigital Library
- {Chen 2001c} Zhenqiang Chen, Baowen Xu, Slicing Concurrent Java Programs, ACM SIGPLAN Notices, 36(4), pp. 41--47, 2001.]] Google ScholarDigital Library
- {Chen 2001d} Zhenqiang Chen and Baowen Xu, Dependency analysis based dynamic slicing for debugging, International Software Engineering Symposium 2001 (ISES'01), Wuhan, China, pp. 398--404, 2001.]]Google Scholar
- {Chen 2002a} Zhenqiang Chen, Baowen Xu, An overview of methods for dependence analysis of concurrent programs, ACM SIGPLAN Notices, 37(8), pp. 45--52, 2002.]] Google ScholarDigital Library
- {Chen 2002b} Zhenqiang Chen, Baowen Xu, Hongji Yang, Jianjun Zhao, Static dependency analysis for concurrent Ada 95 programs, In 7th International Conference on Reliable Software Technology (Ada-Europe'2002), LNCS 2361, pp. 219--230, 2002.]] Google ScholarDigital Library
- {Chen 2002c} Zhenqiang Chen, Yuming Zhou, Baowen Xu, Jianjun Zhao, and Hongji Yang, A novel approach to measuring class cohesion based on dependence analysis, Proceedings of IEEE International Conference on Software Maintenance (ICSM'02), Montreal, Canada, pp. 377--384, Oct. 2002.]] Google ScholarDigital Library
- {Chen 2002d} Zhenqiang Chen, Baowen Xu, Hongji Yang and Jianjun Zhao, Concurrent Ada dead statements detection, Information and Software Technology, 44(13), pp. 733--741, Oct. 2002.]]Google ScholarCross Ref
- {Chen 2003a} Zhenqiang Chen, Baowen Xu, An approach to measurement of class cohesion based on dependence analysis, Journal of Software, 14(11), pp. 1849--1856, 2003.]]Google Scholar
- {Chen 2003b} Zhenqiang Chen, Baowen Xu and Guan Jie, Test coverage analysis based on program slicing, Journal of Electronics, 20(3), pp. 232--236, 2003.]]Google Scholar
- {Chen 2003c} Zhenqiang Chen, Baowen Xu, Hongji Yang, Test coverage analysis based on program slicing, Proceedings of The 2003 IEEE International Conference on Information Reuse and Integration (IRI'2003), October 27--29, 2003, Las Vegas, USA.]]Google Scholar
- {Chen 2003d} Zhenqiang Chen, Baowen Xu, William Chu, Hongji Yang and Jianjun Zhao, Slicing larger programs partially, Proceedings of The 2003 International Conference on Software Engineering Research and Practice (SERP'03: June 23--26, 2003, Las Vegas, Nevada, USA)]]Google Scholar
- {Chen 2004} Zhenqiang Chen, Baowen Xu and Yuming Zhou, Measuring Class Cohesion Based on Dependence Analysis, Journal of Computer Science and Technology, 2004, 19(5): 574--581.]] Google ScholarDigital Library
- {Cheng 2000} Ben-Chung Cheng and Wen-Mei W. Hwu, Modular interprocedural pointer analysis using access paths: design, implementation, and evaluation, Proceedings of the ACM SIGPLAN 2000 conference on Programming language design and implementation, Aug. 2000.]] Google ScholarDigital Library
- {Cheng 1991} Jingde Cheng, Process dependence net: A concurrent program representation, Proceedings of JSSST 8th Conference, pp. 513--516, 1991.]]Google Scholar
- {Cheng 1993} Jingde Cheng, Slicing concurrent programs--A graph-theoretical approach, Proceedings of the First International Workshop on Automated and Algorithmic Debugging (1993), P. Fritzson, Ed., vol. 749 of Lecture Notes in Computer Science, Springer-Verlag, pp. 223--240.]] Google ScholarDigital Library
- {Cheng 1997a} Jingde Cheng, Task dependence nets for concurrent systems with Ada 95 and its applications, ACM TRI-Ada International Conference, pp. 67--78, 1997.]] Google ScholarDigital Library
- {Cheng 1997b} Jingde Cheng, Dependence analysis of parallel and distributed programs and its applications, Proceedings of International Conference on Advances in Parallel and Distributed Computing, p. 370, 1997.]] Google ScholarDigital Library
- {Cheng 2001} Jingde Cheng, Dynamic slicing of concurrent programs: Where are we and where is the right way?, Proceedings of 2001 International Conference on Parallel and Distributed Processing Techniques and Applications, Las Vegas, USA, pp. 1905--1911, Jun. 2001.]]Google Scholar
- {Choi 1991} Jong-Deok Choi, Barton P. Miller and Robert H. B. Netzer, Techniques for debugging parallel programs with flowback analysis, ACM Transactions on Programming Languages and Systems, 13(4), pp. 491--530, Oct. 1991.]] Google ScholarDigital Library
- {Choi 1993} Jong-Deok Choi, Michael Burke and Paul Carini, Efficient flow-sensitive interprocedural computation of pointer-induced aliases and side-effects, In Conference Record of the Twentieth Annual ACM Symposium on Principles of Programming Languages, ACM Press, pp. 232--245, Jan. 1993.]] Google ScholarDigital Library
- {Choi 1994} Jong-Deok Choi and Jeanne Ferrante, Static slicing in the presence of goto statements, ACM Transactions on Programming Languages and Systems, 16(4), pp. 1097--1113, July 1994.]] Google ScholarDigital Library
- {Choi 2002} Jong-Deok Choi, Keunwoo Lee, Alexey Loginov, Robert O'Callahan, Vivek Sarkar and Manu Sridharan, Efficient and precise datarace detection for multithreaded object-oriented programs, Proceedings of ACM SIGPLAN 2002 Conference on Programming Language Design and Implementation (PLDI'02), Jun. 2002.]] Google ScholarDigital Library
- {Chung 2001} I. S. Chung, W. K. Lee and G. S. Yoon, Y. R. Kwon, Program slicing based on specification, Proceedings of the 2001 ACM symposium on Applied computing, pp. 605--609, 2001.]] Google ScholarDigital Library
- {Cifuentes 1993} Cristina Cifuentes, A structuring algorithm for decompilation, XIX Conference Latinoamericana de Informatica, Buenos Aires, Argentina, 2(6), pp. 267--276, Aug. 1993.]]Google Scholar
- {Cimitile 1995a} Aniello Cimitile, Andrea De Lucia and Malcolm Munro, Identifying reusable functions using specification driven program slicing: a case study, Proceedings of International Conference on Software Maintenance, Opio (Nice), France, IEEE CS Press, pp. 124--133, 1995.]] Google ScholarDigital Library
- {Cimitile 1995b} Aniello Cimitile, Andrea De Lucia, and Malcolm Munro, A specification driven slicing process for identifying reusable functions, Technical Report no. 3/95, Dep. of Computer Science, University of Durham, U.K., 1995.]]Google Scholar
- {Clarke 1999} Edmund M. Clarke and Masahiro Fujita and Sreeranga P. Rajan and Thomas W. Reps and Subash Shankar and Tim Teitelbaum, Program slicing of hardware description languages, Technical Report CMU-CS99 -103, Carnegie Mellon University, 1999.]]Google Scholar
- {Comuzzi 1996} Joseph J. Comuzzi and Johnson M. Hart, Program slicing using weakest preconditions, FME '96: Industrial Benefit and Advances in Formal Methods, Oxford, England, 1051, pp. 557--575, March 1996.]] Google ScholarDigital Library
- {Coutant 1986} Deborah S. Coutant, Retargetable high-level alias analysis, Proceedings of the Thirteenth Annual ACM Symposium on Principles of Programming Languages, ACM Press, pp. 110--118, 1986.]] Google ScholarDigital Library
- {Cutillo 1993} F. Cutillo, Piernicola Fiore and Giuseppe Visaggio, Identification and extraction of "domain independent" components in large programs, Proceedings of the 1st Proceedings of the Working Conference on Reverse Engineering, pp. 83--92, 1993.]]Google Scholar
- {Cytron 1990} Ron Cytron, Jeanne Ferrante, and V. Sarker, Compact representations for control dependence, Proceedings of the ACM SIGPLAN'90 Conference on Programming Language Design and Implementation, SIGPLAN Notices 25(6), pp. 337--351, 1990.]] Google ScholarDigital Library
- {Cytron 1991} Ron Cytron, Jeanne Ferrante, Barry K. Rosen, Mark N. Wegman, and F. Kenneth Zadeck, Efficiently computing static single 'assignment form and the control dependence graph, ACM Transactions on Programming Languages and Systems, pp. 451--490, Oct. 1991.]] Google ScholarDigital Library
- {Danicic 1995} Sebastian Danicic, Mark Harman, and Yogasundary Sivagurunathan, A parallel algorithm for static program slicing. Information Processing Letters, 56(6), pp. 307--313, December 1995.]] Google ScholarDigital Library
- {Danicic 1999} Sebastian Danicic, Dataflow Minimal Slicing, PhD thesis, University of North London, UK, School of Informatics, Apr. 1999.]]Google Scholar
- {Danicic 2000} Sebastian Danicic and Mark Harman, Espresso: A slicer generator, In ACM Symposium on Applied Computing, (SAC'00), pp. 831--839, 2000.]] Google ScholarDigital Library
- {Daninic 2004a} Sebastian Danicic, Dave Daoudi, Chris Fox, Mark Harman, Rob Hierons, John Howroyd, Lahcen Ouarbya and Martin Ward, ConSUS: A light-weight program conditioner, Journal of Systems and Software, 2004.]] Google ScholarDigital Library
- {Daninic 2004b} Sebastian Daninic, Andrea De Lucia and Mark Harman, Building executable union slices using conditioned slicing, Proceedings of the 12th IEEE International Workshop on Program Comprehension (IWPC'04), p. 89, 2004.]] Google ScholarDigital Library
- {Danicic} Sebastian Danicic, Chris Fox, Mark Harman, Robert Mark Hierons, John Howroyd, and Mike Laurence, Slicing algorithms are minimal for programs which can be expressed as linear, free, liberal schemas, ACM Transactions on Programming Languages and Systems, In revision.]]Google Scholar
- {Dantzig 1973} G. Dantzig and B. C. Eaves, Fourier-motzkin elimination and its dual, Journal of Combinatorial Theory, A(14), pp. 288--297, 1973.]]Google Scholar
- {Daoudi 2002} Dave Daoudi, Lahcen Ouarbya, John Howroyd, Sebastian Danicic, Mark Harman, Chris Fox, Martin P. Ward, ConSUS: A Scalable Approach to Conditioned Slicing, Proceedings of the Ninth Working Conference on Reverse Engineering (WCRE'02), Richmond, Virginia, p. 109, 2002.]] Google ScholarDigital Library
- {Das 2000} Manuvir Das, Unification-based pointer analysis with directional assignments, Proceedings of the SIGPLAN Conference on Programming Language Design and Implementation, pp. 35--46, Jun. 2000.]] Google ScholarDigital Library
- {DeMillo 1996} Richard A. DeMillo, Hsin Pan and Eugene H. Spafford, Critical slicing for software fault localization, ACM SIGSOFT Software Engineering Notes, 21(3), pp. 121--134, May 1996.]] Google ScholarDigital Library
- {Denning 1977} Dorothy E. Denning and Peter J. Denning, Certification of programs for secure information flow, Communications of the Association for Computing Machinery, 20(7), pp. 504--513, July 1977.]] Google ScholarDigital Library
- {Deng 2001} Yunbo Deng, Suraj Kothari and Yogy Namara, Program slice browser, Proceedings of Ninth International Workshop on Program Comprehension (IWPC'01), pp. 50--59, 2001.]] Google ScholarDigital Library
- {De Lucia 1996} Andrea De Lucia, Anna Rita Fasolino and Malcolm Munro, Understanding function behaviors through program slicing, Proceedings of 4th IEEE Workshop on Program Comprehension, Berlin, Germany, pp. 9--18, Mar. 1996.]] Google ScholarDigital Library
- {De Lucia 2001} Andrea De Lucia, Program slicing: Methods and applications, In IEEE workshop on Source Code Analysis and Manipulation (SCAM 2001), 2001.]]Google Scholar
- {De Lucia 2003} Andrea De Lucia, Mark Harman, Rob Hierons and Jens Krinke, Unions of slices are not slices. Proceedings of European Conference on Software Maintenance and Reengineering (CSMR '03), Benevento, Italy, Mar. 2003.]] Google ScholarDigital Library
- {Deutsch 1994} Alain Deutsch, Interprocedural may-alias analysis for pointers: beyond k-limiting, Proceedings of the ACM SIGPLAN'94 Conference on Programming Language Design and Implementation, pp. 230--241, Jun. 1994.]] Google ScholarDigital Library
- {Dhamdhere 2000} Dhananjay M. Dhamdhere, Effective execution histories for debugging and dynamic slicing, Technical Report, CSE Department, IIT Bombay, 2000.]]Google Scholar
- {Dhamdhere 2003} Dhananjay M. Dhamdhere, K. Gururaja and Prajakta G. Ganu, A compact execution history for dynamic slicing, Information Processing Letters, 85(3), pp. 145--152, Feb. 2003.]] Google ScholarDigital Library
- {Diwan 1998} Amer Diwan, Kathryn S. McKinley, and J. Eliot B. Moss, Type-based alias analysis, Proceedings of ACM SIGPLAN Conference on Programming Language Design and Implementation, Montreal, Canada, 1998.]] Google ScholarDigital Library
- {Duesterwald 1992a} Evelyn Duesterwald, Rajiv Gupta and Mary Lou Soffa, Rigorous data flow testing through output influences, Proceedings of the Second Irvine Software Symposium ISS'92 California, pp. 131--145, 1992.]]Google Scholar
- {Duesterwald 1992b} Evelyn Duesterwald, Rajiv Gupta, Mary Lou Soffa, Distributed slicing and partial re-execution for distributed programs, Proceedings of 5th Workshop on Languages and Compilers for Parallel Computing, pp. 497--511, 1992.]] Google ScholarDigital Library
- {Duesterwald 1993} Evelyn Duesterwald, Rajiv Gupta and Mary Lou Soffa, Demand driven program analysis, Technical Report TR-93-15, Department of Computer Science, University of Pittsburgh, Pittsburgh, PA, Oct. 1993.]]Google Scholar
- {Duesterwald 1995} Evelyn Duesterwald, Rajiv Gupta, and Mary Lou Soffa, Demand driven computation of interprocedural data flow, in Conference Record of the Twenty-Second ACM Symposium on Principles of Programming Languages, San Francisco, CA, Jan. 1995.]] Google ScholarDigital Library
- {Duesterwald 1997} Evelyn Duesterwald, Rajiv Gupta, and Mary Lou Soffa, A practical framework for demand-driven interprocedural data flow analysis, ACM Transaction on Programming Language and System, 19(6), pp. 992--1030, Nov. 1997.]] Google ScholarDigital Library
- {Dwyer 1995} Matthew B. Dwyer, Lori A. Clarke and Kari A. Nies, A compact Petri net representation for concurrent programs, ICSE'95, IEEE CS Press, pp. 147--157, 1995.]] Google ScholarDigital Library
- {Dwyer 1999a} Matthew B. Dwyer, James C. Corbett, John Hatcliff, Stefan Sokolowski and Hongjun Zheng, Slicing multi-threaded java programs: A case study, Technical Report KSU CIS TR 99-7, Department of Computing and Information Sciences, Kansas State University, 1999.]]Google Scholar
- {Dwyer 1999b} Matthew Dwyer and John Hatcliff, Slicing software for model construction, Proceedings of the 1999 ACM Workshop on Partial Evaluation and Program Manipulation (PEPM'99), pp. 105--118, Jan. 1999.]]Google Scholar
- {Emami 1994} Maryam Emami, Rakesh Ghiya and Laurie J. Hendren, Context-sensitive interprocedural point-to analysis in the presence of function pointers, Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation, pp. 242--256, Jun. 1994.]] Google ScholarDigital Library
- {Ernst 1994} Michael D. Ernst, Practical fine-grained static slicing of optimized code, Technical Report MSR-TR-94-14, Microsoft Research, Redmond, WA, July 1994.]]Google Scholar
- {Ernst 1995} Michael D. Ernst, Slicing pointers and procedures, Microsoft Research technical report, Redmond, WA, MSR-TR-95-23, Jan. 1995.]]Google Scholar
- {Erosa 1994} Ana M. Erosa and Laurie J. Hendren, Taming control flow: a structured approach to eliminating goto statements, International Conference on Computer Languages, pp. 229--240, May 1994.]]Google Scholar
- {Ezick 2001} James Ezick, Gianfranco Bilardi and Keshav Pingali, Efficient computation of interprocedural control dependence, Cornell University, Computer Science/Arts & Eng. Dept. Upson Hall Ithaca, NY, Sept. 2001]] Google ScholarDigital Library
- {Faragó 2001} Csaba Faragó and Tamás Gergely, Handling the unstructured statements in the forward dynamic slice algorithm. Proceedings of the 7th Symposium on Programming Languages and Software Tools (SPLST 2001), pp. 16--27, Jun. 2001.]]Google Scholar
- {Faragó 2002} Csaba Faragó, Tamás Gergely, Handling pointers and unstructured statements in the forward computed dynamic slice algorithm. Acta Cybernetica, 15(4), pp. 489--508, 2002.]] Google ScholarDigital Library
- {Ferrante 1987} Jeanne Ferrante, Karl J. Ottenstein and Joe D. Warren, The program dependence graph and its use in optimization, ACM Transactions on Programming Languages and Systems, 9(3), pp. 319--349, 1987.]] Google ScholarDigital Library
- {Filed 1995} John Field, G. Ramalingam and Frank Tip, Parametric program slicing, Proceedings of the ACM Symposium on Principles of Programming Languages, New York, pp. 379--392, 1995.]] Google ScholarDigital Library
- {Field 1998} John Field and Frank Tip, Dynamic dependence in term of rewriting systems and its application to program slicing, Information and Software Technology, 40(11-12), pp. 609--636, 1998.]]Google ScholarCross Ref
- {Flater 1993} David W. Flater, Yelina Yesha, and E. K. Park, Extensions to the C programming language for enhanced fault detection, Software -- Practice and Experience, 23(6), pp. 617--628, June 1993.]] Google ScholarDigital Library
- {Foster 2000} Jeffrey S. Foster, Manuel Fähndrich and Alexander Aiken, Polymorphic versus monomorphic flow-insensitive point-to analysis for C, In Seventh International Static Analysis Symposium, Jun. 2000.]] Google ScholarDigital Library
- {Forgacsy 1997a} Istvan Forgacsy and Tibor Gyimóthy, An efficient interprocedural slicing method for large programs, Proceedings of SEKE'97, pp. 279--287, Madrid, Spain, 1997.]]Google Scholar
- {Forgacsy 1997b} Istvan Forgacsy and Antonia Bertolino, Feasible test path selection by principal slicing, Proceedings of the Sixth European Software Engineering Conference (ESEC/FSE 97), LNCS 1301, Springer-Verlag, Sep. 1997.]] Google ScholarDigital Library
- {Fox 2001} Chris Fox, Mark Harman, Rob Hierons and Sebastian Danicic, Backward conditioning: a new program specialization technique and its application to program comprehension, In 9th IEEE International Workshop on Program Comprehension (IWPC'01), pp. 89--97, May 2001.]] Google ScholarDigital Library
- {Fox 2003} Chris Fox, Sebastian Danicic, Mark Harman and Robert Mark Hierons, ConSIT: a fully automated conditioned program slicer, Software--Practice and Experience, 34, pp. 15--46, 2004.]] Google ScholarDigital Library
- {Francel 1999} Margaret Ann Francel and Spencer Rugaber, The relationship of slicing and debugging to program understanding, Proceeding of 7th International Workshop on Program Comprehension, p. 106, May 1999.]] Google ScholarDigital Library
- {Francel 2001} Margaret Ann Francel and Spencer Rugaber, The value of slicing while debugging, Proceedings of the 7th International Workshop on Program Comprehension, pp. 151--169, 2001.]]Google Scholar
- {Fritzson 1992} Peter Fritzson, Nahid Shahmehri, Mariam Kamkar and Tibor Gyimothy, Generalized algorithmic debugging and testing, ACM Letters on Programming Languages and Systems, 1(4), pp. 303--322, 1992.]] Google ScholarDigital Library
- {Gallagher 1990} Keith Brian Gallagher, Using program slicing for program maintenance, PhD thesis, University of Maryland, College Park, Maryland, 1990.]] Google ScholarDigital Library
- {Gallagher 1991a} Keith Brian Gallagher, Using program slicing to eliminate the need for regression testing, Proceedings of 8th International Conference on Testing Computer Software, May 1991.]]Google Scholar
- {Gallagher 1991b} Keith Brian Gallagher and James R. Lyle, Using program slicing in software maintenance, IEEE Transactions on Software Engineering, 17(8), pp. 751--761, 1991.]] Google ScholarDigital Library
- {Gallagher 1993} Keith Brian Gallagher and J. R. Lyle, Program slicing and software safety, Proceedings of the Eighth Annual Conference on Computer Assurance, pp. 71--80, Jun. 1993.]]Google Scholar
- {Gallagher 1996} Keith Brian Gallagher, Visual impact analysis, Proceedings of the Conference on Software Maintenance, p. 52, 1996.]] Google ScholarDigital Library
- {Gallagher 1997} Keith Brian Gallagher and Liam O'Brien, Reducing visualization complexity using decomposition slices, Proceedings of Software Visualization Workshop, pp. 113--118, 1997.]]Google Scholar
- {Gallagher 2001} Keith Brian Gallagher and Liam O'Brien, Analyzing programs via decomposition slicing: initial data and observation, Proceeding of 7th Workshop on Empirical Studies of Software Maintenance, Florence, Italy, Nov. 2001.]]Google Scholar
- {Gallagher 2003} Keith Brian Gallagher and David Binkley, An empirical study of computation equivalence as determined by decomposition slice equivalence, Proceedings of the IEEE Tenth Working conference on Reverse Engineering, pp. 13--16, Nov. 2003.]] Google ScholarDigital Library
- {Gandle 1993} M. Gandle, A. Santal, and G. Venkatesh, Slicing functional programs using collecting abstract interpretation, First Symposium on Algorithmic and Automated Debugging, Linkoping, Sweeden, 1993.]]Google Scholar
- {Garg 2001} Vijay K, Garg and Neeraj Mittal, On slicing a distributed computation, Proceedings of the 21st IEEE International Conference on Distributed Computing Systems (ICDCS), Phoenix, Arizona, USA, pp. 322--329, Apr. 2001.]] Google ScholarDigital Library
- {Gerber 1997}, Richard Gerber and Seongsoo Hong, Slicing real-time programs for enhanced schedulability, ACM Transactions on Programming Languages and Systems, 13(3), pp. 525--555, 1997.]] Google ScholarDigital Library
- {Ghiya 1992} Rakesh Ghiya, Interprocedural analysis in the presence of function pointers, ACAPS Technical Memo 62, School of Computer Science, McGill University, Dec. 1992.]]Google Scholar
- {Ghiya 1996a} Rakesh Ghiya and Laurie J. Hendren, Connection analysis: a practical interprocedural heap analysis for C, International Journal of Parallel Programming, 24(6), pp. 547--578, 1996.]]Google ScholarDigital Library
- {Ghiya 1996b} Rakesh Ghiya and Laurie J. Hendren, Is it a tree, a DAG, or a cyclic graph? A shape analysis for heap-directed pointers in C, Proceedings of the 23rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 1--15, Jan. 1996.]] Google ScholarDigital Library
- {Ghiya 1998} Rakesh Ghiya and Laurie J. Hendren, Putting pointer analysis to work, Proceedings of 25th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Jan. 1998.]] Google ScholarDigital Library
- {Ghiya 2001} Rakesh Ghiya, Daniel Lavery and David Sehr, On the importance of points-to analysis and other memory disambiguation methods for C programs, Proceedings of the ACM SIGPLAN'01 conference on Programming language design and implementation, ACM Press, pp. 47--58, 2001.]] Google ScholarDigital Library
- {Gopal 1991} Rajiv Gopal, Dynamic program slicing based on dependence relations, Proceedings of Conference on Software Maintenance, Sorrento, Italy, IEEE CS Press, pp. 191--200, 1991.]]Google ScholarCross Ref
- {Goswami 2000a} Diganta Goswami and Rajib Mall, Dynamic slicing of concurrent programs, Proceedings of the 7th International Conference on High Performance Computing, pp. 15--26, Dec. 2000.]] Google ScholarDigital Library
- {Goswami 2000b} Diganta Goswami, Rajib Mall, Prosenjit Chatterjee, Static slicing in Unix process environment, Software--Practice and Experience, 30(1), pp. 17--36, 2000.]] Google ScholarDigital Library
- {Goswami 2002} Diganta Goswami and Rajib Mall, An efficient method for computing dynamic program slices, Information Processing Letters, 81(2), pp. 111--117, Jan. 2002.]] Google ScholarDigital Library
- {Gouranton 1998} Valérie Gouranton and Daniel Le Métayer, Dynamic slicing: A generic analysis based on a natural semantics format, Technical Report 3375, INRIA, Domaine de Voluceau, Rocquencourt, BP 105, 78153 Le chesnay Cedex FRANCE, Mar. 1998.]]Google Scholar
- {Gouranton 1999} Valérie Gouranton and Daniel Le Métayer, Dynamic slicing: A generic analysis based on a natural semantics format, Journal of Logic and Computation, 9(6), pp. 835--871, 1999.]]Google ScholarCross Ref
- {Grove 2001} David Grove, Craig Chambers, A framework for call graph construction algorithms, ACM Transactions on Programming Languages and Systems (TOPLAS), 23(6), pp. 685--746, Nov. 2001.]] Google ScholarDigital Library
- {Gupta 1992a} Rajiv Gupta and Mary Lou Soffa, A framework for generalized slicing, Technical Report TR-92-07, University of Pittsburgh, 1992.]]Google Scholar
- {Gupta 1992b} Rajiv Gupta, Mary Jean Harrold, and Mary Lou Soffa, An approach to regression testing using slicing, Proceedings of the Conference on Software Maintenance, Orlando, FL, U.S.A., IEEE CS Press, pp. 299--308, 1992.]]Google Scholar
- {Gupta 1995} Rajiv Gupta and Mary Lou Soffa, Hybrid slicing: An approach for refining static slices using dynamic information, ACM SIGSOFT Third Symposium on the Foundations of Software Engineering, pp. 29--40, Oct. 1995.]] Google ScholarDigital Library
- {Gupta 1997a} Rajiv Gupta, Mary Lou Soffa and John Howard, Hybrid slicing: integrating dynamic information with static analysis, ACM Transactions on Software Engineering and Methodology (TOSEM), 6(4), pp. 370--397, Oct. 1997.]] Google ScholarDigital Library
- {Gupta 1997b} Bindu S. Gupta, A critique of cohesion measures in the object-oriented paradigm, Master's thesis, Department of Computer Science, Michigan Technological University, 1997.]]Google Scholar
- {Gyimóthy 1998} Tibor Gyimóthy and Jukka Paakki, Static slicing of logic programs, Proceedings of 2nd International Workshop on Automated and Algorithmic Debugging, IRISA, France, Mar. 1998.]]Google Scholar
- {Gyimóthy 1999} Tibor Gyimóthy, Árpád Beszédes and István Forgács, An efficient relevant slicing method for debugging, Proceedings of 7th European Software Engineering Conference (ESEC), Toulouse, France, LNCS 1687, pp. 303--321, Sept. 1999.]] Google ScholarDigital Library
- {Hall 1992} Mary W. Hall, Ken Kennedy, Efficient call graph analysis, ACM Letters on Programming Languages and Systems (LOPLAS), 1(3), pp. 227--242, Sep. 1992.]] Google ScholarDigital Library
- {Hall 1995} Robert J. Hall, Automatic extraction of executable program subsets by simultaneous dynamic program slicing, Automated Software Engineering, 2(1), pp. 33--53, Mar. 1995.]]Google ScholarCross Ref
- {Harman 1994a} Mark Harman and Sebastian Danicic, A new approach to program slicing, 7th International Software Quality Week, San Francisco, May 1994.]]Google Scholar
- {Harman 1994b} Mark Harman and Sebastian Danicic, A framework for defining equivalence preserving program simplification and its application to program slicing, Technical Report, University of North London, Project Project, Mar. 1994.]]Google Scholar
- {Harman 1995a} Mark Harman, Sebastian Danicic and Yoga Sivagurunathan, Program comprehension assisted by slicing and transformation, 1st UK workshop on program comprehension, University of Durham, July 1995.]]Google Scholar
- {Harman 1995b} Mark Harman and Sebastian Danicic, A simultaneous slicing theory and derived program slicer, 4th RIMS Workshop in Computing, Kyoto University, Kyoto, Japan, July 1996.]]Google Scholar
- {Harman 1995c} Mark Harman, Sebastian Danicic, Barry Jones, Balasubramaniam Sivagurunathan, and Yogasundary Sivagurunathan, Pseudo variable in slicing criteria-- capturing implicit computation, 8th International Quality Week, San Francisco, May 29th - June 2nd, 1995.]]Google Scholar
- {Harman 1995d} Mark Harman, Sebastian Danicic, Yoga Sivagurunathan, Bala Sivagurunathan and Barry Jones, Cohesion metrics, 8th International Software Quality Week, San Francisco CA, paper 4-T-4, May 1995.]]Google Scholar
- {Harman 1995e} Mark Harman and Sebastian Danicic, Slicing programs in the presence of errors, Technical Report, University of North London, Project Project, Feb. 1995.]]Google Scholar
- {Harman 1995f} Mark Harman and Sebastian Danicic, Using program slicing to simplify testing, Journal of Software Testing, Verification and Reliability, 5(3), pp. 143--162, 1995.]]Google ScholarCross Ref
- {Harman 1996a} Mark Harman, Sebastian Danicic, Yogasundary Sivagurunathan, and Dan Simpson, The next 700 slicing criteria, Malcolm Munro, editor, 2nd UK workshop on program comprehension, Durham University, UK, July 1996.]]Google Scholar
- {Harman 1996b} Mark Harman, Dan Simpson and Sebastian Danicic, Slicing programs in the presence of errors, Formal Aspects of Computing, 8(4), 1996.]]Google Scholar
- {Harman 1997a} Mark Harman, Cleaving together - program cohesion with slices, EXE, 11(8), pp. 35--42, Jan. 1997.]]Google Scholar
- {Harman 1997b} Mark Harman, Margaret Okunlawon, Bala Sivagurunathan and Sebastian Danicic, Slice-based measurement of coupling, In Rachel Harrison, editor, 19th ICSE, Workshop on Process Modeling and Empirical Studies of Software Evolution, Boston, Massachusetts, USA, May 1997.]]Google Scholar
- {Harman 1997c} Mark Harman and Sebastian Danicic, Amorphous program slicing, Proceedings of IEEE International Workshop on Program Comprehension (IWPC'97), Dearborn, Michigan, pp. 70--79, May 1997.]] Google ScholarDigital Library
- {Harman 1998a} Mark Harman and Keith Brian Gallagher, Program slicing, Information and Software Technology, 40(11-12), pp. 577--581, 1998.]]Google ScholarCross Ref
- {Harman 1998b} Mark Harman, Yoga Sivagurunathan and Sebastian Danicic, Analysis of dynamic memory access using amorphous slicing, Proceedings of IEEE International Conference on Software Maintenance, Washington, DC, pp. 336--345, Nov. 1998.]] Google ScholarDigital Library
- {Harman 1998c} Mark Harman and Sebastian Danicic, A new algorithm for slicing unstructured programs, Journal of Software Maintenance: Research and Practice, 10(6), Nov. 1998.]] Google ScholarDigital Library
- {Harman 1998d} Mark Harman and Keith Brian Gallagher, editors. Special Issue on Program Slicing, Elsevier, 40, Nov. 1998.]]Google Scholar
- {Harman 2000a} Chris Fox, Mark Harman, Sebastian Danicic and Robert Hierons, ConSIT: A conditioned program slicer, IEEE International Conference on Software Maintenance (ICSM'00) (San Jose, California, USA), IEEE Computer Society Press, Los Alamitos, California, USA, pp. 216--226, Oct. 2000.]] Google ScholarDigital Library
- {Harman 2000b} Mark Harman, Robert M. Hierons and Sebastian Danicic, The relationship between program dependence and mutation analysis, Mutation 2000 Workshop, San Jose, California, USA, pp. 15--23, Oct. 2000.]]Google Scholar
- {Harman 2001a} Mark Harman and Rob Hierons, An overview of program slicing, Software Focus, 2(3), pp. 85--92, 2001.]]Google ScholarCross Ref
- {Harman 2001b} Mark Harman, Rob Hierons, Chris Fox, Sebastian Danicic and John Howroyd, Pre/Post conditioned slicing, Proceeding of IEEE International Conference on Software Maintenance (ICSM'01), Florence, Italy, pp. 138--147, Nov. 2001.]] Google ScholarDigital Library
- {Harman 2001c} Mark Harman, Robert M. Hierons, Sebastian Danicic, John Howroyd, Mike Laurence, and Chris Fox, Node coarsening calculi for program slicing, Working Conference on Reverse Engineering, 2001.]] Google ScholarDigital Library
- {Harman 2002a} Mark Harman, Nicolas Gold, Rob Hierons and David Binkley, Code extraction algorithms which unify slicing and concept assignment, Proceedings of 9th IEEE Working Conference on Reverse Engineering (WCRE'02), pp. 11--21, 2002.]] Google ScholarDigital Library
- {Harman 2002b} Mark Harman, Lin Hu, Malcolm Munro, Xingyuan Zhang, Sebastian Danicic, Mohammed Daoudi and Lahcen Ouarbya, An interprocedural amorphous slicer for WSL, Proceedings of the Second IEEE International Workshop on Source Code Analysis and Manipulation (SCAM'02), pp. 105--114, Oct. 2002.]] Google ScholarDigital Library
- {Harman 2002c} Mark Harman, Lin Hu, Rob Hierons, Chris Fox, Sebastian Danicic, Andre Baresel, Harmen Sthamer and Joachim Wegener, Evolutionary testing supported by slicing and transformation, Proceedings of 18th IEEE International Conference on Software Maintenance (ICSM 2002), p. 285, 2002.]] Google ScholarDigital Library
- {Harman 2004a} Mark Harman, Lin Hu, Malcolm Munro, Xingyuan Zhang, David Binkley, Sebastian Danicic, Lahcen Ouarbya and Dave (Mohammed) Daoudi, Syntax-Directed amorphous slicing, Journal of Automated Software Engineering, 11(1), pp. 27--61, 2004.]] Google ScholarDigital Library
- {Harman 2004b} Mark Harman, Lin Hu, Rob Hierons, Joachim Wegener, Harmen Sthamer, Baresel Baresel, Marc Roper, Testability transformation, IEEE Transaction on Software Engineering, 30(1), pp. 3--16, Jan. 2004.]] Google ScholarDigital Library
- {Harrold 1991} Mary Jean Harrold and Mary Lou Soffa, Selecting dataflow integration testing, IEEE Software, 8(2), pp. 58--65, 1991.]] Google ScholarDigital Library
- {Harrold 1993} Mary Jean Harrold, Brian Malloy and Gregg Rothermel, Efficient construction of program dependence graphs, International Symposium on Software Testing and Analysis (ISSTA'93), 1993.]] Google ScholarDigital Library
- {Harrold 1998a} Mary Jean Harrold, Gregg Rothermel, and Saurabh Sinha, Computation of interprocedural control dependence, Proceedings of the ACM International Symposium on Software Testing and Analysis, Clearwater, FL, pp. 11--21, Mar. 1998.]] Google ScholarDigital Library
- {Harrold 1998b} Mary Jean Harrold and Ning Ci, Reuse-driven interprocedural slicing, Proceedings of the 20th International Conference on Software Engineering (ICSE'98), Kyoto, Japan, pp. 74--83, April 1998.]] Google ScholarDigital Library
- {Hasti 1998} Rebecca Hasti and Susan Horwitz, Using static single assignment form to improve flow-insensitive pointer analysis, Proceedings of the ACM SIGPLAN'98 Conference on Programming Language. Design and Implementation, pp. 97--105, 17-19, Jun., SIGPLAN Notices 33(5), May 1998.]] Google ScholarDigital Library
- {Hatcliff 1999} John Hatcliff, James C. Corbett, Matthew B. Dwyer, Stefan Sokolowski, and Hongjun Zheng, A formal study of slicing for multi-threaded programs with JVM concurrency primitives, In Static Analysis Symposium, pp. 1--18, 1999.]] Google ScholarDigital Library
- {Hatcliff 2000} John Hatcliff, Matthew B. Dwyer, and Hongjun Zheng, Slicing software for model construction, Higher-Order and Symbolic Computation, 13(4), pp. 315--353, 2000.]] Google ScholarDigital Library
- {Hausler 1989} Prove Hausler, Denotational program slicing, Proceedings of the 22nd Hawaii International Conference on System Sciences, Hawaii, pp. 486--494, 1989.]]Google ScholarCross Ref
- {Hecht 1977} Matthew S. Hecht, Flow analysis of computer programs, Elsevier Science Inc., New York, USA, 1977.]] Google ScholarDigital Library
- {Heimdahl 1997} Mats P. E. Heimdahl and Michael W. Whalen, Reduction and slicing of hierarchical state machines, Proceedings of the 6th European Software Engineering Conference (ESEC/FSF 97), pp. 450--467, 1997.]] Google ScholarDigital Library
- {Heintze 2001a} Nevin Heintze and Olivier Tardieu, Demand-driven pointer analysis, Proceedings of the ACM SIGPLAN 2001 Conference on Programming Language Design and Implementation, pp. 20--22, Jun. 2001.]] Google ScholarDigital Library
- {Heintze 2001b} Nevin Heintze and Olivier Tardieu, Ultra-fast aliasing analysis using CLA: a million lines of C code in a second, Proceedings of the SIGPLAN Conference on Programming Language Design and Implementation, pp. 254--263, Jun. 2001.]] Google ScholarDigital Library
- {Henrard 1998} Jean Henrard, Vincent Englebert, Jean-Marc Hick, Didier Roland, Jean-Luc Hainaut, Program understanding in databases reverse engineering, Proceedings of the 9th International Conference on Databases and Expert Systems Applications (DEXA '98). Vienna, Springer-Verlag, pp. 70--79, Jun. 1998.]] Google ScholarDigital Library
- {Hendren 1992} Laurie J. Hendren, Joseph Hummell and Alexandru Nicolau, Abstractions for recursive pointer data structures: improving the analysis and transformation of imperative programs, Proceedings of the ACM SIGPLAN 1992 conference on Programming language design and implementation, July 1992.]] Google ScholarDigital Library
- {Hierons 1999} Robert M. Hierons, Mark Harman and Sebastian Danicic, Using program slicing to assist in the detection of equivalent mutants, Journal of Software Testing, Verification and Reliability, 9(4), pp.233--262, Dec. 1999.]]Google ScholarCross Ref
- {Hierons 2000} Robert M. Hierons and Mark Harman, Program analysis and test hypotheses complement, IEEE ICSE International Workshop on Automated Program Analysis, Testing and Verification, Limerick, Ireland, Jun. 2000.]]Google Scholar
- {Hierons 2002} Robert Mark Hierons, Mark Harman, Chris Fox, Laheen Ouarbya and Mohammed Daoudi, Conditioned slicing supports partition testing, Software Testing, Verification and Reliability, 12(1), pp. 23--28, Mar. 2002.]]Google ScholarCross Ref
- {Hind 1999} Michael Hind, Michael Burke, Paul Carini, and Jong-Deok Choi, Interprocedural pointer alias analysis, ACM Transaction on Programming Languages and Systems, 21(4), pp. 848--894, May 1999.]] Google ScholarDigital Library
- {Hind 2000} Michael Hind and Anthony Pioli, Which pointer analysis should I use?, Proceedings of the ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA), 2000.]] Google ScholarDigital Library
- {Hind 2001a} Michael Hind, Pointer analysis: haven't we solved this problem yet?, In Program Analysis for Software Tools and Engineering (PASTE'01), ACM, Snowbird, Utah, USA, Jun. 2001.]] Google ScholarDigital Library
- {Hind 2001b} Michael Hind and Anthony Pioli, Evaluating the effectiveness of pointer alias analyses, Science of Computer Programming, 39(1), pp. 31--55, Jan. 2001.]] Google ScholarDigital Library
- {Hisley 2002} Dixie Hisley, Matt Bridges, and Lori Pollock, Static Interprocedural slicing of shared memory parallel programs, International Conference on Parallel and Distributed Processing Techniques and Applications, (PDPTA'02), pp. 658--664, Jun. 2002.]] Google ScholarDigital Library
- {Hoffner 1995a} Tommy Hoffner, Mariam Kamkar and Peter Fritzson, Evaluation of program slicing tools, In 2nd International Workshop on Automated and Algorithmic Debugging, pp. 51--69, 1995.]]Google Scholar
- {Hoffner 1995b} Tommy Hoffner, Evaluation and Comparison of Program Slicing Tool, Technical Report, LiTH-IDA-R-95--01, Department of Computer and Information Science, Linkping University, Sweden, 1995.]]Google Scholar
- {Horwitz 1988a} Susan Horwitz, Jan Prins, and Thomas Reps, On the adequacy of program dependence graphs for representing programs, Conference Record of the Fifteenth Annual ACM Symposium on Principles of Programming Language, ACM, pp. 146--157, 1988.]] Google ScholarDigital Library
- {Horwitz 1988b} Susan Horwitz, Tomas Reps, and David Binkley, Interprocedural slicing using dependence graphs, Proceedings of the SIGPLAN 88 Conference on Programming Language Design and Implementation, (Atlanta, GA), ACM SIGPLAN Notices 23(7), pp. 35--46, July 1988.]] Google ScholarDigital Library
- {Horwitz 1988c} Susan Horwitz, Jan Prins, and Thomas Reps, Support for integrating program variants in an environment for programming in the large, Proceedings of the International Workshop on Software Version and Conjuration Control 88, Grassau, Germany, Jan. 1988.]]Google Scholar
- {Horwitz 1989a} Susan Horwitz, Jan Prins, and Thomas Reps, Integrating non-interfering versions of programs, ACM Transactions on Programming Languages and Systems, 11(3), pp. 345--387, July 1989.]] Google ScholarDigital Library
- {Horwitz 1989b}. Susan Horwitz, Identifying the semantic and textual differences between two versions of a program, Proceedings of the ACM SIGPLAN 90 Conference on Programming Language Design and Implementation, (White Plains, NY, Jun. 1990), ACM SIGPLAN Notices 25(6) pp. 234--245, Jun. 1989.]] Google ScholarDigital Library
- {Horwitz 1989c} Susan Horwitz, Phil Pfeiffer and Thomas Reps, Dependence analysis for pointer variables, Proceedings of the SIGPLAN Conference on Programming Language Design and Implementation, pp. 28--40, Jun. 1989.]] Google ScholarDigital Library
- {Horwitz 1990} Susan Horwitz, Thomas Reps, and David Binkley, Interprocedural slicing using dependency graphs, ACM Transaction on Programming Languages and Systems, 22(1), pp. 26--60, Jan. 1990.]] Google ScholarDigital Library
- {Horwitz 1991} Susan Horwitz and Thomas Reps, Efficient comparison of program slices, Acta Informatica 28(9), pp. 713--732, 1991.]] Google ScholarDigital Library
- {Horwitz 1995} Susan Horwitz, Tomas Reps and Mooly Sagiv, Demand interprocedural dataflow analysis, Proceeding of the 3rd ACM SIGSOFT Symposium on the Foundations of Software Engineering, pp. 104--115, Oct. 1995.]] Google ScholarDigital Library
- {Hwang 1988a} J. C. Hwang, M. W. Du and C. R. Chou, Finding program slices for recursive procedures, Proceedings of the 12th Annual International Computer Software and Applications Conference (Chicago, 1988).]]Google Scholar
- {Hwang 1988b} J. C. Hwang, M. W. Du and C. R. Chou, The influence of language semantics on program slices, Proceedings of the 1988 International Conference on Computer Languages, Miami Beach, 1988.]]Google Scholar
- {Hu 2004} Lin Hu, Mark Harman, Robert M. Hieron and David Binkley, Loop Squashing Transformations for Amorphous Slicing, Proceedings of the IEEE Eleventh Working conference on Reverse Engineering, Nov. 2004.]] Google ScholarDigital Library
- {Huang 1996} H. Huang, Wei-Tek Tsai and Satish Subramanian, Generalized Program Slicing for Software Maintenance, Proceedings of Software Engineering and Knowledge Engineering, pp. 261--268, 1996.]]Google Scholar
- {Huynh 1997} D. T. Huynh, Y. Song, Forward dynamic slicing in the presence of structured jump statements, Proceedings of ISACC'97, pp. 73--81, 1997.]]Google Scholar
- {Ishio 2003} Takashi Ishio, Shinji Kusumoto and Katsuro Inoue, Application of aspect-oriented programming to calculation of program slice, Technical Report, ICSE2003,]]Google Scholar
- {Iwaihara 1996} Mizuho Iwaihara, Masaya Nomura, Shigeru Ichinose and Hiroto Yasuura, Program slicing on vhdl descriptions and its applications, Proceedings of Asian Pacific Conference on Hardware Description Languages (APCHDL), pp. 132--139, 1996.]]Google Scholar
- {Jackson 1994a} Daniel Jackson and Eugene Rollins, A new model of program dependence for reverse engineering, David Wile, editor, Proceedings of the Second ACM SIGSOFT Symposium no Foundation of Software Engineering, volume 19 of ACM SIGSOFT Software Engineering Notes, pp. 2--10, Dec. 1994.]] Google ScholarDigital Library
- {Jackson 1994b} Daniel Jackson and Eugene J. Rollins, Chopping: a generalization of slicing, Technical Report, Carnegie Mellon University, School Computer Science, Number CS-94-169, p. 21, July 1994.]] Google ScholarDigital Library
- {Jackson 1994c} Daniel Jackson and Eugene J. Rollins, Abstraction mechanisms for pictorial slicing, Proceedings of the IEEE Workshop on Program Comprehension, pp. 82--88, 1994.]]Google Scholar
- {Jiang 1991} J. Jiang, X. Zhou, and D. J. Robson, Program slicing for C - the problems in implementation, Proceedings of the Conference on Software Maintenance, pp. 182--190, 1991.]]Google Scholar
- {Joiner 1993} J. K. Joiner and W. T. Tsai, Ripple effect analysis, program slicing, and dependence analysis, Technical Report, TR number: TR 93-84, Department of Computer Science University of Minnesta Minneapolis.]]Google Scholar
- {Jones 1981} N. D. Jones and S. S. Muchnick, Flow analysis and optimization of LISP-like structures, In S. S. Muchnick and N. D. Jones, editors, Program Flow Analysis, chapter 4, pp. 102--131, Prentice-Hall, 1981.]]Google Scholar
- {Kamkar 1991} Mariam Kamkar, An overview and comparative classification of static and dynamic program slicing, Technical Report LiTH-IDA-R-91-19, Linkoping University, Linkoping, 1991, to appear in Journal of System and Software.]] Google ScholarDigital Library
- {Kamkar 1992} Mariam Kamkar, Nahid Shahmehri and Peter Fritzson, Interprocedural dynamic slicing, Proceedings of the 4th International Symposium on Programming Language Implementation and Logic Programming, LNCS 631, Springer-Verlag, Aug. 1992.]] Google ScholarDigital Library
- {Kamkar 1993a} Mariam Kamkar, Interprocedural dynamic slicing with applications to debugging and testing, PhD thesis, Linkoping University, Sweden, 1993.]]Google Scholar
- {Kamkar 1993b} Mariam Kamkar, Peter Fritzson and Nahid Shahmehri, Three approaches to interprocedural dynamic slicing, Microprocessing and Microprogramming, 38, pp. 625--636, 1993.]] Google ScholarDigital Library
- {Kamkar 1993c} Mariam Kamkar, Peter Fritzson and Nahid Shahmehri, Interprocedural dynamic slicing applied to interprocedural data flow testing, Proceedings of the Conference on Software Maintenance, Montreal, Canada, pp. 386--395, 1993.]] Google ScholarDigital Library
- {Kamkar 1995a} Mariam Kamkar and Patrik Krajina, Dynamic slicing of distributed programs, Proceedings of the International Conference on Software Maintenance, pp. 222--231, Oct. 1995.]] Google ScholarDigital Library
- {Kamkar 1995b} Mariam Kamkar. An overview and comparative classification of program slicing techniques, Journal Systems Software, 31, pp. 197--214, 1995.]] Google ScholarDigital Library
- {Karmkar 1996} Mariam Karmkar, Patrik Krajina and Peter Frizson, Dynamic slicing of parallel message passing programs, 4th Euromicro Workshop on Parallel and Distributed Processing (PDP '96), PORTUGAL, pp. 170--179, Jan. 1996.]] Google ScholarDigital Library
- {Kamkar 1998} Mariam Kamkar, Application of program slicing in algorithmic debugging, Information and Software Technology, 40(11-12), pp. 635--646, Nov. 1998.]]Google Scholar
- {Kang 1996} Byung-Kyoo Kang and James M. Bieman, Designlevel cohesion measures: Derivation, comparison, and applications, Colorado State University, Technical Report CS-96-104, Jan. 1996.]]Google Scholar
- {Kang 1998} Byung-Kyoo Kang and James M. Bieman, Using design abstractions to visualize, quantify, and restructure software, Journal of Systems and Software, 2(2), pp. 175--187, 1998.]] Google ScholarDigital Library
- {Karstu 1994} Sakari Karstu, An examination of the behavior of the slice based cohesion measures, Master's thesis, Department of Computer Science, Michigan Technological University, 1994.]]Google Scholar
- {Kennedy 1981} Ken Kennedy, A survey of data flow analysis techniques, Steven S. Muchnick and Neil D. Jones, editors, Program Flow analysis: Theory and Applications. Prentice-Hall, Englewood Cliffs, New Jersey, 1981.]]Google Scholar
- {Kim 1994} Hyeon-Soo Kim and Yong-Rae Kwon, Restructuring programs through program slicing, International Journal of Software Engineering and Knowledge Engineering, 4(3), pp. 349--368, 1994.]]Google ScholarCross Ref
- {Kim 1999a} Taeho H. Kim, Yeong-Tae Song, Lawrence Chung and Dung T. Huynh, Software architecture analysis using dynamic slicing, Proceedings of AoM/IAoM CS'99, 17(2), pp. 242--247, Aug. 1999.]]Google Scholar
- {Kim 1999b} Taeho H. Kim, Yeong-Tae Song, Lawrence Chung and Dung T. Huynh, Dynamic software architecture slicing, Proceedings of the 23rd IEEE Annual International Computer Software and Applications Conference, Oct. 1999.]] Google ScholarDigital Library
- {Kim 2000} Taeho Kim, Yeong-Tae Song, Lawrence Chung, Dung T. Huynh, Software architecture analysis: a dynamic slicing approach. ACIS International Journal of Computer & Information Science, 1(2), pp. 91--103, Mar. 2000.]] Google ScholarDigital Library
- {Kiss 2003} Ákos Kiss, Judit Jász, Gábor Lehotai and Tibor Gymóthy, Interprocedural static slicing of binary executables, Proceedings of the 3rd IEEE International Workshop on Source Code Analysis and Manipulation (SCAM 2003), Amsterdam, The Netherlands, pp. 118--127, Sep. 2003.]]Google Scholar
- {Knuth 1974} Donald Knuth, Structured programming with goto statements, Computing Surveys, pp. 261--302, Dec. 1974.]] Google ScholarDigital Library
- {Komondoor 2001} Raghavan Komondoor and Susan Horwitz, Using slicing to identify duplication in source code, Lecture Notes in Computer Science, 2126, p. 40, 2001.]] Google ScholarDigital Library
- {Korel 1988a} Bogdan Korel and Janusz Laski, STAD - a system for testing and debugging: user perspective, Proceedings of the Second Workshop on Software Testing, Verification and Analysis, pp. 13--20, July 1988.]]Google Scholar
- {Korel 1988b} Bogdan Korel and Janusz Laski, Dynamic program slicing, Information Processing Letters, 29(3), pp. 155--163, 1988.]] Google ScholarDigital Library
- {Korel 1990} Bogdan Korel and Janusz Laski, Dynamic slicing of computer programs, The Journal of Systems and Software, 13(3), pp. 187--195, 1990.]] Google ScholarDigital Library
- {Korel 1992} Bogdan Korel and Roger Ferguson, Dynamic slicing of distributed programs, Applied Mathematics and Computer Science Journal, 2(2), pp. 199--215, 1992.]]Google Scholar
- {Korel 1994} Bogdan Korel and Satish Yalamanchili, Forward computation of dynamic Program slices, Proceedings of the 1994 International Symposium on Software Testing and Analysis, pp 66--79, 1994.]] Google ScholarDigital Library
- {Korel 1995} Bogdan Korel, Computation of dynamic slices for programs with arbitrary control-flow, Second International Workshop on Automated and Algorithmic Debugging, St. Malo, France, 1995.]]Google Scholar
- {Korel 1997a} Bogdan Korel, Computation of dynamic slices for unstructured programs, IEEE Transactions on Software Engineering, 23(1), pp. 17--34, 1997.]] Google ScholarDigital Library
- {Korel 1997b} Bogdan Korel, Application of dynamic slicing in program debugging, Third International Workshop on Automated Debugging, pp. 59--74, 1997.]]Google Scholar
- {Korel 1997c} Bogdan Korel and Juergen Rilling, Dynamic program slicing in understanding of program execution, Proceedings of 5th International Workshop on Program Comprehension (WPC '97), pp 80--90, 1997.]] Google ScholarDigital Library
- {Korel 1998a} Bogdan Korel and Jurgen Rilling, Dynamic program slicing methods, Information and Software Technology, 40(11--12), pp. 647--659, 1998.]]Google Scholar
- {Korel 1998b} Bogdan Korel and Juergen Rilling, Program slicing in understanding of large program, Proceedings of 6th IEEE International Workshop on Program Comprehension (IWPC'98), pp. 145--152, 1998.]] Google ScholarDigital Library
- {Kovács 1996} Gyula Kovács, Ferenc Magyar, and Tibor Gyimóthy, Static slicing of java programs, Technical Report TR-96-108, József Attila University, Hungary, 1996.]]Google Scholar
- {Krinke 1998a} Jens Krinke and Gregor Snelting, Program slicing, Information and Software Technology, 40(11--12), pp. 661--676, Nov. 1998.]]Google Scholar
- {Krinke 1998b} Jens Krinke, Static slicing of threaded programs, ACM SIGPLAN Notices, 33(7), pp. 35--42, 1998.]] Google ScholarDigital Library
- {Krinke 1998c} Jens Krinke and Gregor Snelting, Validation of measurement software as an application of slicing and constraint solving, Information and Software Technology, 40(11--12), pp. 661--675, Dec. 1998.]]Google Scholar
- {Krinke 2002} Jens Krinke, Evaluating context-sensitive slicing and chopping, Proceedings of the International Conference on Software Maintenance (ICSM'02), pp. 22--31, Oct. 2002.]] Google ScholarDigital Library
- {Krinke 2003a} Jens Krinke, Context sensitive slicing of concurrent programs, ACM SIGSOFT Software Engineering Notes, 2003.]] Google ScholarDigital Library
- {Krinke 2003b} Jens Krinke, Barrier slicing and chopping, Proceedings of 3rd IEEE International Workshop on Source Code Analysis and Manipulation (SCAM 2003), Amsterdam, Netherlands, pp. 81--87, Sep. 2003.]]Google Scholar
- {Krinke 2004a} Jens Krinke, Slicing, Chopping and path conditions with barriers, Software Quality Journal 12(4), pp. 339--360, December 2004.]] Google ScholarDigital Library
- {Krinke 2004b} Jens Krinke. Context-sensitivity matters, but context does not, Fourth IEEE International Workshop on Source Code Analysis and Manipulation (SCAM 2004), Chicago, Sep. 2004.]] Google ScholarDigital Library
- {Krinke 2004c} Jens Krinke, Visualization of program dependence and slices, Proceedings of International Conference on Software Maintenance (ICSM 2004), Chicago, Sep. 2004.]] Google ScholarDigital Library
- {Krishnaswamy 1994} Anand Krishnaswamy, Program slicing: an application of object-oriented program dependency graphs, Technical Report, TR94-108, Department of Computer Science, Clemson University, 1994.]]Google Scholar
- {Kuck 1981} David J. Kuck, R. H. Kuhn, David A. Padua, B. Leasure, and Michael Wolfe, Dependence graphs and compiler optimizations, Conference Record of the Eighth ACM Symposium on Principles of Programming Languages, pp. 207--218, 1981.]] Google ScholarDigital Library
- {Kumar 2001} Sumit Kumar and Susan Horwitz, Better slicing of programs with jumps and switches. Technical Report TR-1429, Computer Sciences, University of Wisconsin-Madison, 2001.]]Google Scholar
- {Kumar 2002} Sumit Kumar and Susan Horwitz, Better slicing of programs with jumps and switches, University of Wisconsin and GrammaTech, Inc. FASE, pp. 96--112, 2002.]] Google ScholarDigital Library
- {Kuhn 1995} Bradley M. Kuhn, Dennis J. Smith and Keith B. Gallagher, The decomposition slice display system, Proceedings of the 1995. Conference on Software Engineering and Knowledge Engineering SEKE'95, Jun. 1995.]]Google Scholar
- {Kusumoto 2002} Shinji Kusumoto, Akira Nishimatsu, Keisuke Nishie and Katsuro Inoue, Experimental evaluation of program slicing for fault location, Empirical Software Engineering, 7, pp. 49--76, 2002.]] Google ScholarDigital Library
- {Lakhotia 1991} Arun Lakhotia, Graph theoretic foundations of program slicing and integration, Report CACS TR-91-5-5, University of Southwestern Louisiana, 1991.]]Google Scholar
- {Lakhotia 1992} Arun Lakhotia, Improved interprocedural slicing algorithm. Technical Report CACS TR-92-5-8, The Center for Advanced Computer Studies, University of Southwestern Louisian, Lafayette, LA 70504, 1992.]]Google Scholar
- {Lakhotia 1993a} Arun Lakhotia, Constructing call multigraphs using depedence graphs, Conference Record of the Twentieth ACM Symposium on Principles of Programming Languages (Charleston, SC, 1993), pp. 273--284, 1993.]] Google ScholarDigital Library
- {Lakhotia 1993b} Arun Lakhotia, Rule-based approach to computing module cohesion, Proceedings of the 15th Conference on Software Engineering (ICSE-15), pp. 34--44, 1993.]] Google ScholarDigital Library
- {Lakhotia 1998} Arun Lakhotia and Jean-Christophe Deprez, Restructuring programs by tucking statements into functions, Information and Software Technology, 40(11/12), pp. 677--691, 1998.]]Google Scholar
- {Lakhotia 1999} Arun Lakhotia, Jean-Christophe Deprez and Shreyash S. Kame, Flow analysis models for interprocedural program slicing algorithms, Technical Report TR-99-5-1, University of Southwestern Louisiana, July 1999.]]Google Scholar
- {Lanubile 1997} Filippo Lanubile and Giuseppe Visaggio, Extracting resuable functions by flow graph-based program slicing, IEEE Transactions on Software Engingneering, 23(4), pp. 246--259, 1997.]] Google ScholarDigital Library
- {Landi 1990} William Landi and Barbara G. Ryder, Pointer-induced aliasing: a problem classification, Proceedings of the Seventeenth Annual ACM Symposium on Principles of Programming Language, pp. 93--103, Jan. 1990.]] Google ScholarDigital Library
- {Landi 1992a} William Landi, Undecidability of static analysis, ACM Letters on Programming Languages and Systems, 1(4), pp. 323--337, Dec. 1992.]] Google ScholarDigital Library
- {Landi 1992b} William Landi, Interprocedural aliasing in the presence of pointers, PhD thesis, Rutgers University, 1991.]] Google ScholarDigital Library
- {Landi 1992c} William Landi and Barbara G. Ryder, A safe approximate algorithm for interprocedural aliasing, ACM SIGPLAN Notices, July 1992.]] Google ScholarDigital Library
- {Landi 1993} William Landi, Barbara G. Ryder, and Sean Zhang, Interprocedural modification side effect analysis with pointer aliasing, Proceedings of the SIGPLAN '93 Conference on Programming Language Design and Implementation, pp. 56--67, Jun. 1993.]] Google ScholarDigital Library
- {Lange 2001} Carola Lange, Program slicing and slicing book technology, ARTI 8800, Spring 2001.]]Google Scholar
- {Larsen 1996} Loren Larsen and Mary Jean Harrold, Slicing Object-Oriented software, International Conference on Software Engineering Proceedings of the 18th international conference on Software engineering, Berlin, Germany, pp. 495--505, 1996.]] Google ScholarDigital Library
- {Larus 1993} James R. Larus and Satish Chandra, Using tracing and dynamic slicing to tune compilers, Technical Report CS-TR-93-1174, University of Wisconsin-Madison, Aug. 1993.]]Google Scholar
- {Laski 1989} Janusz Laski, Data flow testing in stad, The Journal of Systems and Software, 1989.]] Google ScholarDigital Library
- {Laski 1991a} Janusz Laski, A data flow based algorithm for the derivation of program slices, Technical Report TR-CSE-10-1, Oakland University, 1991.]]Google Scholar
- {Laski 1991b} Janusz Laski and Wojciech Szermer, Reachability slicing in software reliability studies, Technical Report TR-CSE-91-12-1, Oakland University, 1991.]]Google Scholar
- {Law 1994} R. C. H. Law, Object-Oriented program slicing, PhD Thesis, University of Regina, Regina, Canada, 1994.]] Google ScholarDigital Library
- {Lee 2001} Wan Kwon Lee, In Sang Chung, Gwang Sik Yoon and Yong Rae Kwon, Specification-based program slicing and its applications, Journal of Systems Architecture: the EUROMICRO Journal, 47(5), pp. 427--443, 2001.]] Google ScholarDigital Library
- {Leminen 1994} Janne A. Leminen, Slicing and slice based measures for the assessment of functional cohesion of z operation schemas, Master's thesis, Department of computer Science, Michigan Technological University, 1994.]]Google Scholar
- {Lengauer 1979} Thomas Lengauer and Robert Endre Tarjan, A fast algorithm for finding dominators in a flowgraph, In ACM Transactions on Programming Languages and Systems, 1(1), July 1979.]] Google ScholarDigital Library
- {Leung 1987} Hareton K. N. Leung and Hassan K. Reghbati, Comments on program slicing, IEEE Transactions on Software Engineering SE-13, 12, pp. 1370--1371, 1987.]] Google ScholarDigital Library
- {Li 1990} Z. Li, P. Yew and C. Zhu, An efficient data dependence analysis for parallelizing compilers, IEEE Transactions on Parallel and Distributed Systems, 1(1), pp. 26--34. Jan. 1990.]] Google ScholarDigital Library
- {Li 2000} Bixin Li, Program slicing techniques and its application in object-oriented software metrics and software test, PhD thesis, Nanjing University, P. R. China. Dec. 2000.]]Google Scholar
- {Li 2001a} Bixin Li, A hierarchical slice-based framework for object-oriented coupling measurement, Turku Centre for Computer Science, TUCS Technical Reports, No.415, Turku, Finland, July 2001.]]Google Scholar
- {Li 2001b} Bixin Li and Xiaocong Fan, JATO: Slicing Java programs hierarchically, TUCS Technical Report, No 416, Turku, Finland, 2001.]]Google Scholar
- {Li 2002} Bixin Li, Analyzing information-flow in Java program based on program slicing technique, Software Engineering Notes, 27(5), pp. 98--103, 2002.]] Google ScholarDigital Library
- {Li 2003a} Bixin Li, Managing dependencies in component-based systems based on matrix model, Proceedings Of Net.Object.Days 2003, pp. 22--25, Sept. 2003.]]Google Scholar
- {Li 2003b} Bixin Li, A technique to analyze information-flow in object-oriented programs, Information and Software Technology, Elsevier science, 45(6), pp. 305--314, 2003.]]Google Scholar
- {Li 2004a} Bixin Li, SSA: A core algorithm to slice programs, to appear in International Journal of Information and Computational Science (JOICS), Binary Information Press, USA, 2004.]]Google Scholar
- {Li 2004b} Bixin Li, Xiaocong Fan, Jun Pang and Jianjun Zhao, A model for slicing Java programs hierarchically, Journal of Computer Science & Technology, 19(6), 2004.]] Google ScholarDigital Library
- {Li 2004c} Bixin Li and Ying Zhou, Measuring and validating a kind of object-oriented software coupling, to appear in Proceedings of Info2004, Tokyo, Japan.]]Google Scholar
- {Li 2004d} Hon F. Li, Juergen Rilling and Dhrubajyoti Goswami, Granularity-driven dynamic predicate slicing algorithms for message passing systems, Automated Software Engineering Journal, Kluwer Academic Publishers, 11(1), pp. 63--89, Jan. 2004.]] Google ScholarDigital Library
- {Liang 1998} Donglin Liang and Mary Jean Harrold, Slicing objects using system dependence graphs, Proceedings of the International Conference on Software Maintenance (ICSM'98), Bethesda, MD, pp. 358--367, Nov. 1998.]] Google ScholarDigital Library
- {Liang 1999a} Donglin Liang and Mary Jean Harrold, Reuse-Driven interprocedural slicing in the presence of pointers and recursion. Proceedings of the International Conference on Software Maintenance (ICSM'99), pp. 421--432, Aug. 1999.]] Google ScholarDigital Library
- {Liang 1999b} Donglin Liang and Mary Jean Harrold, Equivalence analysis: A general technique to improve the efficiency of data-flow analyses in the presence of pointers, Proceedings of the ACM SIGPLAN-SIGSOFT workshop on Program Analysis for Software Tools and Engineering '99, Sept. 1999.]] Google ScholarDigital Library
- {Liang 1999c} Donglin Liang and Mary Jean Harrold, Efficient points-to analysis for whole-program analysis, Proceedings of the 7th European engineering conference held jointly with the 7th ACM SIGSOFT international symposium on Foundations of software engineering, Oct. 1999.]] Google ScholarDigital Library
- {Liang 2000} Donglin Liang and Mary Jean Harrold, Towards efficient and accurate program analysis using light-weight context recovery, Proceedings of 22nd International Conference on Software Engineering (ICSE'00), pp. 366--375, Jun. 2000.]] Google ScholarDigital Library
- {Liang 2001a} Donglin Liang and Mary Jean Harrold, Efficient computation of parameterized pointer information for interprocedural analyses, Proceedings of 7th International Static Analysis Symposium, July 2001.]] Google ScholarDigital Library
- {Liang 2001b} Donglin Liang, Maikel Pennings and Mary Jean Harrold, Extending and evaluating flow-insensitive and contextinsensitive points-to analyses for Java, Proceedings of the 2001 ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering, Jun. 2001.]] Google ScholarDigital Library
- {Liang 2002} Donglin Liang and Mary Jean Harrold, Equivalence Analysis and Its Application in Improving the Efficiency of Program Slicing, ACM Transactions on Software Engineering and Methodology, 11(3), pp. 347--383, July 2002.]] Google ScholarDigital Library
- {Livadas 1992a} Panos E. Livadas and Stephen Croll, Program slicing, Technical Report SERC-TR-61-F, Computer Science and Information Services Department, University of Florida, Gainesville, FL, Oct. 1992.]]Google Scholar
- {Livadas 1992b} Panos E. Livadas and Prabal K. Roy, Program dependence analysis, Proceedings of the International Conference on Software Maintenance, IEEE Computer Society Press, pp. 356--365, 1992.]]Google Scholar
- {Livadas 1993a} Panos E. Livadas and Scott D. Alden, A toolset for program understanding, Proceedings of the IEEE Second Workshop on Program Comprehension, 1993.]]Google Scholar
- {Livadas 1993b} Panos E. Livadas and Stephen Croll, System dependence graph construction for recursive programs, Proceedings of the Seventeenth International Computer Software and Applications Conference, pp. 414--420, Nov. 1993.]]Google Scholar
- {Livadas 1994a} Panos E. Livadas and Stephen Croll, A new algorithm for the calculation of transitive dependences, Journal of Software Maintenance, 6, pp. 100--127, 1994.]] Google ScholarDigital Library
- {Livadas 1994b} Panos E. Livadas and Stephen Croll. System dependence graphs based on parse trees and their use in software maintenance, Journal of Information Sciences, 76(3--4), pp. 197--232, Feb. 1994.]] Google ScholarDigital Library
- {Livadas 1994c} Panos E. Livadas and Adam Rosenstein, Slicing in the presence of pointer variables, Technical Report SERC-TR-74-F, Computer Science and Information Services Department, University of Florida, Gainesville, FL, June 1994.]]Google Scholar
- {Livadas 1995} Panos E. Livadas and Theodore Johnson, An optimal algorithm for the construction of the system dependence graph, Technical report, Computer and Information Sciences Department, University of Florida, 1995.]]Google Scholar
- {Livadas 1999} Panos E. Livadas and Theodore Johnson, An optimal algorithm for the construction of the system dependence graph, Information Sciences, 125(1--4), pp. 99--131, 2000.]] Google ScholarDigital Library
- {Longworth 1985} Herbert D. Longworth, Slice-based program metrics, Master's thesis, Michigan Technological University, 1985.]]Google Scholar
- {Longworth 1986} Herbert D. Longworth, Linda M. Ott, and M. R. Smith, The relationship between program complexity and slice complexity during debugging tasks, COMPSAC 86, 1986.]]Google Scholar
- {Lu 1988} Lu Qi, Zhang Fubo, and Qian Jiahua, Program slicing, Journal of Computer Science and Technology, 3(1), pp. 29--39, 1988.]]Google ScholarCross Ref
- {Lyle 1984} James R. Lyle, Evaluating variations of program slicing for debugging, PhD thesis, University of Maryland, College Park, Maryland, Dec. 1984.]] Google ScholarDigital Library
- {Lyle 1986} James R. Lyle and Mark Weiser, Experiments on slicing-based debugging tools, Empirical studies of programming, Elliot Soloway (editor), Ablex Publishing, Norwood, New Jersey, Jun. 1986.]] Google ScholarDigital Library
- {Lyle 1987} James R. Lyle and Mark Weiser, Automatic program bug location by program slicing, Proceedings of 2nd International Conference on Computers and Applications, Peking, China, pp. 877--882, 1987.]]Google Scholar
- {Lyle 1993} James R. Lyle and David Binkley, Program slicing in the presence of pointers, Proceedings of the Third Annual Software Engineering Research Forum, Orlando, FL, Nov. 1993.]]Google Scholar
- {Lyle 1995} James R. Lyle, Dolores R. Wallace, James R. Graham, Keith B. Gallagher, Joseph P. Poole, and David W. Binkley, A CASE tool to evaluate functional diversity in high integrity software, IR-5691. U.S. Department of Commerce, Technology Administration, National Institute of Standards and Technology, Computer Systems Laboratory, Gaithersburg, MD, 1995.]]Google Scholar
- {Malloy 1994} Brian A. Malloy, John D. McGregor, Anand Krishnaswamy and Murali Medikonda, An extensible program representation for Object-Oriented software, ACM SIGPLAN Notices, 29(12), pp. 38--47, Dec. 1994.]] Google ScholarDigital Library
- {Marlowe 1993} Thomas Marlowe, William Landi, Barbara Ryder, Jong-Deok Choi, Michael Burke and Paul Carini, Pointer-induced aliasing: a clarification, In SIGPLAN Notices, 28(9), pp. 67--70, Sep. 1993.]] Google ScholarDigital Library
- {Maydan 1991} Dror E. Maydan, John L. Hennessy and Monica S. Lam, Efficient and exact data dependence analysis, Proceedings of the ACM SIGPLAN'91 Conference on Programming Language Design and Implementation, SIGPLAN Notices 26(6), pp. 1--14, 1991.]] Google ScholarDigital Library
- {Meyers 2004a} Timothy M. Meyers, David Binkley, A Longitudinal and Comparative Study of Slice-Based Metrics, Proceedings of the 10th International Software Metrics Symposium, Chicago, USA, pp. 14--16, Sep. 2004.]]Google Scholar
- {Meyers 2004b} Timothy M. Meyers, David Binkley, Slice-Based Cohesion Metrics and Software Intervention, Proceedings of the IEEE Eleventh Working conference on Reverse Engineering, Delft University, Netherlands, Nov. 2004.]] Google ScholarDigital Library
- {Milanova 2004} Ana Milanova, Atanas Rountev and Barbara G. Ryder, Precise call graphs for C programs with function pointers, Automated Software Engineering, 11(1), pp. 7--26, Jan. 2004.]] Google ScholarDigital Library
- {Miller 1988} Barton P. Miller, Jong-Deok Choi, A mechanism for efficient debugging of parallel programs, Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation, pp. 135--144, 1988, ACM SIGPLAN Notices 23(7).]] Google ScholarDigital Library
- {Millett 1998} Lynette I. Millett and Tim Teitelbaum, Slicing promela and its applications to model checking, Proceedings of the 4th International SPIN Workshop, 1998]]Google Scholar
- {Millett 2000} Lynette I. Millett and Tim Teitelbaum, Issues in slicing promela and its applications to model checking, protocol understanding, and simulation, International Journal on Software Tools for Technology Transfer, 2(4), pp. 343--349, 2000.]]Google ScholarCross Ref
- {Mittal 2001} Neeraj Mittal and Vijay K. Garg, Computation slicing: techniques and theory, Proceedings of the 15th International Symposium on Distributed Computing (DISC), Lisbon, Portugal, pp. 78--92, Oct. 2001.]] Google ScholarDigital Library
- {Mittal 2003} Neeraj Mittal, Vijay K. Garg, Software fault tolerance of distributed programs using computation slicing, Proceedings of the 23rd International Conference on Distributed Computing Systems, p. 105, May 2003.]] Google ScholarDigital Library
- {Mock 2001} Markus Mock, Manuvir Das, Craig Chambers and Susan J. Eggers, Dynamic points-to sets: a comparison with static analyses and potential applications in program understanding and optimization, Proceedings of the 2001 ACM SIGPLAN-SIGSOFT Workshop on Program Analysis for Software Tools and Engineering, Snowbird, UT, USA, pp. 66--72, Jun. 2001.]] Google ScholarDigital Library
- {Mock 2002} Markus Mock, Darren C. Atkinson, Craig Chambers and Susan J. Eggers, Improving program slicing with dynamic points-to data, ACM SIGSOFT Software Engineering Notes, 27(6), pp. 71--80, Nov. 2002.]] Google ScholarDigital Library
- {Moretti 2001} Eric Moretti, Gills Chanteperdrix, and Angel Osorio, New algorithms for control-flow graph structuring, Fifth European Conference on Software Maintenance and Reengineering, Lisbon, Portugal, pp. 184, Mar. 2001.]] Google ScholarDigital Library
- {Müller-Olm 2001} Markus Müller-Olm and Helmut Seidl, On optimal slicing of parallel programs, STOC 2001 (33rd ACM Symposium on Theory of Computing), pp. 647--656, 2001.]] Google ScholarDigital Library
- {Müller-Olm 2004} Markus Müller-Olm, Precise interprocedural dependence analysis of parallel programs, Theoretical Computer Science, 311(1--3), pp. 325--388, Jan. 2004.]] Google ScholarDigital Library
- {Mund 2002} G. B. Mund, Rajib Mall and Sudeshna Sarkar, An efficient dynamic program slicing technique, Information and Software Technology, 44(2), pp. 123--132, Feb. 2002.]]Google ScholarCross Ref
- {Mund 2003} G. B. Mund, Rajib Mall and Sudeshna Sarkar, Computation of intraprocedural dynamic program slices, Information and Software Technology, 45(8), pp. 499--512, Jun. 2003.]]Google ScholarCross Ref
- {Nanda 2000} Mangala Gowri Nanda and S. Ramesh, Slicing concurrent programs, Software Engineering Notes, 25(5), pp. 180--190, 2000.]] Google ScholarDigital Library
- {Naumovich 1998} Gleb Naumovich and George S. Avrunin, A conservative dataflow algorithm for detecting all pairs of statements that may happen in parallel, Proceedings of the 6th International Symposium on the Foundations of Software Engineering, pp. 24--34, 1998.]] Google ScholarDigital Library
- {Naumovich 1999} Gleb Naumovich, George S. Avrunin and Lori A. Clarke, An efficient algorithm for computing MHP information for concurrent Java programs, ESEC/FSE '99, pp. 338--354, 1999.]] Google ScholarDigital Library
- {Netzer 1994} Robert H. B. Netzer and Mark H. Weaver, Optimal tracing and incremental re-execution for debugging long-running programs, Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, New York, pp. 313--325, Jun. 1994.]] Google ScholarDigital Library
- {Nishimatsu 1999} Akira Nishimatsu, Minoru Jihira, Shinji Kusumoto, and Katsuro Inoue, Call-mark slicing: an efficient and economical way of reducing slice, International Conference of Software Engineering, pp. 422--431, 1999.]] Google ScholarDigital Library
- {Ochoa 2004} Claudio Ochoa, Josep Silva and Germán Vidal, Dynamic slicing based on redex trails, PEPM 2004, pp. 123--134, 2004.]] Google ScholarDigital Library
- {Oda 1993} Tomohiro Oda and Keijiro Araki, Specification slicing in formal methods of software development, Proceedings of the 17th Annual International Computer Software and Applications Conference, pp. 313--319, Nov. 1993.]]Google Scholar
- {Ohata 2001} Fumiaki Ohata, Kouya Hirose, Masato Fujii and Katsuro Inoue, A slicing method for object-oriented programs using lightweight dynamic information, Eighth Asia-Pacific Software Engineering Conference (APSEC'01), Macao, China, Dec. 2001.]] Google ScholarDigital Library
- {Orso 2001a} Alessandro Orso, Saurabh Sinha and Mary Jean Harrold, Effects of pointers on data dependences, Proceedings of 9th International Workshop on Program Comprehension (IWPC'01), pp. 39--49, May 2001.]] Google ScholarDigital Library
- {Orso 2001b} Alessandro Orso, Saurabh Sinha and Mary Jean Harrold, Incremental slicing based on data-dependences types. Proceedings of IEEE International Conference on Software Maintenance (ICSM'01), Florence, Italy, pp. 158--167, Nov. 2001.]] Google ScholarDigital Library
- {Orso 2003} Alessandro Orso, Saurabh Sinha and Mary Jean Harrold, Understanding data dependences in the presence of pointers, Technical Report GIT-CERCS-03-10, College of Computing, Georgia Institute of Technology, Atlanta, Ga., May 2003.]]Google Scholar
- {Orso 2004} Alessandro Orso, Saurabh Sinha and Mary Jean Harrold, Classifying data dependences in the presence of pointers for program comprehension, testing, and debugging, ACM Transactions on Software Engineering and Methodology, 13(2), pp. 199--239, 2004.]] Google ScholarDigital Library
- {Ottenstein 1984} Karl J. Ottenstein and Linda M. Ottenstein, The program dependence graph in a software development environment, Proceedings of the ACM SIGSOFT/SIGPLAN Software Engineering Symposium on Practical Software Development Environments, pp. 177--184, Apr. 1984.]] Google ScholarDigital Library
- {Ott 1989} Linda M. Ott and Jeffrey J. Thuss, The relationship between slices and module cohesion, Proceedings of the 11th ACM conference on Software Engineering, pp. 198--204, May 1989.]] Google ScholarDigital Library
- {Ott 1992a} Linda M. Ott and James M. Bieman, Effects of software changes on module cohesion, Proceedings of the Conference on Software Maintenance-1992, pp. 345--353, Nov. 1992.]]Google Scholar
- {Ott 1992b} Linda M. Ott, Using slice profiles and metrics during software maintenance, Proceedings of the 10th Annual Software Reliability Symposium, pp. 16--23, 1992.]]Google Scholar
- {Ott 1993} Linda M. Ott and Jeffrey J. Thuss, Slice based metrics for estimating coliesion, Proceedings of the IEEE-CS International Metrics Symposium, pp. 78--81, 1993.]]Google Scholar
- {Ott 1995} Linda Ott, James M. Bieman, Byung-Kyoo Kang and Bindu Mehra, Developing measures of class cohesion for object-oriented software, Proceeding of 7th Annual Oregon Workshop on Software Metrics (AOWSM'95), Jun. 1995.]]Google Scholar
- {Ott 1998} Linda M. Ott and James M. Bieman, Program slices as an abstraction for cohesion measurement, Information and Software Technology, 40(11--12), pp. 691--700, Nov. 1998.]]Google Scholar
- {Ouarbya 2002} Lahcen Ouarbya, Sebastian Danicic, Dave (Mohammed) Daoudi, Mark Harman and Chris Fox, A denotational interprocedural program slicer, Proceedings of IEEE Working Conference on Reverse Engineering (WCRE 2002), Richmond, Virginia, USA, pp. 181--189, 2002.]] Google ScholarDigital Library
- {Peterson 1973} W. W. Peterson, T. Kasami, and N. Tokura, On the capabilities of while, repeat and exit statements, Comm. of the ACM, 16(8), pp. 503--512, 1973.]] Google ScholarDigital Library
- {Petersen 1992} Paul M. Petersen and David A. Padua, Dynamic dependence analysis: A novel method for data dependence evaluation, Conference Record of the 5th Workshop on Languages and Compilers for Parallel Computing, Yale University, Department of Computer Science, YALEU/DCS/RR915, Aug. 1992]] Google ScholarDigital Library
- {Plakal 2000} Manoj Plakal and Charles N. Fischer, Concurrent garbage collection using program slices on multithreaded processors, Proceedings of the International Symposium on Memory Management (ISMM), 36(1), pp. 94--100, Oct. 2000.]] Google ScholarDigital Library
- {Pratt 1977} V. R. Pratt, Two easy theories whose combination is hard, Technical Report, Mass Institute of Technology, Sep. 1977.]]Google Scholar
- {Pugh 1992} William Pugh and David Wonnacott, Eliminating false data dependences using the omega test, Proceedings of the ACM SIGPLAN 92 Conference on Programming Language Design and Implementation, pp. 140--151, 1992.]] Google ScholarDigital Library
- {Qi 2004} Xiaofang Qi and Baowen Xu, Dependence Analysis of Concurrent Programs Based on Reachability Graph and Its Applications, International Conference on Computational Science, pp. 405--408, 2004.]]Google Scholar
- {Ramalingam 2000} G. Ramalingam, Context-sensitive synchronization-sensitive analysis is undecidable, ACM TOPLAS, 22(2), pp. 416--430, 2000.]] Google ScholarDigital Library
- {Ranganath 2004} Venkatesh Prasad Ranganath and John Hatcliff, Pruning interference and ready dependence for slicing concurrent Java programs, Proceedings of 13th International Conference on Compiler Construction (CC 2004), pp. 9--56, 2004.]]Google Scholar
- {Reps 1988a} Thomas Reps and Wuu Yang, The semantics of program slicing, Technical Report 777, University of Wisconsin - Madison, Jun. 1988.]]Google Scholar
- {Reps 1988b} Thomas Reps and Susan Horwitz, Semantics-based program integration, In Proceedings of the Second European Symposium on Programming, (ESOP '88), Nancy, France, pp. 133--145, Mar. 1988.]] Google ScholarDigital Library
- {Reps 1989a} Thomas Reps and Wuu Yang, The semantics of program slicing and program integration, In Proceedings of the Colloquium on Current Issues in Programming Languages, 352 of Lecture Notes in Computer Science, pp. 360--374, Springer 1989.]] Google ScholarDigital Library
- {Reps 1989b} Thomas Reps and Thomas Bricker, Semantics-based program integration: illustrating interference in interfering versions of programs, Proceedings of the Second International Workshop on Software Configuration Management, Princeton, New Jersey, pp. 46--55, Oct. 1989.]] Google ScholarDigital Library
- {Reps 1993} Tomas Reps, The Wisconsin program-integration system reference manual: Release 2.0, Technical Report Unpublished report University of Wisconsin, Madison, WI, July 1993.]]Google Scholar
- {Reps 1994a} Thomas Reps. Demand interprocedural program analysis using logic databases, Kluwer Academic Publishers, pp. 163--196, 1994.]]Google Scholar
- {Reps 1994b} Thomas Reps, Solving demand versions of interprocedural analysis problems, Proceedings of the 5th International Conference on Compiler Construction, Lecture Notes in Computer Science, 786, ed. P. Fritzson, Springer-Verlag, pp. 389--403, 1994.]] Google ScholarDigital Library
- {Reps 1994c} Tomas Reps, Susan Horwitz, Mooly Sagiv and Genevieve Rosay, Speeding up slicing, Proceedings of the 2nd ACM SIGSOFT symposium on Foundations of software engineering, pp. 11--20, Dec. 1994.]] Google ScholarDigital Library
- {Reps 1994d} Tomas Reps, Mooly Sagiv and Susan Horwitz, Interprocedural dataflow analysis via graph reachability, Report DIKU TR 94-14, University of Copenhagen, Copenhagen, 1994]]Google Scholar
- {Reps 1995a} Tomas Reps, Susan Horwitz and Mooly Sagiv, Precise interprocedural dataflow analysis via graph reachability, Proceedings of ACM Symposium on Principles of Programming Languages, pp. 49--61, 1995.]] Google ScholarDigital Library
- {Reps 1995b} Thomas Reps and Genevieve Rosay, Precise interprocedural chopping, Proceedings of the 3rd ACM Symposium on the Foundations of Software Engineering (Washington, DC), Oct. 1995.]] Google ScholarDigital Library
- {Reps 1996a} Thomas Reps, On the sequential nature of interprocedural program-analysis problems, Acta Informatica 33(8), pp. 739--757, 1996.]]Google ScholarCross Ref
- {Reps 1996b} Thomas Reps and Todd Turnidge, Program specialization via program slicing, Proceedings of the Dagstuhl Seminar on Partial Evaluation, Lecture Notes in Computer Science, 1110, pp. 409--429, 1996.]] Google ScholarDigital Library
- {Reps1998} Thomas Reps, Program analysis via graph reachability, Information and Software Technology, 40(11--12), pp. 701--726, Nov. 1998.]]Google Scholar
- {Ricca 2001} Filippo Ricca and Paolo Tonella, Web application slicing, Proceedings of the IEEE International Conference on Software Maintenance (ICSM'01), pp. 148--157, 2001.]] Google ScholarDigital Library
- {Ricca 2002} Filippo Ricca and Paolo Tonella, Construction of the system dependence graph for web application slicing, Proceedings of 2nd IEEE International Workshop on Source Code Analysis and Manipulation (SCAM'02), pp. 123--132, Oct. 2002.]] Google ScholarDigital Library
- {Richardson 1992} Debra J. Richardson, T. Owen O'Malley, Cynthia Tittle Moore and Stephanie Leif Aha, Developing and integrating PRODAG into the arcadia environment, Proceedings of the Fifth Symposium on Software Development Environments, pp. 109--119, 1992.]] Google ScholarDigital Library
- {Rilling 1998} Juergen Rilling, Investigation of dynamic slicing and its application in program comprehension, PhD Thesis, Illinois Institute of Technology, July 1998.]] Google ScholarDigital Library
- {Rilling 2001} Juergen Rilling and Bhaskar Karanth, A hybrid program slicing framework, IEEE International Workshop on Source Code Analysis and Manipulation (SCAM'01), Florence, Italy, Nov. 2001.]]Google Scholar
- {Rilling 2002} Juergen Rilling, Hon F. Li, Dhrubajyoti Goswami. Predicate-based dynamic slicing of message passing programs, Proceeding of the IEEE International Conference on Software Maintenance (ICSM 2002), Montreal, Canada, pp. 133--142, Oct. 2002.]] Google ScholarDigital Library
- {Rilling 2003} Juergen Rilling and Tuomas Klemola, Identifying comprehension bottlenecks using program slicing and cognitive complexity metrics, Proceeding of 11th IEEE International Workshop on Program Comprehension (IWPC'03), p.115, May 2003.]] Google ScholarDigital Library
- {Robschink 2002} Torsten Robschink, Gregor Snelting, Efficient path conditions in dependence graphs, Proceedings of the 24th international conference on Software engineering, Orlando, Florida, pp. 478--488, 2002.]] Google ScholarDigital Library
- {Ross 1998} John L. Ross and Mooly Sagiv, Building a bridge between pointer aliases and program dependences, Nordic Journal of Computing, 8, pp. 361--386, 1998.]] Google ScholarDigital Library
- {Rothermel 1994} Gregg Rothermel and Mary Jean Harrold, Selecting tests and identifying test coverage requirements for modified software, Proceedings of the ACM SIGSOFT International Symposium on Software Testing and Analysis, pages 169--184, Aug. 1994.]] Google ScholarDigital Library
- {Rothermel 1996} Gregg Rothermel and Mary Jean Harrold, Analyzing regression test selection techniques, IEEE Transactions on Software Engineering, 22(8), pp. 529--551, 1996.]] Google ScholarDigital Library
- {Rountey 2001a} Atanas Rountev, Ana Milanova, and Barbara G. Ryder, Points-to analysis for Java based on annotated constraints, Proceedings of Conference on Object-Oriented Programming Systems, Languages, and Applications, pp. 43--55, Oct. 2001.]] Google ScholarDigital Library
- {Rountey 2001b} Atanas Rountev and Barbara G. Ryder, Points-to and side-effect analyses for programs built with precompiled libraries, Proceedings of the International Conference on Compiler Construction, Apr. 2001.]] Google ScholarDigital Library
- {Ruf 1995} Eric Ruf, Context-insensitive alias analysis reconsidered, Proceedings of the ACM SIGPLAN 1995 conference on Programming language design and implementation, pp. 13--22, Jun. 1995.]] Google ScholarDigital Library
- {Rugina 1999} Radu Rugina and Martin C. Rinard, Pointer analysis for multithreaded programs, Proceedings of the ACM SIGPLAN'99 Conference on Programming Language Design and Implementation, pp. 77--90, May, SIGPLAN Notices, 34(5), May 1999.]] Google ScholarDigital Library
- {Russell 2001} Jeff Russell, Program slicing literature survey, Seminar and Draft Materials, University of Texas at Austin, 2001, http://www.ece.utexas.edu/~jrussell/seminar/slicing_survey.pdf.]]Google Scholar
- {Russell 2002} Jeffry T. Russell, Co-design architecture and synthesis: Program slicing for codesign, Proceedings of the tenth international symposium on Hardware/software codesign, 2002.]] Google ScholarDigital Library
- {Russel 2002} Jeffry Russel, Program slicing for codesign, Proceedings of Tenth International Symposium on Hardware/Software Codesign, 2002.]] Google ScholarDigital Library
- {Samadzadeh 1993} Mansur H. Samadzadeh and Winai Wichaipanitch, An interactive debugging tool for C based on dynamic slicing and dicing, Proceedings of the 21st Annual ACM Conference on Computer Science, pp. 30--37, 1993.]] Google ScholarDigital Library
- {Schoenig 1995} Stéphane Schoenig and Mireille Ducassé, A hybrid backward slicing algorithm producing executable slices for Prolog, Proceedings of the 7th Workshop on Logic Programming Environments, pp. 41--48, Dec. 1995.]]Google Scholar
- {Schoenig 1996} Stephane Schoenig and Mireille Ducasse, A backward slicing algorithm for prolog, In Static Analysis Symposium, pp. 317--331, 1996.]] Google ScholarDigital Library
- {Shahmehri 1991} Nahid Shahmehri, Generalized algorithmic debugging, PhD thesis, Linkoping University, 1991.]]Google Scholar
- {Shapiro 1982} Ehud Y. Shapiro, Algorithmic program debugging, MIT Press, 1982.]] Google ScholarDigital Library
- {Shapiro 1997a} Marc Shapiro and Susan Horwitz, Fast and accurate flow-insensitive points-to analysis, Proceedings of the 24th ACM SIGPLANSIGACT Symposium on Principles of Programming Languages, pp. 1--14, Jan. 1997.]] Google ScholarDigital Library
- {Shapiro 1997b} Marc Shapiro and Susan Horwitz., The effects of the precision of pointer analysis, In P. V. Hentenryck editor, Lecture Notes in Computer Science, 1302, pp. 16--34, Springers-Verlag, 1997. Proceedings from the 4th International Static Analysis Symposium.]] Google ScholarDigital Library
- {Shatz 1987} Sol M. Shatz and W. K. Cheng, A Petri Net framework for automatic static analysis of Ada tasking behavior, Journal of Systems Software, 8, pp. 343--359, 1987.]] Google ScholarDigital Library
- {Shimomura 1992} Takao Shimomura, The program slicing technique and its application to testing, debugging and maintenance, Journal of IPS of Japan, 9(9), pp. 1078--1086, Sep. 1992.]]Google Scholar
- {Shostak 1981} Robert Shostak, Deciding linear inequalities by computing loop residues, ACM Journal, 28(4), pp. 769--779, Oct. 1981.]] Google ScholarDigital Library
- {Sinha 1999} Saurabh Sinha, Mary Jean Harrold, and Gregg Rothermel, System-dependence-graph-based slicing of programs with arbitrary interprocedural control flow, Proceedings of the 21st IEEE International Conference on Software Engineering (ICSE'99), pp. 432--441, May 1999.]] Google ScholarDigital Library
- {Sinha 2001} Saurabh Sinha, Mary Jean Harrold and Gregg Rothermel, Interprocedural control dependence, ACM Transactions on Software Engieering and Methodology, 10(2), pp. 209--254, 2001.]] Google ScholarDigital Library
- {Sivagurunatha 1997} Yoga Sivagurunathan, Mark Harman, and Sebastian Danicic, Slicing, I/O and the implicit state, Mariam Kamkar, editor, 3rd International Workshop on Automated Debugging (AADEBUG'97), Sweden, May 1997.]]Google Scholar
- {Sivagurunathan, 2002} Yoga Sivagurunathan, Mark Harman and Bala Sivagurunathan, Slice-based dynamic memory modeling -- a case study, Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment, pp. 351--356, 2002.]] Google ScholarDigital Library
- {Sloane 1996} Anthony M. Sloane and Jason Holdsworth, Beyond traditional program slicing, Proceedings of the 1996 international symposium on Software testing and analysis, San Diego, California, United States, pp. 180--186, 1996.]] Google ScholarDigital Library
- {Snelting 1996} Gregor Snelting, Combining slicing and constraint solving for validation of measurement software, Static Analysis Symposium, Lecture Notes in Computer Science, 1145, Springer, pp. 332--348, 1996.]] Google ScholarDigital Library
- {Snelting 2003} Gregor Snelting, Torsten Robschink, and Jens Krinke, Efficient path conditions in dependence graphs for software safety analysis, Submitted for publication, 2003.]]Google Scholar
- {Song 1998} Yeong-Tae Song and Dung T. Huynh, Forward dynamic interprocedural program slicing, Proceedings of the 1998 conference on CS & I '98, Research Triangle Park, NC, Oct. 1998.]]Google Scholar
- {Song 1999a} Yeong-Tae Song and Dung T. Huynh, Forward dynamic slicing software systems, PhD thesis, 103 pages, Jan. 1999.]] Google ScholarDigital Library
- {Song 1999b} Yeong-Tae Song, Dung T. Huynh, Forward dynamic object-oriented program slicing, Application-Specific Systems and Software Engineering and Technology (ASSET '99), IEEE CS Press, pp. 230--237, 1999.]] Google ScholarDigital Library
- {Song 2001} Yeong-Tae Song and Dung T. Huynh, Dynamic slicing object-oriented programs using dynamic object relationship diagrams, ACIS International Journal of Computer & Information Science, 2(1), pp. 35--48, Mar. 2001.]] Google ScholarDigital Library
- {Stafford 2000} Judith Alyce Stafford, A formal, language-independent, and compositional approach to interprocedural control dependence analysis, PhD thesis, 153 pages, 2000.]] Google ScholarDigital Library
- {Steensgaard 1996} Bjarne Steensgaard, Points-to analysis in almost linear time, Proceedings of 23rd Annual ACM SIGACTSIGPLAN Symposium on the Principles of Programming Languages, pp. 32--41, Jan. 1996.]] Google ScholarDigital Library
- {Steindl 1998a} Christoph Steindl, Program slicing (1), data structures and computation of control flow information, Technical Report 11, Institut für Praktische Informatik, University Linz, 1998.]] Google ScholarDigital Library
- {Steindl 1998b} Christoph Steindl, Program slicing (2), computation of data flow information. Technical Report 12, Institut für Praktische Informatik, University Linz, 1998.]] Google ScholarDigital Library
- {Steindl 1998c} Christoph Steindl, Intermodular slicing of object-oriented programs. Proceedings of International Conference on Compiler Construction, vol. 1383 of LNCS, Springer, pp. 264--278, 1998.]] Google ScholarDigital Library
- {Steindl 1999a} Christoph Steindl, Static analysis of object-oriented programs, 9th ECOOP Workshop for PhD Students in Object-Oriented Programming, Lisbon, Portugal, pp. 14--15, Jun. 1999.]] Google ScholarDigital Library
- {Steindl 1999b} Christoph Steindl, Program slicing for object-oriented programming languages, PhD thesis, Johannes Kepler University Linz, 1999.]]Google Scholar
- {Steindl 1999c} Christoph Steindl, Benefits of a dataflow-aware programming environment, Workshop on Program Analysis for Software Tools and Engineering (PASTE'99), 1999.]] Google ScholarDigital Library
- {Sward 2003} Ricky E. Sward and A. T. Chamillard, AdaSlicer: an Ada program slicer, Proceedings of the ACM SIGAda Annual International Conference (SIGAda'03), San Diego, California, pp. 10--16, Dec. 2003.]] Google ScholarDigital Library
- {Szilagyi 2002} Gyongyi Szilagyi, Tibor Gyimothy and Jan Maluszynski, Static and dynamic slicing of constraint logic programs, Automated Software Engineering, 9(1), pp. 41--65, Jan. 2002.]] Google ScholarDigital Library
- {Takada 2002} Tomonori Takada, Fumiaki Ohata and Katsuro Inoue, Dependence-cache slicing: A program slicing method using light-weight dynamic information, Proceedings of the 10th International Workshop on Program Comprehension, p. 169, 2002.]] Google ScholarDigital Library
- {Thuss 1988} Jeffrey J. Thuss, An investigation into slice-based cohesion metrics, Master's thesis, Michigan Technological University, 1988.]]Google Scholar
- {Tibor 1999} Tibor Gyimóthy, Árpád Beszédes and Istán Forgács, An efficient relevant slicing method for debugging, ACM SIGSOFT Software Engineering Notes, Nov. 1999.]] Google ScholarDigital Library
- {Tip 1994} Frank Tip, Generic techniques for source-level debugging and dynamic program slicing, Report CS-R9453, Centrum voor Wiskunde en Informatica (CWI), Amsterdam, 1994.]] Google ScholarDigital Library
- {Tip 1995a} Frank Tip, A survey of program slicing techniques, Journal of Programming Languages, 3(3), pp. 121--189, Sep. 1995.]]Google Scholar
- {Tip 1995b} Frank Tip, Generation of Program Analysis Tools, PhD thesis, Centrum voor Wiskunde en Informatica, Amsterdam, 1995.]]Google Scholar
- {Tip 1996} Frank Tip, Jong-Deok Choi, John Field, and G. Ramalingham, Slicing class hierarchies in c++, Proceedings of the 11th conference on Object-Oriented Programming, Systems, Languages and Applications (OOPSLA'96), San Jose, pp. 179--197, Oct. 1996.]] Google ScholarDigital Library
- {Tip 2000} Frank Tip and Jens Palsberg, Scalable propagation-based call graph construction algorithms, ACM SIGPLAN Notices, 35(10), pp. 281--293, Oct. 2000.]] Google ScholarDigital Library
- {Tonella 1997} Paolo Tonella, Giuliano Antoniol, Roberto Fiutem, and Ettore Merlo, Flow insensitive C++ pointers and polymorphism analysis and its application to slicing, In International Conference on Software Engineering, pp. 433--443, 1997.]] Google ScholarDigital Library
- {Tonella 2003} Paolo Tonella, Using a concept lattice of decomposition slices for program understanding and impact analysis, IEEE Transactions on Software Engineering, 29(6), pp. 495--509, Jun. 2003.]] Google ScholarDigital Library
- {Triolet 1985} R. Triolet, Interprocedural analysis for program restructuring with parafrase, Technical Report, CSRD Rep, No.538, University of Illinois Urbana-Champaign, Dec. 1985.]]Google Scholar
- {Umemori 2003} Fumiaki Umemori, Kenji Konda, Reishi Yokomori and Katsuro Inoue, Design and implementation of bytecode-based Java slicing system, Third IEEE International Workshop on Source Code Analysis and Manipulation, Amsterdam, The Netherlands, p. 108, Sep. 2003.]]Google Scholar
- {Vasconelos 1994} Wamberto Weber Vasconcelos, A method of extracting Prolog programming techniques, Technical Paper 27, DAI, Edinburgh Univ., 1994.]]Google Scholar
- {Vasconcelos 1995} Wamberto Weber Vasconcelos, Extracting, organizing, designing and reusing Prolog programming techniques, PhD thesis, DAI, Edinburgh Univ., Aug. 1995.]]Google Scholar
- {Vasconcelos 1998a} Wamberto Weber Vasconcelos and M. A. T. Aragão, Slicing logic programs, Technical Report, 1998.]]Google Scholar
- {Vasconcelos 1998b} Wamberto Weber Vasconcelos and Marcelo A. T. Aragão, An adaptation of dynamic slicing techniques for logic programming, Proceedings of the 14th Brazilian Symposium on Artificial Intelligence, SBIA'1998, pp. 151--160, Nov. 1998. Lecture Notes in Artificial Intelligence, 1515, Springer-Verlag.]] Google ScholarDigital Library
- {Vasconcelos 1999} Wamberto Weber Vasconcelos, A flexible framework for dynamic and static slicing of logic programs, Proceedings of PADL'99, Lecture Notes in Computer Science, 1551, pp. 259--274, 1999.]] Google ScholarDigital Library
- {Venkatesh 1991} G. A. Venkatesh, The semantic approach to program slicing, Proceedings of the ACM Transactions on Programming Languages and Systems, 13(2), pp. 181--210, 1991.]]Google ScholarDigital Library
- {Venkatesh 1995} G. A. Venkatesh, Experimental results from dynamic slicing of C programs, Transactions on Programming Languages and Systems, 17(2), pp. 197--216, 1995.]] Google ScholarDigital Library
- {Vidal 2002} Germán Vidal, Forward Slicing of Multi-paradigm Declarative Programs Based on Partial Evaluation, LOPSTR 2002, pp. 219--237, 2002.]] Google ScholarDigital Library
- {Ward 2002} M. P. Ward, Program slicing via Ferma Transformations, Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment, pp. 357--362, Aug. 2002.]] Google ScholarDigital Library
- {Weihl 1980} William E. Weihl, Interprocedural data flow analysis in the presence of pointers, procedure variables, and label variables, In Symposium on Principles of Programming Languages, pp. 83--94, Association for Computing Machinery, Jan. 1980.]] Google ScholarDigital Library
- {Weise 1994} Daniel Weise, Roger F. Crew, Michael Ernst, Bjarne Steensgaard, Value dependence graphs: representation without taxation, Proceedings of the ACM SIGPLAN-SIGACT Twenty-first Symposium on Principles of Programming Languages, pp. 297--310, Jan. 1994.]] Google ScholarDigital Library
- {Weiser 1979} Mark Weiser, Program slices: formal, psychological, and practical investigations of an automatic program abstraction method, PhD thesis, University of Michigan, Ann Arbor, MI, 1979.]] Google ScholarDigital Library
- {Weiser 1981} Mark Weiser, Program slicing, Proceedings of 5th International Conference on Software Engineering, pp. 439--449, San Diego, CA, Mar. 1981.]] Google ScholarDigital Library
- {Weiser 1982} Mark Weiser, Programmers use slicing when debugging, Communications of the ACM, 25(7), pp. 446--452, July 1982.]] Google ScholarDigital Library
- {Weiser 1983} Mark Weiser, Reconstructing sequential behavior from parallel behavior projections, Information Processing Letters 17(3), pp. 129--135, 1983.]]Google ScholarCross Ref
- {Weiser 1984} Mark Weiser, Program slicing, IEEE Transactions on Software Engineering, 10(4), pp. 352--357, 1984.]]Google ScholarDigital Library
- {Weiser 1986} Mark Weiser and James R. Lyle, Experiments on slicing-based debugging aids, Empirical Studies of Programmers, Ablex Publishing Corporation, pp. 187--197, 1986.]] Google ScholarDigital Library
- {Weiser 1998} Mark Weiser, Foreword to special issue on program slicing, Information and Software Technology, 40(11--12), pp. 575--576, Nov. 1998.]]Google Scholar
- {Wichaipanitch 2003} Winai Wichaipanitch, An interactive debugging tool for c++ based on dynamic slicing and dicing, PhD thesis, 165 pages, Jan. 2003.]] Google ScholarDigital Library
- {Williams 1977} M. Howard Williams, Generating structured flow diagrams: the nature of unstructuredness, The Computer Journal, 20(1), pp. 45--50, 1977.]]Google ScholarCross Ref
- {Williams 1978} M. H. Williams and H. L. Ossher, Conversion of unstructured flow diagrams to structured, The Computer Journal, 21(2), pp. 161--167, 1978.]]Google ScholarCross Ref
- {Wilson 1995} Robert P. Wilson and Monica S. Lam, Efficient context-sensitive pointer analysis for C programs, Proceedings of the ACM SIGPLAN'95 Conference on Programming Language Design and Implementation, La Jolla, CA, pp. 1--12, Jun. 18--21, 1995.]] Google ScholarDigital Library
- {Wilson 1997} Robert P. Wilson, Efficient context-sensitive pointer analysis for C programs, PhD thesis, Stanford University, 1997.]] Google ScholarDigital Library
- {Woodward 1998} M. R. Woodward and S. P. Allen, Slicing algebraic specifications, Information and Software Technology, ISSN: 0950--5849, 40(2), pp. 105--118, May 1998.]]Google Scholar
- {Wotawa 2002} Franz Wotawa, On the relationship between model-based debugging and program slicing, Artificial Intelligence, 135(1--2), pp. 125--143, Feb. 2002.]] Google ScholarDigital Library
- {Wu 2004a} Rangjun Wu and Tong Yi, Slicing Z specifications, ACM SIGPLAN Notices, 39(8), pp. 39--48, 2004.]] Google ScholarDigital Library
- {Wu 2004b} Junhua Wu, Baowen Xu and Jixiang Jiang, Slicing web application based on hyper graph, Proceedings of First International Workshop on Web Computing in Cyberworlds (WCCW2004), Nov. 2004, Tokyo, Japan.]] Google ScholarDigital Library
- {Xu 1993} Baowen Xu, Reverse program flow dependency analysis and applications, Chinese Journal of Computers, 16(5), pp. 385--392, 1993.]]Google Scholar
- {Xu 2001a} Baowen Xu, Zhenqiang Chen and Xiaoyu Zhou, Slicing object-oriented Ada95 programs based on dependence analysis, Journal of Software, 12, pp. 208--213, 2001 (in Chinese with English abstract).]]Google Scholar
- {Xu 2001b} Baowen Xu and Zhenqiang Chen, Dependence analysis for recursive Java programs, SIGPLAN Notices 36(12), pp. 70--76, 2001.]] Google ScholarDigital Library
- {Xu 2002} Baowen Xu, Zhenqiang Chen and Hongji Yang, Dynamic slicing object-oriented programs for debugging, Second IEEE International Workshop on Source Code Analysis and Manipulation (SCAM'02), Montreal, Canada, p. 115, Oct. 2002.]] Google ScholarDigital Library
- {Xu 2003a} Baowen Xu, Zhenqiang Chen and Jianjun Zhao, Measuring cohesion of packages in Ada95, Proceedings of the 2003 annual international conference on Ada, pp. 62--67, 2003.]] Google ScholarDigital Library
- {Xu 2003b} Lei Xu, Baowen Xu, Zhenqiang Chen, Jixiang Jiang and Huowang Chen, Regression testing for web applications based on slicing, Proceedings of the 27th Annual International Conference on Computer Software and Applications (IEEE COMPSAC2003), November, 2003, Texas, USA.]] Google ScholarDigital Library
- {Yang 1997} Hong Yang and Baowen Xu, Design and implementation of a PSS/ADA program slicing system, Chinese Journal of Computer Research and Development, 34(3), pp. 217--222, 1997.]]Google Scholar
- {Yong 1999} Suan Hsi Yong, Susan Horwitz and Thomas Reps, Pointer analysis for programs with structures and casting, Proceedings of the ACM SIGPLAN 1999 conference on Programming language design and implementation, May 1999.]] Google ScholarDigital Library
- {Yur 1999} Jyh-shiarn Yur, Barbara G. Ryder and William A. Landi, An incremental flow- and context-sensitive pointer aliasing analysis, Proceedings of the 21st international conference on Software engineering, May 1999.]] Google ScholarDigital Library
- {Zhang 1999} Lujun Zhang, Baowen Xu and Xiaoyu Zhou, Analysis and slicing of Ada95, In 5th International Conference for Young Computer Scientist (ICYCS'99), pp. 189--193, 1999.]]Google Scholar
- {Zhang 1998} Xiang-Xiang Sean Zhang, Practical pointer aliasing analyses for C, PhD thesis, Rutgers University, Aug, 1998.]] Google ScholarDigital Library
- {Zhang 2003a} Xiangyu Zhang, Rajiv Gupta and Youtao Zhang, Precise dynamic slicing algorithms, 25th International Conference on Software Engineering, pp. 319--329, May 2003.]] Google ScholarDigital Library
- {Zhang 2003b} Xiangyu Zhang, Rajiv Gupta, Hiding program slices for software security, Proceedings of the International Symposium on Code Generation and Optimization, p. 325, Mar. 2003.]] Google ScholarDigital Library
- {Zhang 2004a} Xiangyu Zhang and Rajiv Gupta, Cost effective dynamic program slicing, ACM SIGPLAN Conference on Programming Language. Design and Implementation, Jun. 2004.]] Google ScholarDigital Library
- {Zhang 2004b} Xiangyu Zhang and Rajiv Gupta, Recovering dynamic dependence graphs, Technical Report TR04-01, University of Arizona, Department of Computer Science, Tucson, AZ, 2004.]]Google Scholar
- {Zhang 2004c} Xiangyu Zhang, Rajiv Gupta and Youtao Zhang. Efficient forward computation of dynamic slices using reduced ordered binary decision diagrams, IEEE/ACM International Conference on Software Engineering, Edinburgh, UK, May 2004.]] Google ScholarDigital Library
- {Zhang 2004d} Yingzhou Zhang, Baowen Xu, Liang Shi, Bixin Li, Hongji Yang, Modular monadic program slicing. The 28th Annual International Computer Software and Applications Conference (COMPSAC 2004), pp. 66--71.]] Google ScholarDigital Library
- {Zhang 2004e} Yingzhou Zhang, Baowen Xu, Ju Qian, Modular monadic slicing of concurrent programs, The 8th IASTED International Conference on Software Engineering and Applications (SEA 2004), Nov. 2004.]]Google Scholar
- {Zhao 1996} Jianjun. Zhao, Jingde Cheng and Kazuo Ushijima, Static slicing of concurrent object-oriented programs, Proceedings of the 20th IEEE Annual International Computer Software and Applications Conference, pp. 312--320, 1996.]] Google ScholarDigital Library
- {Zhao 1998a} Jianjun Zhao, Applying program dependence analysis to Java software, Proceedings of Workshop on Software Engineering and Database Systems, pp. 162--169, 1998.]]Google Scholar
- {Zhao 1998b} Jianjun Zhao, Jingde Cheng, and Kazuo Ushijima, A dependence-based representation for concurrent object-oriented software maintenance, Proceedings of the 2nd Euromicro Conference on Software Maintenance and Reengineering, pp. 60--66, 1998.]] Google ScholarDigital Library
- {Zhao 1998c} Jianjun Zhao, Applying slicing technique to software architectures, Proceedings of the Fourth IEEE International Conference on Engineering of Complex Computer Systems, pp. 87--98, Aug. 1998.]]Google Scholar
- {Zhao 1998d} Jianjun Zhao, Dynamic slicing of object-oriented programs Technical Report SE-98-119, Information Processing Society of Japan (IPSJ), pp. 17--23, May 1998.]]Google Scholar
- {Zhao 1999a} Jianjun Zhao, Slicing concurrent Java programs, Proceedings of 7th IEEE International Workshop on Program Comprehension, IEEE CS Press, pp. 126--133, 1999.]] Google ScholarDigital Library
- {Zhao 1999b} Jianjun Zhao, Multithreaded dependence graphs for concurrent java programs, Proceedings of 1999 International Symposium on Software Engineering for Parallel and Distributed Systems, pp. 13--23, 1999.]] Google ScholarDigital Library
- {Zhao 2001} Jianjun Zhao, Jingde Cheng and Kazuo Ushijima, Computing executable slices for concurrent logic programs, Proceedings of the Second Asia-Pacific Conference on Quality Software, pp. 13--22, 2001.]] Google ScholarDigital Library
- {Zhao 2002a} Jianjun Zhao, Slicing aspect-oriented software, Proceedings of the 10th IEEE International Workshop on Programming Comprehension, pp. 251--260, Jun. 2002.]] Google ScholarDigital Library
- {Zhao 2002b} Jianjun Zhao, Hongji Yang, Liming Xiang and Baowen Xu, Change impact analysis to support architectural evolution, Journal of Software Maintenance and Evolution: Research and Practice, 14(5), pp. 317--333, 2002.]] Google ScholarDigital Library
- {Zhao 2003a} Jianjun Zhao and Martin Rinard, System dependence graph construction for aspect-oriented programs, MIT-LCSTR-891, Laboratory for Computer Science, MIT, Mar. 2003.]]Google Scholar
- {Zhao 2003b} Jianjun Zhao, Cunwei Lu and Baowen Xu, A toolkit for Java bytecode analysis, Proceedings of the Seventh IASTED International Conference on Software Engineering and Applications, Nov. 2003, Marina del Rey, CA, USA, v 7, 2003, pp. 482--487.]]Google Scholar
- {Zhao 2004a} Jianjun Zhao and Baowen Xu, Measuring aspect cohesion, Proceedings of The 2004 European Joint Conferences on Theory and Practice of Software (ETAPS2004), March 27 - April 4, 2004, Barcelona, Spain, Lecture Notes in Computer Science 2984 Springer 2004, pp. 54--68.]]Google Scholar
- {Zhao 2004b} Jianjun Zhao and Bixin Li, Dependence-based representation for concurrent Java programs and its application to slicing, to appear in Proceedings of ISFST2004, Xian, China.]]Google Scholar
- {Zhou 2002} Yuming Zhou, Baowen Xu, Jianjun Zhao and Hongji Yang, ICBMC: An improved cohesion measure for classes, Proceedings of IEEE International Conference on Software Maintenance (ICSM'02), Montreal, Canada, pp. 44--53, Oct. 2002.]] Google ScholarDigital Library
- {Zhou 2003} Yuming Zhou, Lijie Wen, Jianmin Wang, Yujian Chen, Hongmin Lu, and Baowen Xu, DRC: A dependence relationships based cohesion measure for classes, 10th Asia-Pacific Software Engineering Conference (APSEC 2003), Chiangmai, Thailand, Dec. 2003.]] Google ScholarDigital Library
Index Terms
- A brief survey of program slicing
Recommendations
Abstract program slicing: from theory towards an implementation
ICFEM'10: Proceedings of the 12th international conference on Formal engineering methods and software engineeringIn this paper we extend the formal framework proposed by Binkley et al. for representing and comparing forms of program slicing. This framework describes many well-known forms of slicing in a unique formal structure based on (abstract) projections of ...
Abstract Program Slicing: An Abstract Interpretation-Based Approach to Program Slicing
In the present article, we formally define the notion of abstract program slicing, a general form of program slicing where properties of data are considered instead of their exact value. This approach is applied to a language with numeric and reference ...
A static slicing method for functional programs and its incremental version
CC 2019: Proceedings of the 28th International Conference on Compiler ConstructionAn effective static slicing technique for functional programs must have two features. Its handling of function calls must be context sensitive without being inefficient, and, because of the widespread use of algebraic datatypes, it must take into ...
Comments