Thomas Ball, Susan Horwitz  Home/Search
Context Related
| wisc.edu/wpis/papers/tr921091.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: wisc.edu/wpis/h...#shape_analysis (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This paper addresses the inverse problem: we define an algorithm that, given a control dependence graph C, finds a corresponding control-flow graph G (i.e., a graph G such that CDG(G) is isomorphic to C), or determines that no such control-flow graph exists. We call this process CDG-reconstitution (Update)
Context of citations to this paper: More
...all dependent program nodes into the thread, eliminating local dependence. This final transitive expansion guarantees linearizability [2] required by the function promotion. Applying the basic algorithm on the example in Section 3.4 results in the thread structure shown in...
.... flow reconsitution from the control dependence that can be extracted from a MSG as a partial target interpretation uses the methods in [BH91] ffl Graph analysis and rewrite (rewrite one) to unroll embedded functions, remove redundancies due to conditional failure. This...
Cited by: More
Model Based User-Interface Reengineering - Tucker, Stirewalt (1999) (Correct)
βτοο: Compilation for Parallel Targets - Sillitoe (1993) (Correct)
Dynamic Pointer Alignment: Tiling and Communication.. - Zhang, Chien (1997) (Correct)
Similar documents (at the sentence level):
9.2%: The Use of Control-Flow and Control Dependence in Software Tools - Ball (1993) (Correct)
Active bibliography (related documents): More All
0.6: Exploiting Multi-Grained Parallelism For.. - Newburn (1997) (Correct)
0.5: The Use of Program Dependence Graphs in Software Engineering - Susan Horwitz And (1992) (Correct)
0.4: Chapter 1 Program Integration - Program Integration Concerns (Correct)
Similar documents based on text: More All
0.2: Better Slicing of Programs with Jumps and Switches - Sumit Kumar Sumit (2002) (Correct)
0.2: Slicing Programs with Arbitrary Control Flow - Thomas Ball Susan (1992) (Correct)
0.2: What's in a Region? or Computing control dependences in.. - Ball (1993) (Correct)
Related documents from co-citation: More All
2: Fine-Grained Parallelism in Ellie - Andersen - 1991
2: Efficiently Computing Static Single Assignment Form and the Control Dependence G.. - Cytron, Ferrante et al. - 1991
BibTeX entry: (Update)
Thomas Ball and Susan Horwitz. Constructing control flow from control dependence. Technical Report 1091, University of Wisconsin--Madison, 1992. http://citeseer.ist.psu.edu/ball92constructing.html More
@techreport{ ball92constructing,
author = "Thomas J. Ball and Susan Horwitz",
title = "Constructing Control Flow From Control Dependence",
number = "CS-TR-1992-1091",
year = "1992",
url = "citeseer.ist.psu.edu/ball92constructing.html" }
Citations (may not include all citations):1450 The Design and Analysis of Computer Algorithms (context) - Aho, Hopcroft et al. - 1974
866 Techniques and Tools (context) - Aho, Sethi et al. - 1986
480 The program dependence graph and its use in optimization (context) - Ferrante, Ottenstein et al. - 1987
158 Certification of programs for secure information flow (context) - Denning, Denning - 1977
152 An efficient method of computing static single assignment fo.. (context) - Cytron, Ferrante et al. - 1989
136 Fast Algorithms for Finding Nearest Common Ancestors (context) - Harel, Tarjan - 1984
135 Integrating non-interfering versions of programs (context) - Horwitz, Prins et al. - 1989
50 Testing Flow Graph Reducibility (context) - Tarjan - 1973
35 the adequacy of program dependence graphs for representing p.. - Horwitz, Prins et al. - 1988
30 An Algorithm for Structuring Flow Graphs (context) - Baker - 1977
25 The semantics of program slicing - Reps, Yang - 1988
21 Compact Representations for Control Dependence (context) - Cytron, Ferrante et al. - 1990
19 The semantics of program slicing and program integration (context) - Reps, Yang - 1989
18 A program integration algorithm that accommodates semantics-.. (context) - Yang, Horwitz et al. - 1990
16 Algebraic Properties of Program Integration (context) - Reps - 1990
14 The Program Dependence Graph and Vectorization (context) - Baxter, Bauer - 1989
12 A Rewriting Semantics for Program Dependence Graphs (context) - Selke - 1989
9 On linearizing parallel code (context) - Ferrante, Mace - 1985
6 Semantics of Program Representation Graphs - Ramalingam, Reps - 1989
6 Generating Sequential Code From Parallel Code (context) - Ferrante, Mace et al. - 1988
5 A Foundation for Sequentializing Parallel Code (context) - Simons, Alpern et al. - 1990
4 Correctness of an algorithm for reconstituting a program fro.. (context) - Ball, Horwitz et al. - 1990
Documents on the same site (http://www.cs.wisc.edu/wpis/html/#shape_analysis):
Protecting C Programs from Attacks via Invalid Pointer.. - Yong, Horwitz (2003) (Correct)
Slicing Programs with Arbitrary Control Flow - Thomas Ball Susan (1992) (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