Formal Proof of SCHUR Conjugate Function

Abstract : The main goal of our work is to formally prove the correctness of the key commands of the SCHUR software, an interactive program for calculating with characters of Lie groups and symmetric functions. The core of the computations relies on enumeration and manipulation of combinatorial structures. As a first "proof of concept", we present a formal proof of the conjugate function, written in C. This function computes the conjugate of an integer partition. To formally prove this program, we use the Frama-C software. It allows us to annotate C functions and to generate proof obligations, which are proved using several automated theorem provers. In this paper, we also draw on methodology, discussing on how to formally prove this kind of program.
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-00477574
Contributor : Franck Butelle <>
Submitted on : Thursday, April 29, 2010 - 3:13:58 PM
Last modification on : Wednesday, February 6, 2019 - 1:24:12 AM

Links full text

Identifiers

Citation

Franck Butelle, Florent Hivert, Micaela Mayero, Frédéric Toumazet. Formal Proof of SCHUR Conjugate Function. CALCULEMUS 2010, Jul 2010, Paris, France. pp.158-171, ⟨10.1007/978-3-642-14128-7⟩. ⟨hal-00477574⟩

Share

Metrics

Record views

927