Loading...
Please wait, while we are loading the content...
Similar Documents
Interprocedural dataflow analysis via graph reachability (1994)
| Content Provider | CiteSeerX |
|---|---|
| Author | Horwitz, Susan Sagiv, Mooly Reps, Thomas |
| Abstract | This paper shows how to find precise solutions to a large class of interprocedural dataflow-analysis problems in polynomial time. In contrast with intraprocedural dataflow analysis, where “precise” means “meet-over-all-paths”[16], a precise interprocedural dataflow-analysis algorithm must provide the “meet-over-all-valid-paths ” solution. (A path is valid if it respects the fact that when a procedure |
| File Format | |
| Publisher Date | 1994-01-01 |
| Access Restriction | Open |
| Subject Keyword | Precise Solution Meet-over-all-valid-paths Solution Intraprocedural Dataflow Analysis Graph Reachability Interprocedural Dataflow Analysis Interprocedural Dataflow-analysis Problem Precise Interprocedural Dataflow-analysis Algorithm |
| Content Type | Text |
| Resource Type | Article |