• Home
  • Search
  • Formally Verified Loop-Invariant Code Motion and Assorted Optimizations
  • Open Access IconOpen Access
  • Cite Icon9
  • https://doi.org/10.1145/3529507Copy DOI Icon

Formally Verified Loop-Invariant Code Motion and Assorted Optimizations

Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

We present an approach for implementing a formally certified loop-invariant code motion optimization by composing an unrolling pass and a formally certified yet efficient global subexpression elimination. This approach is lightweight: each pass comes with a simple and independent proof of correctness. Experiments show the approach significantly narrows the performance gap between the CompCert certified compiler and state-of-the-art optimizing compilers. Our static analysis employs an efficient yet verified hashed set structure, resulting in the fast compilation.

Similar Papers
  • Book Chapter
  • Citations1

High-Level Synthesis Using SPARK and Systolic Array

  • Jan 01, 2006
  • Jae-Jin Lee +1
  • Conference Article
  • Citations49

Interprocedural partial redundancy elimination and its application to distributed memory compilation

  • Jun 01, 1995
  • Gagan Agrawal +2
  • Research Article
  • Citations44

A composite hoisting-strength reduction transformation for global program optimization part I

  • Jan 01, 1982
  • International Journal of Computer Mathematics
  • S M Joshi +1
  • Book Chapter
  • Citations38

Static Detection of Loop-Invariant Data Structures

  • Jan 01, 2012
  • Guoqing Xu +2
  • Conference Article
  • Citations7

Iterative Query Processing based on Unified Optimization Techniques

  • Jun 25, 2019
  • Kisung Park +7
  • Book Chapter
  • Citations20

Code motion and code placement: Just synonyms?

  • Jan 01, 1998
  • Jens Knoop +2
  • Conference Article
  • Citations3

The generalized class of g-chain periodic sorting networks

  • Apr 01, 1994
  • D Nassimi +2
  • Book Chapter
  • Citations1

Checking Array Bounds by Abstract Interpretation and Symbolic Expressions

  • Jan 01, 2018
  • Étienne Payet +1
  • Conference Article
  • Citations1

Synthesis of program binaries into FPGA accelerators with runtime dependence validation

  • Dec 01, 2017
  • Shaoyi Cheng +2
  • Research Article
  • Citations20

Harmonicity and invariance on slices of the Boolean cube

  • Feb 04, 2019
  • Probability Theory and Related Fields
  • Yuval Filmus +1
  • Research Article
  • Citations17

GENERAL BRANCHING FUNCTIONS OF AFFINE LIE ALGEBRAS

  • Mar 28, 1995
  • Modern Physics Letters A
  • Stephen Hwang +1
  • Research Article

Technology for inferring contracts from code

  • Nov 10, 2013
  • ACM SIGAda Ada Letters
  • Francesco Logozzo
  • Research Article
  • Citations10

JavaScript Parallelizing Compiler for Exploiting Parallelism from Data-Parallel HTML5 Applications

  • Jan 04, 2016
  • ACM Transactions on Architecture and Code Optimization
  • Yeoul Na +2
  • Research Article
  • Citations1

Bridging Static and Dynamic Program Analysis using Fuzzy Logic

  • Jul 12, 2017
  • Electronic Proceedings in Theoretical Computer Science
  • Jacob Lidman +1
  • Book Chapter
  • Citations11

Random: R-Based Analyzer for Numerical Domains

  • Jan 01, 2012
  • Gianluca Amato +1
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.