Search Results for "satisfiability modulo"

This library contains tools for representing clause sets and more general boolean formulas as well as for representing SMT (satisfiability modulo theory) formulas. In addition, a set of tools is included for generating tries of the prime implicates of boolean formulas. Current work includes integrating SMT formuals with these prime implicate generation tools so that prime implicates of SMT formulas may be produced. For a list of publications relating to this project, go to Files -> publications

Souper is a superoptimizer for LLVM IR designed to automatically discover missed optimization opportunities within LLVM’s mid-end optimizers. By leveraging SMT (Satisfiability Modulo Theories) solvers, Souper symbolically analyzes LLVM Intermediate Representation (IR) to synthesize equivalent, more efficient expressions. It identifies peephole optimizations—small instruction-level improvements—that LLVM’s optimizer may overlook, thereby improving compiled code quality. Souper can operate in multiple modes: as a standalone analysis tool that extracts and solves SMT queries from LLVM bitcode, or as an LLVM optimization pass that applies discovered optimizations directly to the IR. ...