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