New pages
Jump to navigation
Jump to search
- 03:02, 1 March 2025 Bitblast Transformation (hist | edit) [6,935 bytes] Timo.stripf (talk | contribs) (Created page with "A '''bitblast transformation''' is a technique used in '''formal verification''', particularly in '''SAT solving''' and '''SMT solving'''. It refers to the process of converting expressions that operate on '''word-level data types''' (such as 32-bit integers or bitvectors) into equivalent logic formulas operating on '''individual bits'''. This transformation allows complex operations to be handled by '''Boolean satisfiability solvers''' (SAT solvers), which operate exclu...")
- 10:06, 17 February 2025 Loop Invariant Code Motion (hist | edit) [2,716 bytes] Mira.steinmetz (talk | contribs) (Created page with "Loop invariant code motion is an optimization technique that moves computations outside of a loop if they do not depend on the loop iterator. By extracting such invariant expressions, this transformation reduces redundant calculations and improves runtime efficiency. It minimizes unnecessary operations within loops, leading to faster execution and better performance. This technique is particularly useful in optimizing complex loops, reducing computation overhead, and ena...") Tag: Visual edit
- 09:49, 17 February 2025 While To For (hist | edit) [1,424 bytes] Mira.steinmetz (talk | contribs) (Created page with "The while-to-for transformation converts a selected while loop into an equivalent for loop while preserving the original loop semantics. This conversion improves code consistency and enables further compiler optimizations that specifically target for-loop structures. By restructuring loops in a standardized format, this transformation facilitates better loop analysis, enhances readability, and increases the potential for optimizations such as loop unrolling or vectorizat...") Tag: Visual edit
- 09:31, 17 February 2025 Loop If-Split (hist | edit) [1,908 bytes] Mira.steinmetz (talk | contribs) (Created page with "If-split is an optimization technique that restructures loop-nested if-else statements by transforming them into separate independent loops. This transformation simplifies control flow, making data dependency analysis more efficient and increasing the potential for parallel execution. By eliminating branching within a loop, if-split enhances performance, particularly in scenarios where different execution paths can be processed independently. This technique is especially...") Tag: Visual edit
- 09:15, 17 February 2025 Loop Fission (hist | edit) [2,661 bytes] Mira.steinmetz (talk | contribs) (Created page with "Loop unrolling is an optimization technique that reduces the number of iterations in a loop by expanding its body to process multiple elements per iteration. This transformation decreases loop overhead, improves execution efficiency, and can enhance opportunities for parallelization. By reducing control flow instructions, loop unrolling minimizes branching and increases instruction-level parallelism, making it particularly useful for performance-critical applications. Wh...") Tag: Visual edit
- 08:29, 17 February 2025 Loop Unrolling Transformation (hist | edit) [6,996 bytes] Mira.steinmetz (talk | contribs) (Created page with "Obfuscation is a code transformation technique used to make source code difficult to read and understand while preserving its functionality. This process typically involves renaming identifiers, restructuring code, or inserting misleading elements to obscure the original logic. Obfuscation is often used to protect intellectual property, prevent reverse engineering, or secure sensitive logic in software. While the transformed code remains executable, it becomes significan...") Tag: Visual edit originally created as "Loop Unrolling"
- 11:49, 14 February 2025 Explicit Cast Insertion (hist | edit) [2,204 bytes] Mira.steinmetz (talk | contribs) (Created page with "fsdfdsfs") Tag: Visual edit
- 11:41, 14 February 2025 Instruction Simplifier (hist | edit) [1,994 bytes] Mira.steinmetz (talk | contribs) (Created page with "ghghg") Tag: Visual edit
- 09:19, 14 February 2025 Procedure Inline (hist | edit) [26,289 bytes] Mira.steinmetz (talk | contribs) (Created page with "fdfdf") Tag: Visual edit
- 08:50, 14 February 2025 Obfuscation (hist | edit) [4,163 bytes] Mira.steinmetz (talk | contribs) (Created page with "dfsdf") Tag: Visual edit
- 08:26, 14 February 2025 Idiom Recognizer (hist | edit) [2,302 bytes] Mira.steinmetz (talk | contribs) (Created page with "Code sinking is an optimization technique used in source-to-source compilers to improve execution efficiency by moving computations to less frequently executed parts of the code. This transformation reduces redundant calculations by relocating expressions outside loops or behind conditional statements, thereby minimizing execution overhead. By strategically repositioning code, code sinking enhances performance without altering program behavior. Code Sinking Transformati...") Tag: Visual edit
- 13:09, 13 February 2025 Extract Main (hist | edit) [2,214 bytes] Mira.steinmetz (talk | contribs) (Created page with "Extract Main is an optimization technique that restructures a program by converting a selected function into the main function. During this transformation, all function parameters are made global, and any functions not called within the converted function are removed. This simplifies the code structure and reduces dependencies, making it particularly useful for function-level analysis and parallelization. By isolating specific functions, Extract Main helps minimize the s...") Tag: Visual edit
- 12:37, 13 February 2025 Control to Goto Statement (hist | edit) [2,117 bytes] Mira.steinmetz (talk | contribs) (Created page with "Code sinking is an optimization technique used in source-to-source compilers to improve execution efficiency by moving computations to less frequently executed parts of the code. This transformation reduces redundant calculations by relocating expressions outside loops or behind conditional statements, thereby minimizing execution overhead. By strategically repositioning code, code sinking enhances performance without altering program behavior. ==Code Sinking Transformat...") Tag: Visual edit
- 10:07, 13 February 2025 Constant Propagation (hist | edit) [3,064 bytes] Mira.steinmetz (talk | contribs) (Created blank page) Tag: Visual edit
- 09:24, 6 February 2025 Code Sinking (hist | edit) [2,308 bytes] Timo.stripf (talk | contribs) (Created page with " ==Code Sinking Transformation in emmtrix Studio== emmtrix Studio can implement code sinking using #pragma directives or via the GUI. CodeSinking is a transformation that tries to move code parts to valid positions that are executed less often. === Typical Usage and Benefits === The transformation is used to optimize the runtime of the application by moving code parts out of loops or behind conditions to reduce the number of times the code is executed. === Example ===...") Tag: Visual edit
- 11:06, 28 January 2025 Finding Highest ULP of Math Functions (hist | edit) [7,557 bytes] Timo.stripf (talk | contribs) (Created page with " This article discusses methods for measuring and finding the maximum Unit in the Last Place (ULP) error in floating-point math functions. It covers both single-precision (binary32) and double-precision (binary64) IEEE 754 formats, highlighting the impracticality of exhaustive search for large input spaces and presenting a universal search algorithm that focuses on identifying inputs likely to produce large errors. == Background == In the IEEE 754 single-precision fo...") Tag: Visual edit: Switched
- 01:42, 10 December 2024 emmtrix Code Vectorizer (hist | edit) [2,785 bytes] Timo.stripf (talk | contribs) (Created page with "emmtrix Code Vectorizer is a C source-to-source compiler that vectorizes") Tag: Visual edit