Výsledky vyhľadávania - "interprocedural program slicing"

Precise interprocedural dataflow analysis with applications to constant propagation

Autori: Thomas Reps Mooly Sagiv Susan Horwitz a ďalší

Prispievatelia: Thomas Reps Mooly Sagiv Susan Horwitz a ďalší

Zdroj: http://repository.readscheme.org/ftp/papers/topps/D-215.pdf.

Predmety: CR Categories and Subject Descriptors, D.3.4 [Programming Languages, Processors − compilers, optimization, E.1 [Data Structures] − graphs, F.2.2 [Analysis of Algorithms and Problem Complexity, Complexity of Algorithms, Nonnumerical Algorithms and Problems − computations on discrete structures, G.2.2 [Discrete Mathematics, Graph Theory − graph algo- rithms General Terms, Algorithms, Theory Additional Key Words and Phrases, demand dataflow analysis, distributive dataflow framework, flow-sensitive side-effect analysis, function representation, graph reachability, interprocedural dataflow analysis, interprocedural program slicing, inter- procedurally realizable path, interprocedurally valid path, meet-over-all-valid-paths solution

Popis súboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.648.7555

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.648.7555
http://repository.readscheme.org/ftp/papers/topps/D-215.pdf

Precise interprocedural dataflow analysis via graph reachability

Autori: Thomas Reps Mooly Sagiv Susan Horwitz a ďalší

Prispievatelia: Thomas Reps Mooly Sagiv Susan Horwitz a ďalší

Zdroj: http://www.cs.wisc.edu/wpis/papers/diku-tr94-14.pdf.

Predmety: CR Categories and Subject Descriptors, D.3.4 [Programming Languages, Processors − compilers, optimization, E.1 [Data Structures] − graphs, F.2.2 [Analysis of Algorithms and Problem Complexity, Complexity of Algorithms, Nonnumerical Algorithms and Problems − computations on discrete structures, G.2.2 [Discrete Mathematics, Graph Theory − graph algorithms General Terms, Algorithms, Theory Additional Key Words and Phrases, demand dataflow analysis, distributive dataflow framework, flow-sensitive side-effect analysis, function representation, graph reachability, interprocedural dataflow analysis, interprocedural program slicing, interprocedurally realizable path, interprocedurally valid path, meet-over-all-valid-paths solution

Popis súboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.81.4141

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.81.4141
http://www.cs.wisc.edu/wpis/papers/diku-tr94-14.pdf

Precise interprocedural dataflow analysis via graph reachability

Autori: Thomas Reps Mooly Sagiv Susan Horwitz a ďalší

Prispievatelia: Thomas Reps Mooly Sagiv Susan Horwitz a ďalší

Zdroj: http://www.cs.wisc.edu/wpis/papers/diku-tr94-14.ps.

Predmety: CR Categories and Subject Descriptors, D.3.4 [Programming Languages, Processors − compilers, optimization, E.1 [Data Structures] − graphs, F.2.2 [Analysis of Algorithms and Problem Complexity, Complexity of Algorithms, Nonnumerical Algorithms and Problems − computations on discrete structures, G.2.2 [Discrete Mathematics, Graph Theory − graph algorithms General Terms, Algorithms, Theory Additional Key Words and Phrases, demand dataflow analysis, distributive dataflow framework, flow-sensitive side-effect analysis, function representation, graph reachability, interprocedural dataflow analysis, interprocedural program slicing, interprocedurally realizable path, interprocedurally valid path, meet-over-all-valid-paths solution

Popis súboru: application/postscript

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.81.2375

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.81.2375
http://www.cs.wisc.edu/wpis/papers/diku-tr94-14.ps

Interprocedural Dataflow Analysis via Graph Reachability

Autori: Thomas Reps Mooly Sagiv Susan Horwitz a ďalší

Prispievatelia: Thomas Reps Mooly Sagiv Susan Horwitz a ďalší

Zdroj: ftp://ftp.diku.dk/pub/diku/semantics/papers/D-215.ps.Z

Predmety: General Terms, Algorithms, Theory Additional Key Words and Phrases, demand dataflowanalysis, distributive dataflowframework, flow-sensitive side-effect analysis, function representation, graph reachability, interprocedural dataflowanalysis, interprocedural program slicing, interprocedurally realizable path, interprocedurally valid path, meet-over-all-valid-paths solution

Popis súboru: application/postscript

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.48.1266

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.48.1266

Slicing in the Presence of Parameter Aliasing

Autori: David Binkley The Pennsylvania State University CiteSeerX Archives

Prispievatelia: David Binkley The Pennsylvania State University CiteSeerX Archives

Zdroj: http://www.cs.loyola.edu/~binkley/papers/serf93.ps.

Predmety: General Terms, Algorithms, Design Additional Key Words and Phrases, aliasing, data dependence, program dependence graph, interprocedural program slicing

Popis súboru: application/postscript

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.54.1750; http://www.cs.loyola.edu/~binkley/papers/serf93.ps

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.54.1750
http://www.cs.loyola.edu/~binkley/papers/serf93.ps