awesome-repositories.com
博客
MCP
awesome-repositories.com

通过 AI 驱动的搜索,发现最优秀的开源仓库。

探索精选搜索开源替代品自托管软件博客网站地图
项目MCP 服务器关于排名机制媒体报道
法律隐私政策服务条款
© 2026 Bringes Technology SRL·VAT RO45896025·hello@awesome-repositories.com
·

6 个仓库

Awesome GitHub RepositoriesConstraint-Based Value Analysis

Static analysis techniques that solve systems of constraints to track variable ranges and pointer offsets.

Distinct from Range Constraints: Candidates focus on runtime value enforcement or random test data constraints, not static program analysis via constraint solving.

Explore 6 awesome GitHub repositories matching programming languages & runtimes · Constraint-Based Value Analysis. Refine with filters or upvote what's useful.

Awesome Constraint-Based Value Analysis GitHub Repositories

用 AI 发现最棒的仓库。我们将通过 AI 为您搜索最匹配的仓库。
  • consensys/mythrilConsenSys 的头像

    ConsenSys/mythril

    4,251在 GitHub 上查看↗

    Mythril 是一个以太坊虚拟机 (EVM) 智能合约安全分析器,使用符号执行在部署前识别字节码中的漏洞。它作为一个漏洞扫描器和形式化审计工具,将程序输入视为数学符号,以证明合约逻辑中存在漏洞。 该工具执行字节码级分析,以检测可能被高级编译器隐藏的缺陷。它集成了 SMT 求解器来确定特定漏洞状态是否可达,并将符号执行跟踪与已知安全缺陷签名库进行比较。 该项目涵盖了广泛的安全分析功能,包括区块链漏洞检测、合约逻辑的形式化审计以及自动化安全测试。它还提供 Git 工作流集成,以在提交过程中验证代码。

    Integrates SMT solvers to mathematically prove the reachability of specific vulnerability states.

    Python
    在 GitHub 上查看↗4,251
  • jonathansalwan/tritonJonathanSalwan 的头像

    JonathanSalwan/Triton

    4,202在 GitHub 上查看↗

    Triton is a dynamic binary analysis framework designed to automate reverse engineering. It functions as a multi-architecture CPU emulator, an SMT-based symbolic execution engine, and a dynamic taint analysis tool. The framework translates raw machine instructions into abstract syntax trees, allowing it to represent binary program logic as a structured intermediate representation. This allows the system to map multiple hardware instruction sets to a single analysis framework and translate machine instructions into mathematical formulas for solving constraints. Its capabilities cover the simul

    Translates machine instructions into mathematical formulas for formal analysis using SMT-based constraint solvers.

    C++
    在 GitHub 上查看↗4,202
  • nasa-sw-vnv/ikosNASA-SW-VnV 的头像

    NASA-SW-VnV/ikos

    3,115在 GitHub 上查看↗

    Ikos is a formal verification suite and static analysis framework designed to prove the absence of undefined behaviors and runtime errors in C and C++ source code. It functions as an abstract interpretation tool that approximates program execution to identify potential crashes and software defects. The system utilizes a compiler front-end to translate source code into a specialized abstract representation. This process decouples language parsing from the analysis logic, allowing the framework to perform deep program analysis via a formal verification system. The toolkit covers several analys

    Tracks variable ranges and pointer offsets by solving systems of constraints during program traversal.

    C++abstract-interpretationprogram-analysissoftware-verification
    在 GitHub 上查看↗3,115
  • model-checking/kanimodel-checking 的头像

    model-checking/kani

    2,943在 GitHub 上查看↗

    Kani is a formal verification tool and model checker for Rust. It functions as a bit-precise static analyzer that mathematically proves the correctness and memory safety of code by exhaustively analyzing program states to identify undefined behavior, panics, and logic errors. The tool identifies bugs by producing concrete counterexamples when program assertions or safety contracts are violated. It enables the definition of function contracts through preconditions and postconditions to verify that inputs and outputs match expected behavior. The system provides capabilities for Rust program an

    Translates program logic into mathematical constraints to prove the absence of bugs using SMT solvers.

    Rustmodel-checkingrustverification
    在 GitHub 上查看↗2,943
  • svf-tools/svfSVF-tools 的头像

    SVF-tools/SVF

    1,684在 GitHub 上查看↗

    SVF is an open-source static program analysis framework and points-to analysis library that tracks memory references, variable aliases, and data dependencies across whole programs. The platform translates compiled intermediate code formats into unified internal representations, constructing constraint graphs, call graphs, and control-flow graphs to model interprocedural execution behavior and memory state. The framework incorporates specialized engines for flow-sensitive, flow-insensitive, and context-sensitive pointer analysis alongside sparse value-flow graph generation. It features memory

    Builds constraint graphs for inclusion-based pointer analysis by iteratively resolving and adding copy edges.

    C++code-analysiscode-securitydependency-analysis
    在 GitHub 上查看↗1,684
  • verilog-to-routing/vtr-verilog-to-routingverilog-to-routing 的头像

    verilog-to-routing/vtr-verilog-to-routing

    1,241在 GitHub 上查看↗

    This project is an open-source computer-aided design toolchain designed for the synthesis, placement, and routing of hardware designs onto programmable logic architectures. It serves as a comprehensive framework for research and development, enabling the transformation of hardware description language designs into optimized netlists and physical implementation files. By providing a modular pipeline, the system facilitates the entire flow from initial logic synthesis to the generation of configuration data for programmable hardware devices. The toolchain distinguishes itself through its focus

    The toolchain evaluates the performance of a design by applying timing constraints and verifying that the implementation meets required signal propagation speeds.

    C++cadedafpga
    在 GitHub 上查看↗1,241
  1. Home
  2. Programming Languages & Runtimes
  3. Constraint-Based Value Analysis

探索子标签

  • Constraint Graph SolversAlgorithms that build and resolve constraint graphs for pointer and value-flow analysis. **Distinct from Constraint-Based Value Analysis:** Distinct from Constraint-Based Value Analysis: focuses on constructing and resolving graph-based constraints rather than tracking general value ranges.
  • SMT-Based Constraint SolvingThe use of Satisfiability Modulo Theories solvers to prove program properties via mathematical constraints. **Distinct from Constraint-Based Value Analysis:** Constraint-Based Value Analysis is a general technique; SMT-based solving is a specific mathematical approach for formal proofs.
  • Timing Constraint AnalyzersAnalytical tools that verify hardware designs against signal propagation speed requirements. **Distinct from Constraint-Based Value Analysis:** Distinct from Constraint-Based Value Analysis: focuses on hardware timing and signal propagation analysis rather than static program value analysis.