Skip to content
@dynaroars

DynaRoars

DynaRoars Lab at George Mason University
README.md

Code repository of the Dynaroars lab at George Mason University.

Pinned

  1. dig dig Public

    DIG is a numerical invariant generation tool. It infers program invariants or properties over (i) program execution traces or (ii) program source code. DIG supports many forms of numerical invarian…

    Python 35 6

  2. npbench npbench Public

    a collection of benchmarks (in DIMACS format) for various NP-Complete problems

    TeX 9 2

  3. gentree gentree Public

    GenTree: Using Decision Trees to Learn Interactions for Configurable Software (ICSE 21)

    C 1 1

  4. dynaplex dynaplex Public

    A tool for inferring program complexity, e.g., O(nlogn), O(n^2), O(2^n). Dynaplex uses dynamic analysis to infer recurrence relations and then solve them for closed form solutions representing prog…

    C++ 6 1

  5. dynaroars.github.io dynaroars.github.io Public

    Dynaroars Website

    HTML 65 6

Repositories

Showing 10 of 28 repositories
  • dynaroars.github.io Public

    Dynaroars Website

    HTML 65 6 0 0 Updated May 28, 2024
  • dig Public

    DIG is a numerical invariant generation tool. It infers program invariants or properties over (i) program execution traces or (ii) program source code. DIG supports many forms of numerical invariants, including nonlinear equalities, octagonal and interval properties, min/max-plus relations, and congruence relations.

    Python 35 MIT 6 5 0 Updated May 23, 2024
  • symbolic-execution-analysis Public
    Python 0 0 0 0 Updated May 21, 2024
  • neuralsat Public

    DPLL(T)-based Verification tool for DNNs

    Python 10 MIT 0 0 0 Updated May 13, 2024
  • vnncomp-benchmark-generation Public
    Python 0 MIT 0 0 0 Updated May 12, 2024
  • dynaplex Public

    A tool for inferring program complexity, e.g., O(nlogn), O(n^2), O(2^n). Dynaplex uses dynamic analysis to infer recurrence relations and then solve them for closed form solutions representing program complexity bounds.

    C++ 6 MIT 1 3 0 Updated Apr 2, 2024
  • neuralbench Public

    Collections of neural networks and specifications

    Shell 0 0 0 0 Updated Mar 9, 2024
  • maxclique Public

    A parallel, ant-based algorithm for the Maximum Clique problem.

    C++ 2 MIT 0 0 0 Updated Sep 3, 2023
  • coloring Public

    A fast algorithm for solving the Graph Coloring problem and its generalizations (Bandwidth Coloring, Multi Coloring, and Bandwidth Multi Coloring problems)

    C 0 MIT 0 0 0 Updated Sep 2, 2023
  • .github Public
    0 0 0 0 Updated Aug 24, 2023
View all repositories

Top languages

Loading…

Most used topics

Loading…