Pages that link to "Item:Q3761672"
From MaRDI portal
The following pages link to The program dependence graph and its use in optimization (Q3761672):
Displayed 47 items.
- Static slicing of explicitly synchronized languages (Q418185) (← links)
- Black-box testing based on colorful taint analysis (Q439720) (← links)
- A unifying theory of control dependence and its application to arbitrary program structures (Q650921) (← links)
- Efficient comparison of program slices (Q758192) (← links)
- Fast computation of strong control dependencies (Q832318) (← links)
- Properties of data flow frameworks: A unified model (Q910237) (← links)
- A trajectory-based strict semantics for program slicing (Q960858) (← links)
- Actor-based slicing techniques for efficient reduction of Rebeca models (Q988163) (← links)
- Slicing for architectural analysis (Q988166) (← links)
- A profile-based tool for finding pipeline parallelism in sequential programs (Q991154) (← links)
- A non-standard semantics for program slicing and dependence analysis (Q997995) (← links)
- Slicing communicating automata specifications: Polynomial algorithms for model reduction (Q1019005) (← links)
- The uniform memory hierarchy model of computation (Q1333430) (← links)
- DyC: An expressive annotation-directed dynamic compiler for C (Q1583356) (← links)
- A program slicing-based method for effective detection of coincidentally correct test cases (Q1616574) (← links)
- Tracking CSP computations (Q1633350) (← links)
- Efficient static checker for tainted variable attacks (Q1651020) (← links)
- An alternative characterization of weak order dependence (Q1675759) (← links)
- The dependence condition graph: precise conditions for dependence between program points (Q1749251) (← links)
- Slicing programs in the presence of errors (Q1815347) (← links)
- A compact execution history for dynamic slicing (Q1853691) (← links)
- Program slicing of Java programs (Q2095423) (← links)
- Exception-sensitive program slicing (Q2095432) (← links)
- Slicing unconditional jumps with unnecessary control dependencies (Q2119123) (← links)
- A formal semantics of the GraalVM intermediate representation (Q2147184) (← links)
- Simple and efficient computation of minimal weak control closure (Q2233536) (← links)
- Dynamic slicing of lazy functional programs based on redex trails (Q2271904) (← links)
- A sparse evaluation technique for detailed semantic analyses (Q2339156) (← links)
- Next-preserving branching bisimulation (Q2355689) (← links)
- Scaling down discrete-event simulation models (Q2371661) (← links)
- A tabu search algorithm for structural software testing (Q2482359) (← links)
- Theoretical foundations of dynamic program slicing (Q2503318) (← links)
- Static Slicing of Rewrite Systems (Q2873792) (← links)
- The MEB and CEB Static Analysis for CSP Specifications (Q3617433) (← links)
- Traces of Control-Flow Graphs (Q3637222) (← links)
- PPTran: SOURCE TO SOURCE TRANSLATOR FOR HIGH PERFORMANCE FORTRAN (Q4820182) (← links)
- Verifying Array Manipulating Programs with Full-Program Induction (Q5039501) (← links)
- Specifications can make programs run faster (Q5044738) (← links)
- On the adequacy of dependence-based representations for programs with heaps (Q5096229) (← links)
- System dependence graph construction for aspect oriented C++ (Q5492517) (← links)
- (Q5856419) (← links)
- An optimal algorithm for the construction of the system dependence graph (Q5938653) (← links)
- On the relationship between model-based debugging and program slicing (Q5958541) (← links)
- Distributing and parallelizing non-canonical loops (Q6132484) (← links)
- Fast and incremental computation of weak control closure (Q6164434) (← links)
- Efficient computation of arbitrary control dependencies (Q6165552) (← links)
- Output-sensitive information flow analysis (Q6190181) (← links)