The program dependence graph and its use in optimization
From MaRDI portal
Recommendations
Cited in
(60)- Slicing communicating automata specifications: Polynomial algorithms for model reduction
- The uniform memory hierarchy model of computation
- DyC: An expressive annotation-directed dynamic compiler for C
- A program slicing-based method for effective detection of coincidentally correct test cases
- Tracking CSP computations
- Efficient static checker for tainted variable attacks
- An alternative characterization of weak order dependence
- The dependence condition graph: precise conditions for dependence between program points
- Slicing programs in the presence of errors
- A compact execution history for dynamic slicing
- Program slicing of Java programs
- Exception-sensitive program slicing
- Slicing unconditional jumps with unnecessary control dependencies
- A formal semantics of the GraalVM intermediate representation
- Simple and efficient computation of minimal weak control closure
- Dynamic slicing of lazy functional programs based on redex trails
- A sparse evaluation technique for detailed semantic analyses
- Next-preserving branching bisimulation
- Scaling down discrete-event simulation models
- A tabu search algorithm for structural software testing
- Theoretical foundations of dynamic program slicing
- Static slicing of rewrite systems
- scientific article; zbMATH DE number 3876561 (Why is no real title available?)
- A threaded abstract syntax tree based generation algorithm of program dependence graph
- The MEB and CEB Static Analysis for CSP Specifications
- Traces of Control-Flow Graphs
- Static slicing of explicitly synchronized languages
- Black-box testing based on colorful taint analysis
- scientific article; zbMATH DE number 1956452 (Why is no real title available?)
- scientific article; zbMATH DE number 1533817 (Why is no real title available?)
- scientific article; zbMATH DE number 2087561 (Why is no real title available?)
- PPTran: SOURCE TO SOURCE TRANSLATOR FOR HIGH PERFORMANCE FORTRAN
- scientific article; zbMATH DE number 841576 (Why is no real title available?)
- Verifying array manipulating programs with full-program induction
- Specifications can make programs run faster
- On the adequacy of dependence-based representations for programs with heaps
- Static Analysis
- System dependence graph construction for aspect oriented C++
- Optimization of a data dependence graph for the local microcode compaction problem. II: Algorithms and experimental verification
- Output-sensitive information flow analysis
- An optimal algorithm for the construction of the system dependence graph
- On the relationship between model-based debugging and program slicing
- Distributing and parallelizing non-canonical loops
- Fast and incremental computation of weak control closure
- Efficient computation of arbitrary control dependencies
- Output-sensitive information flow analysis
- Constraint-based debugging in probabilistic model checking
- Using Relational Verification for Program Slicing
- A unifying theory of control dependence and its application to arbitrary program structures
- HOLL: program synthesis for higher order logic locking
- A program logic for dependence analysis
- RNA: R1CS normalization algorithm based on data flow graphs for zero-knowledge proofs
- Efficient comparison of program slices
- Fast computation of strong control dependencies
- Properties of data flow frameworks: A unified model
- A trajectory-based strict semantics for program slicing
- Actor-based slicing techniques for efficient reduction of Rebeca models
- Slicing for architectural analysis
- A profile-based tool for finding pipeline parallelism in sequential programs
- A non-standard semantics for program slicing and dependence analysis
This page was built for publication: The program dependence graph and its use in optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3761672)
