Searching for authors named "T. Reps" – sorted by Number of Citations

Order by: Relevance | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

143 documents found, showing 1 through 10. Next 10 →

Interprocedural Slicing Using Dependence Graphs
by Susan Horwitz, Thomas Reps, David Binkley — 1990 — ACM Transactions on Programming Languages and Systems
…This paper concerns the problem of interprocedural slicing---generating a slice of an entire program, where the slice crosses the boundaries of procedure calls. To solve this problem, we introduce a new kind of graph to represent programs, called a system dependence graph, which extends previous de…
Cited by 549 (65 self) – Add To MetaCart

Parametric Shape Analysis via 3-Valued Logic
by Mooly Sagiv, Thomas Reps, Reinhard Wilhelm — 1999
… prototype version of such a system, based on the methods presented in this paper, has been implemented by T…
Cited by 339 (52 self) – Add To MetaCart

Interprocedural DataflowAnalysis via Graph Reachability
by Thomas Reps, Mooly Sagiv, Susan Horwitz — 1994
…. For all t ��T p, q and x ��D p ,|t({ x }) - t(��)| �� B; b. For all t ��T p, q and y ��D q ,if y �� t…
Cited by 256 (27 self) – Add To MetaCart

Solving Shape-Analysis Problems in Languages with Destructive Updating
by Mooly Sagiv, Thomas Reps, Reinhard Wilhelm, Universität Des Saarlandes — 1996
…, Tel-Aviv 69978, Israel; email: sagiv@(email omitted);; T. Reps, Computer Sciences Department, University…
Cited by 253 (19 self) – Add To MetaCart

Integrating non-interfering versions of programs
by Susan Horwitz, Jan Prins, Thomas Reps — 1989 — ACM Transactions on Programming Languages and Systems
… as by grants from IBM, DEC, Siemens, and Xerox. Authors’ current addresses: S. Horwitz and T. Reps, Computer…
Cited by 216 (22 self) – Add To MetaCart

Identifying Modules Via Concept Analysis
by Michael Siff, Thomas Reps — 1997 — IEEE Transactions on Software Engineering
… variable x" or "f has an argument of type t". It is sometimes the case that a module can be identified…
Cited by 90 (1 self) – Add To MetaCart

Program analysis via graph reachability
by Thomas Reps — 1998 — Information and Software Technology
… [ e ] ] | ε In this graph, there is exactly one L-path from s to t: The path goes exactly once around…
Cited by 85 (7 self) – Add To MetaCart

An Incremental Algorithm for a Generalization of the Shortest-Path Problem
by G. Ramalingam, Thomas Reps — 1992 — Journal of Algorithms
… (Y) = { a | a �� T* and Y �� * a } be the set of terminal strings derivable from Y. Every string a…
Cited by 85 (2 self) – Add To MetaCart

The Use of Program Dependence Graphs in Software Engineering
by Susan Horwitz, Thomas Reps — 1992 — IN PROCEEDINGS OF THE FOURTEENTH INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING
…representation---the program dependence graph---and discusses how program dependence graphs, together with operations such as program slicing, can provide the basis for powerful programming tools that address important software-engineering problems, such as understanding what an existing program doe…
Cited by 81 (0 self) – Add To MetaCart

The use of program profiling for software maintenance with applications to the year 2000 problem
by Thomas Reps, Thomas Ball, Manuvir Das, James Larus — 1997 — ACM Software Engineering Notes
…This paper describes new techniques to help with testing and debugging, using information obtained from path profiling. Apath profiler instruments a program so that the number of times each different loopfree path executes is accumulated during an execution run. With such an instrumented program, ea…
Cited by 69 (5 self) – Add To MetaCart

Showing 1 through 10. Next 10 →

Try your query at: Scholar | Yahoo! | Ask | MS Live | CSB