scientific article; zbMATH DE number 3551830
From MaRDI portal
Publication:4125700
Directed graphs (digraphs), tournaments (05C20) Extremal problems in graph theory (05C35) Research exposition (monographs, survey articles) pertaining to computer science (68-02) General topics in the theory of software (68N01) Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99)
Cited in
(16)- Pathlistings applied to data flow analysis
- Semantic decomposition of computer programs: An aid to program testing
- An \(O(n)\) algorithm for computing the set of available expressions of D-charts
- Testing flow graph reducibility
- Function iteration logics and flowchart schemata
- Node listings for reducible flow graphs
- Profitability computations on program flow graphs
- Monotone data flow analysis frameworks
- The method of attributes for data flow analysis. I: Exhaustive analysis
- Bibliography on the evaluation of numerical software
- A composite algorithm for strength reduction and code movement optimization
- A portable lisp compiler
- A composite hoisting-strength reduction transformation for global program optimization part I
- A composite hoisting-strength reduction transformation for global program optimization part ii
- Semantic and syntactic issues in programming
- A region analysis algorithm for the live variables problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4125700)
