porcupine
Linearizability checker
A tool for checking if the history of concurrent actions can be linearly ordered with respect to a sequential specification.
A fast linearizability checker written in Go 🔎
975 stars
24 watching
54 forks
Language: Go
last commit: 3 months ago Related projects:
Repository | Description | Stars |
---|---|---|
| A Ruby interface to a high-performance machine learning library for large-scale text classification and other linear classifications | 83 |
| A software framework that instantiates high-performance linear algebra libraries | 4 |
| Detects potential misuse of standard library variables in Go code | 43 |
| An algorithm to decide coverability in Petri nets using the Karp-Miller tree construction | 1 |
| A numerical library for OCaml providing tools for linear expressions and optimization | 8 |
| An SMT-based symbolic model checker for TLA+ and Quint | 443 |
| An implementation of intuitionistic linear logic using Haskell. | 83 |
| A Java implementation of LIBLINEAR's large-scale regularized linear classification and regression algorithms | 306 |
| Tools for determining and working with finite data structures in a proof assistant. | 0 |
| A library for parallel programming in Common Lisp | 17 |
| An implementation of bidirectional type checking for higher-rank polymorphism in Haskell | 129 |
| An encoding of linear logic in Coq with minimal examples and automated proofs | 21 |
| Implementation of algorithms for federated linear bandits in multi-agent environments | 1 |
| A Qt plugin that allows QML applications to use incremental linear constraint solver | 54 |
| A benchmarking framework comparing performance of different Rust linear algebra libraries | 200 |