kmicinski / program-analysis
Program analysis grad seminar at SU (2019)
☆57Updated 4 years ago
Alternatives and similar repositories for program-analysis:
Users that are interested in program-analysis are comparing it to the libraries listed below
- Symbolic execution engine for toy language.☆51Updated 6 years ago
- Notes for CIS 700 (Fall '19) at Syracuse U.☆13Updated 5 years ago
- Lecture material for DeepSpec Summer School 2018☆68Updated 6 years ago
- Staged Abstract Interpreters☆65Updated last year
- Parser for the llvm bitcode format☆60Updated 4 months ago
- Unassorted scribbles on formal methods, type theory, category theory, and so on, and so on☆21Updated 11 months ago
- Abstracting Definitional Interpreters☆67Updated 7 years ago
- A graduate seminar on SMT solving and solver-aided systems☆26Updated 2 years ago
- Best of POPL (BOP) Reading Group Memoirs☆67Updated 2 years ago
- This project contains various supporting libraries for lean to reason about protocols.☆42Updated 7 years ago
- GoNative project: formal machines models in Coq☆36Updated 7 years ago
- ☆51Updated last month
- MIT's abstract interpretation class taught by Cousot☆38Updated 10 years ago
- Mostly Automated Synthesis of Correct-by-Construction Programs☆151Updated this week
- A LaTeX package for formatting meta-theory.☆46Updated 4 years ago
- Datalog engine with extensions for integrating analyses☆38Updated 7 years ago
- Lecture material for DeepSpec Summer School 2017☆86Updated 3 years ago
- A Haskell parser for JVM bytecode files☆38Updated last year
- Stratified synthesis for learning machine code instruction semantics☆36Updated 5 months ago
- Coq formalization accompanying the paper: Micro-Policies: A Framework for Verified, Tag-Based Security Monitors☆19Updated 5 years ago
- Sturdy is a library for developing sound static analyses in Haskell.☆60Updated last year
- Haskell bindings to Microsoft's Z3 API (unofficial).☆57Updated 10 months ago
- Coq proofs for the paper "Calculating Correct Compilers"☆30Updated last year
- Haskell implementation of P4F Control-Flow Analysis☆21Updated 2 years ago
- Notes and handouts from OPLSS 2019☆34Updated 5 years ago
- A framework for implementing and certifying impure computations in Coq☆52Updated last year
- An interactive theorem prover based on lambda-tree syntax☆90Updated this week
- A formalization of properties of a simple imperative, memory-safe language.☆19Updated 3 years ago
- Constructive Galois connections☆32Updated 6 years ago
- A cyclic theorem prover framework.☆31Updated 2 weeks ago