coq-gc

Formal Verification of an Incremental Garbage Collector We specify an incremental garbage collection algorithm and we give a formal proof of its correctness. The algorithm is represented as an infinite transition system and we establish safety and liveness properties. This work relies on an axiomatization of LTL and is based on a co-inductive representation of programs executions. Although motivated by integrating the dynamic memory management to the Java Card platform, this study applies more generally to real-time embedded systems and to devices with virtually infinite memory.

opam install coq-gc.8.5.0
homepage
https://github.com/coq-contribs/gc
license
proprietary
bugs tracker
https://github.com/coq-contribs/gc/issues
dependencies
coq (>= 8.5 & < 8.6~)
source
https://github.com/coq-contribs/gc/archive/v8.5.0.tar.gz
package
https://github.com/coq/opam-coq-archive/tree/master/released/packages/coq-gc/coq-gc.8.5.0