Susan Horwitz, Thomas Reps, David Binkley  Home/Search
Context Related
Links: ACM DBLP | wisc.edu/wpis/pape...8.retrospective.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: 128.105.7.11/~reps/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This paper made two main contributions: it defined system dependence graphs (SDGs), which extended program dependence graphs (PDGs) [31, 17] to incorporate collections of procedures (with procedure calls) rather than just monolithic programs. It then defined an interprocedural slicing algorithm that identifies the components of the SDG that might affect the values of the variables defined at or used at a given program point p, and/or how often p executes. The novelty of the algorithm was that... (Update)
Cited by: More
Interconvertibility of Set Constraints and - Context-Free Language.. (Correct)
Efficient Comparison of Program Slices - Susan Horwitz And (Correct)
A Next-Generation Platform for Analyzing Executables - Reps Balakrishnan Lim (Correct)
Active bibliography (related documents): More All
0.6: Weighted Pushdown Systems - And Their Application (Correct)
0.4: The Use of Program Dependence Graphs in Software Engineering - Susan Horwitz And (1992) (Correct)
0.4: Speeding up Slicing - Reps, Horwitz, Sagiv, Rosay (1994) (Correct)
Similar documents based on text: More All
1.5: Precise Executable Interprocedural Slices - Binkley (1994) (Correct)
1.4: Interprocedural Slicing Using Dependence Graphs - Horwitz, Reps, Binkley (1990) (Correct)
1.1: Slicing in the Presence of Parameter Aliasing - Binkley (1993) (Correct)
Related documents from co-citation: More All
54: The Program Dependence Graph in a software Development Environment (context) - Ottenstein, Ottenstein - 1984
47: The program dependence graph and its use in optimization (context) - Ferrante, Ottenstein et al. - 1987
42: IEEE Transactions on Software Engineering (context) - Weiser - 1984
BibTeX entry: (Update)
Susan Horwitz, Thomas Reps, and David Binkley. Interprocedural slicing using dependence graphs. ACM Transactions on Programming Languages and Systems, 12(1):26--60, January 1990. http://citeseer.ist.psu.edu/horwitz90interprocedural.html More
@inproceedings{ horwitz88interprocedural,
author = "Susan Horwitz and Thomas Reps and David Binkley",
title = "Interprocedural slicing using dependence graphs",
booktitle = "Proceedings of the {ACM} {SIGPLAN} '88 Conference on Programming Language Design and Implementation",
journal = "SIGPLAN Notices",
volume = "23",
number = "7",
month = "June",
address = "Atlanta, GA",
pages = "35--46",
year = "1988",
url = "citeseer.ist.psu.edu/horwitz90interprocedural.html" }
Citations (may not include all citations):480 The program dependence graph and its use in optimization (context) - Ferrante, Ottenstein et al. - 1987 ACM DBLP
390 Interprocedural slicing using dependence graphs - Horwitz, Reps et al. - 1990 ACM DBLP
283 Optimizing Supercompilers for Supercomputers (context) - Wolfe - 1982 ACM
265 Program slicing (context) - Weiser - 1981 ACM DBLP
265 Program slicing (context) - Weiser - 1984 ACM DBLP
252 Analysis of pointers and structures (context) - Chase, Wegman et al. - 1990 ACM DBLP
246 Context-sensitive interprocedural points-to analysis in the .. - Emami, Ghiya et al. - 1994 ACM DBLP
245 Semantics of context-free languages (context) - Knuth - 1968 DBLP
186 The program dependence graph in a software development envir.. (context) - Ottenstein, Ottenstein - 1984 ACM DBLP
180 Efficient context-sensitive pointer analysis for C programs - Wilson, Lam - 1995 ACM DBLP
144 Two approaches to interprocedural data flow analysis (context) - Sharir, Pnueli - 1981
132 Detecting conflicts between structure accesses (context) - Larus, Hilfinger - 1988 ACM DBLP
129 Precise interprocedural dataflow analysis via graph reachabi.. - Reps, Horwitz et al. - 1995 ACM DBLP
110 Practical dependence testing - Goff, Kennedy et al. - 1991 ACM DBLP
99 Dependence analysis for pointer variables (context) - Horwitz, Pfeiffer et al. - 1989 ACM DBLP
84 Efficient and exact data dependence analysis (context) - Maydan, Hennessy et al. - 1991 ACM DBLP
76 The program summary graph and flow-sensitive interprocedural.. (context) - Callahan - 1988
66 Interprocedural constant propagation (context) - Callahan, Cooper et al. - 1986 ACM DBLP
66 Interprocedural side-effect analysis in linear time (context) - Cooper, Kennedy - 1988
66 Eliminating false data dependences using the Omega test (context) - Pugh, Wonnacott - 1992 ACM DBLP
59 Demand interprocedural dataflow analysis - Horwitz, Reps et al. - 1995 ACM DBLP
57 Speeding up slicing - Horwitz, Reps et al. - 1994 ACM DBLP
51 ESP: Path-sensitive program verification in polynomial time - Das, Lerner et al. - 2002 DBLP
49 Ordered attribute grammars (context) - Kastens - 1980
47 Program analysis via graph reachability - Reps - 1998 ACM DBLP
45 Precise interprocedural dataflow analysis with applications .. - Sagiv, Reps et al. - 1996 ACM DBLP
44 Static determination of dynamic properties of recursive proc.. (context) - Cousot, Cousot - 1977
43 Slicing programs with arbitrary control-flow - Ball, Horwitz - 1993 ACM DBLP
43 On slicing programs with jump statements - Agrawal - 1994 ACM DBLP
35 System-dependence-graph-based slicing of programs with arbit.. - Sinha, Harrold et al. - 1999
34 Static slicing of threaded programs - Krinke - 1998 ACM DBLP
33 Static slicing in the presence of goto statements - Choi, Ferrante - 1994 ACM DBLP
31 Graph-theoretic methods in database theory (context) - Yannakakis - 1990 ACM DBLP
29 Precise interprocedural chopping (context) - Reps, Rosay - 1995 ACM DBLP
23 Context-sensitive synchronization-sensitive analysis is unde.. - Ramalingam - 2000 ACM DBLP
20 Demand interprocedural program analysis using logic database.. - Reps - 1994 DBLP
16 Model checking of unrestricted hierarchical state machines - Benedikt, Godefroid et al. - 2001 ACM DBLP
15 Shape analysis as a generalized path problem (context) - Reps - 1995 ACM DBLP
13 Multi-Procedure Program Integration (context) - Binkley - 1991 ACM
9 Better slicing of programs with jumps and switches - Kumar, Horwitz - 2002 ACM DBLP
8 Undecidability of context-sensitive data-dependence analysis (context) - Reps - 2000
8 Bebop: A path-sensitive interprocedural dataflow engine (context) - Ball, Rajamani - 2001 DBLP
8 the sequential nature of interprocedural program-analysis pr.. - Reps - 1996
7 Slicing multi-threaded Java programs: A case study - Dwyer, Corbett et al. - 1999
7 Slicing concurrent programs - Nanda, Ramesh - 2000 ACM DBLP
6 Precise executable interprocedural slices - Binkley - 1993 ACM DBLP
3 Speedup of Ordinary Programs (context) - Bannerjee - 1979 ACM
2 http://www.cs.wisc.edu/wpis/papers/diku-tr94-14.ps (context) - Reps, Sagiv et al. - 1994
1 Interprocedural slicing of computer programs using dependenc.. (context) - Reps, Horwitz et al. - 1992
1 Type-base flow analysis: From polymorphic subtyping to CFL-r.. (context) - Rehof, Fahndrich - 2001 DBLP
1 http://www.cs.wisc.edu/wpis/papers/tr1283r.ps (context) - Horwitz, Reps et al. - 1995
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://128.105.7.11/~reps/): More
Coping with Type Casts in C - Siff, Chandra, Kunchithapadam, Reps (1999) (Correct)
Dependence-Based Representations for Programs with Reference.. - Pfeiffer, IV (1991) (Correct)
Symbolic Implementation of the Best Transformer - Reps, Sagiv, Yorsh (2004) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC