Notes for CIS 700 (Fall '19) at Syracuse U.
☆13Nov 6, 2019Updated 6 years ago
Alternatives and similar repositories for program-analysis-examples
Users that are interested in program-analysis-examples are comparing it to the libraries listed below
Sorting:
- Interpreter for inference rules☆13May 5, 2018Updated 7 years ago
- Program analysis grad seminar at SU (2019)☆57Mar 2, 2020Updated 6 years ago
- An abstract machine for analyzing Racket bytecode.☆29May 1, 2021Updated 4 years ago
- Formalization of CBPV extended with effect and coeffect tracking☆14Aug 30, 2024Updated last year
- software archaeology of reflective towers of interpreters☆17Jun 6, 2025Updated 9 months ago
- miniKanren with a first-order representation of the search space☆17Mar 11, 2026Updated last week
- An OCaml implementation of the DPLL algorithm for solving SAT instances. Uses nothing beyond the OCaml List library.☆19Sep 5, 2014Updated 11 years ago
- Type inference implementation in OCaml using Algorithm W☆10Aug 26, 2021Updated 4 years ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Jul 4, 2013Updated 12 years ago
- Code from John Harrison's "Handbook of Practical Logic and Automated Reasoning"☆17Oct 23, 2012Updated 13 years ago
- A Redex Model of Rust, or more specifically an encoding of Patina, the formal model for rust's type safety☆41Jun 10, 2014Updated 11 years ago
- bidirectional type checking algorithms for higher-ranked polymorphism☆20Mar 23, 2022Updated 3 years ago
- Abstract interpreter for real-world application programs☆32May 25, 2013Updated 12 years ago
- Implementations of various toy programming languages☆12Apr 19, 2018Updated 7 years ago
- A precise and scalable pointer analysis for LLVM, written in Ascent☆68Mar 1, 2025Updated last year
- Message Differentiation Package☆13Feb 5, 2026Updated last month
- Sigmoid Numbers backed by IEEE Floats☆17Jul 8, 2017Updated 8 years ago
- ☆13Jun 18, 2024Updated last year
- The PGG Partial Evaluation System for Scheme 48☆18Dec 31, 2012Updated 13 years ago
- Generic implementation of different CFA families based on monadic decomposition☆23Jan 16, 2013Updated 13 years ago
- Scalable yet rigorous Floating-point Error Analysis☆11Jul 23, 2025Updated 7 months ago
- Generation of abstract binding trees☆27Sep 26, 2025Updated 5 months ago
- The uncurried minimal functional programming language for CPS transformation☆19Feb 23, 2024Updated 2 years ago
- Examples from the class CMSC 330 during Summer 2015☆49Jul 23, 2015Updated 10 years ago
- An Introduction to Redex with Abstracting Abstract Machines☆104Mar 21, 2024Updated last year
- A model of the WebAssembly language in Redex☆21Mar 25, 2021Updated 4 years ago
- pLiner is a framework that helps programmers identify locations in the source of numerical code that are highly affected by compiler opti…☆17Oct 27, 2023Updated 2 years ago
- Presentation notes from JMU Unix Users Group meetings☆14Mar 7, 2026Updated last week
- Full spectrum sheaf neural network over arbitrary CW complexes.☆16Mar 1, 2026Updated 2 weeks ago
- ✂️ Syntax correction in context-free languages.☆23Mar 13, 2026Updated last week
- A graduate seminar on SMT solving and solver-aided systems☆29Jul 17, 2022Updated 3 years ago
- Rosa, the real compiler☆21Jan 31, 2018Updated 8 years ago
- Exploration of primes, factorization and number theory through haskell☆10Oct 10, 2016Updated 9 years ago
- Assorted pintools☆30Mar 30, 2020Updated 5 years ago
- Experimental implementation of k-CFA and Pushdown k-CFA with optional Abstract Garbage Collection for LambdaJS and a subset of Scheme pro…☆30Nov 24, 2015Updated 10 years ago
- NetBricks: A new network function framework based on Rust.☆12Jan 2, 2026Updated 2 months ago
- SMT-LIB benchmarks for shape computations from deep learning models in PyTorch☆18Dec 21, 2022Updated 3 years ago
- experimental computational medium and supporting tools☆23Mar 13, 2026Updated last week
- Pull your compiler up with abstract bootstraps.☆31Dec 15, 2022Updated 3 years ago