A certified module to study digital images with the kenzo system

Authors:
Jó/nathan Heras;Vico Pascual;Julio Rubio
Affiliations:
Departamento de Matem$#225/ticas y Computació/n, Universidad de La Rioja, Logroñ/o, La Rioja, Spain;Departamento de Matem$#225/ticas y Computació/n, Universidad de La Rioja, Logroñ/o, La Rioja, Spain;Departamento de Matem$#225/ticas y Computació/n, Universidad de La Rioja, Logroñ/o, La Rioja, Spain
Venue:
EUROCAST'11 Proceedings of the 13th international conference on Computer Aided Systems Theory - Volume Part I
Year:
2011

Citing 9
Cited 0

Spinor groups and algebraic coding theory

Journal of Combinatorial Theory Series A
Computer-Aided Reasoning: An Approach

Computer-Aided Reasoning: An Approach
Homotopy in digital spaces

Discrete Applied Mathematics
A Mechanized Proof of the Basic Perturbation Lemma

Journal of Automated Reasoning
ACL2 Verification of Simplicial Degeneracy Programs in the Kenzo System

Calculemus '09/MKM '09 Proceedings of the 16th Symposium, 8th International Conference. Held as Part of CICM '09 on Intelligent Computer Mathematics
On the cohomology of 3D digital images

Discrete Applied Mathematics - Special issue: Advances in discrete geometry and topology (DGCI 2003)
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

Kenzo is a Computer Algebra system devoted to Algebraic Topology, written in the Common Lisp programming language. In this paper, programs which allow us to analyze monochromatic digital images with the Kenzo system are presented. Besides a complete automated proof of the correctness of our programs is provided. The proof is carried out using ACL2, a system for proving properties of programs written in (a subset of) Common Lisp.