mitre / oldcpsaLinks
Cryptographic Protocol Shapes Analyzer
☆37Updated 3 years ago
Alternatives and similar repositories for oldcpsa
Users that are interested in oldcpsa are comparing it to the libraries listed below
Sorting:
- IPython-style interaction for Cryptol☆15Updated 8 years ago
- Experimental CPSA -- the Cryptographic Protocol Shapes Analyzer experimental version☆19Updated last month
- Topology library for Coq☆12Updated 9 years ago
- Formal topology (and some probability) in Coq☆31Updated 6 years ago
- Implementation of Nuprl's type theory in Coq☆46Updated 11 months ago
- Semantics for Cryptol☆16Updated 7 years ago
- A tool for translating imperative programs to CSP.☆12Updated 8 years ago
- Some scripts for analyzing IMP programs with the Z3 automatic theorem prover, originally written for my Compose 2016 talk.☆15Updated 9 years ago
- Simply-typed lambda calculus (plus several features) -> x86 executables for Linux and Windows☆25Updated 12 years ago
- Inline, type safe X86-64 assembly programming in Agda☆69Updated 6 years ago
- "Toy" SMT Solver for Educational Purposes☆20Updated 12 years ago
- Solutions of the exercises of the HoTT book☆23Updated 8 years ago
- An higher-level LLVM binding for OCaml☆14Updated 8 years ago
- A minimalist implementation of type theory, suitable for experimentation☆15Updated 3 months ago
- ☆14Updated 8 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 5 months ago
- HoTT proofs using experimental induction-induction (mostly about real numbers) (used to contain the HoTT.Classes proofs)☆16Updated 4 years ago
- This project contains various supporting libraries for lean to reason about protocols.☆43Updated 8 years ago
- Finite field and algebraic extension field arithmetic☆51Updated last year
- Parallel Environment for optimal Lambda Calculus Reduction☆28Updated 3 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 5 years ago
- A formalization of properties of a simple imperative, memory-safe language.☆20Updated 4 years ago
- Notes and handouts from OPLSS 2019☆34Updated 6 years ago
- AACMM's generic-syntax, but with QTT-style annotations☆21Updated last year
- A language-generic implementation of equality saturation in Haskell☆21Updated 6 years ago
- Two attempts at formalizing Löb's Theorem, (one based on http://lesswrong.com/lw/t6/the_cartoon_guide_to_l%C3%B6bs_theorem/). Write-up at…☆25Updated 2 years ago
- Coq formalization of decision procedures for regular expression equivalence [maintainer=@anton-trunov]☆14Updated last year
- A certified semantics for relational programming workout.☆26Updated 5 years ago
- Haskell implementation of P4F Control-Flow Analysis☆21Updated 3 years ago
- ☆21Updated 9 years ago