论文信息 - Executing in Common Lisp, Proving in ACL2

Executing in Common Lisp, Proving in ACL2

In this paper, an approach to integrate an already-written Common Lisp program for algebraic manipulation with ACL2 proofs of properties of that program is presented. We report on a particular property called "cancellation theorem", which has been proved in ACL2, and could be applied to several problems in the field of Computational Algebraic Topology.

Julio Rubio | Mirian Andrés | Laureano Lambán

[1] Julio Rubio,et al. Constructive algebraic topology , 2002 .

[2] Ana Romero,et al. Computing spectral sequences , 2006, J. Symb. Comput..

[3] Jesús Aransay,et al. Four Approaches to Automated Reasoning with Differential Algebraic Structures , 2004, AISC.

[4] Clemens Ballarin,et al. Towards a higher reasoning level in formalized Homological Algebra , 2002 .

[5] César Domínguez,et al. Modeling Inheritance as Coercion in the Kenzo System , 2006, J. Univers. Comput. Sci..

[6] Pierre Castéran,et al. Interactive Theorem Proving and Program Development , 2004, Texts in Theoretical Computer Science An EATCS Series.

[7] Jesús Aransay,et al. A Mechanized Proof of the Basic Perturbation Lemma , 2008, Journal of Automated Reasoning.

[8] Francisco-Jesús Martín-Mateos,et al. Formal verification of a generic framework to synthesize SAT-provers , 2009, Journal of Automated Reasoning.

[9] Jon P. May. Simplicial objects in algebraic topology , 1993 .

[10] Vico Pascual,et al. An Object-oriented Interpretation of the EAT System , 2003, Applicable Algebra in Engineering, Communication and Computing.

[11] Thérèse Hardin,et al. On the way to certify Computer Algebra Systems , 1999, Calculemus.

[12] César Domínguez,et al. Object oriented institutions to specify symbolic computation systems , 2007, RAIRO Theor. Informatics Appl..

[13] Samuel Eilenberg,et al. On Products of Complexes , 1953 .