Formal proof of SCHUR conjugate function

4Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

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. © 2010 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Butelle, F., Hivert, F., Mayero, M., & Toumazet, F. (2010). Formal proof of SCHUR conjugate function. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6167 LNAI, pp. 158–171). https://doi.org/10.1007/978-3-642-14128-7_15

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free