Sparse code motion
From MaRDI portal
busy code motioncode motioncode sizecompuational optimalityembedded processors and systemsexpression motionlazy code motionlife-time optimalitypartial redundancy eliminationspace optimality
Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60)
Recommendations
- A solution to a problem with Morel and Renvoise's “Global optimization by suppression of partial redundancies”
- scientific article; zbMATH DE number 1617327
- Code motion in the presence of critical edges without bidirectional data flow analysis
- Elimination of parallel copies using code motion on data dependence graphs
- scientific article; zbMATH DE number 2090859
Cited in
(8)- Code motion in the presence of critical edges without bidirectional data flow analysis
- scientific article; zbMATH DE number 1617327 (Why is no real title available?)
- Code factoring in GCC on different intermediate languages
- A solution to a problem with Morel and Renvoise's “Global optimization by suppression of partial redundancies”
- scientific article; zbMATH DE number 2090859 (Why is no real title available?)
- Property-oriented expansion
- Deriving bisimulation relations from path based equivalence checkers
- Languages and Compilers for Parallel Computing
This page was built for publication: Sparse code motion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5178851)
