Skip to content
@dynaroars

DynaRoars

DynaRoars Lab at George Mason University
README.md

Code repository of the Dynaroars lab at George Mason University.

Pinned Loading

  1. 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 41 6

  2. npbench Public

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

    TeX 12 1

  3. gentree Public

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

    C 1 1

  4. 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++ 5 2

  5. dynaroars.github.io Public

    Dynaroars Website

    HTML 67 6

Repositories

Showing 10 of 30 repositories
  • phd-cs-us Public

    This handbook helps demystify the PhD admission process in Computer Science in US universities.

    TeX 94 10 1 0 Updated Mar 25, 2025
  • relusplitter Public
    Python 0 0 0 0 Updated Mar 24, 2025
  • neuralsat Public

    DPLL(T)-based Verification tool for DNNs

    Python 14 MIT 0 5 0 Updated Mar 24, 2025
  • 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 41 MIT 6 6 0 Updated Mar 21, 2025
  • COOL-Language-Support Public
    Python 3 0 0 0 Updated Mar 18, 2025
  • dynaroars.github.io Public

    Dynaroars Website

    HTML 67 6 0 0 Updated Mar 15, 2025
  • symbolic-execution-analysis Public
    Python 0 0 0 0 Updated Jan 16, 2025
  • vnncomp-benchmark-generation Public
    Python 0 MIT 1 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++ 5 MIT 2 3 0 Updated Apr 2, 2024
  • neuralbench Public

    Collections of neural networks and specifications

    Shell 0 0 0 0 Updated Mar 9, 2024
View all repositories