ANSI Common Lisp
QuickCheck: a lightweight tool for random testing of Haskell programs
ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
Efficient Reasoning about Executable Specifications in Coq
TPHOLs '02 Proceedings of the 15th International Conference on Theorem Proving in Higher Order Logics
A Mechanized Proof of the Basic Perturbation Lemma
Journal of Automated Reasoning
Effective homology of bicomplexes, formalized in Coq
Theoretical Computer Science
Proving with ACL2 the correctness of simplicial sets in the kenzo system
LOPSTR'10 Proceedings of the 20th international conference on Logic-based program synthesis and transformation
Applying ACL2 to the formalization of algebraic topology: simplicial polynomials
ITP'11 Proceedings of the Second international conference on Interactive theorem proving
Towards a certified computation of homology groups for digital images
CTIC'12 Proceedings of the 4th international conference on Computational Topology in Image Context
Computing persistent homology within Coq/SSReflect
ACM Transactions on Computational Logic (TOCL)
Verifying a plaftorm for digital imaging: a multi-tool strategy
CICM'13 Proceedings of the 2013 international conference on Intelligent Computer Mathematics
Hi-index | 0.00 |
In this paper, we present a formalization of an algorithm to construct admissible discrete vector fields in the Coq theorem prover taking advantage of the SSReflect library. Discrete vector fields are a tool which has been welcomed in the homological analysis of digital images since it provides a procedure to reduce the amount of information but preserving the homological properties. In particular, thanks to discrete vector fields, we are able to compute, inside Coq, homological properties of biomedical images which otherwise are out of the reach of this system.