promising-coq
Concurrency semantics
Development of a promising semantics for relaxed-memory concurrency
The Coq development of A Promising Semantics for Relaxed-Memory Concurrency
33 stars
13 watching
5 forks
Language: Coq
last commit: about 1 year ago concurrencypromising-semanticsshared-memory
Related projects:
| Repository | Description | Stars |
|---|---|---|
| | A Coq-based web server written in a functional programming language | 86 |
| | A Coq library for proving properties about stateful systems through parameterized coinduction | 43 |
| | A comprehensive library of verified data structures and algorithms in Coq | 45 |
| | A certified semantics for relational programming language specification, providing verified implementations of syntax and semantics for miniKanren languages | 26 |
| | A comprehensive survey of programming language semantics styles implemented in Coq | 46 |
| | Development of formal semantics and verification tools for imperative languages and functional programming languages. | 64 |
| | Provides definitions and verified translations between various representations of regular languages in the Coq proof assistant | 41 |
| | A framework for verifying causal consistency in distributed key-value stores and their clients using the Coq proof assistant | 32 |
| | A lightweight, low-overhead concurrency library | 360 |
| | Automates formalizing syntactic theories with variable binders in Coq | 52 |
| | This project provides a development environment and software tools for formalizing the semantics of programming languages in the Coq proof assistant. | 21 |
| | A formalisation of Sudoku in Coq to solve the puzzle using a naive Davis-Putnam procedure | 20 |
| | A Coq library that provides a total parser combinator library with support for building parsers and grammars in the language of Coq. | 42 |
| | An introductory course on floating-point numbers and formal proof using Coq | 6 |