pith. sign in

arxiv: 1004.5034 · v1 · submitted 2010-04-28 · 💻 cs.LO · cs.MS· cs.SC· cs.SE

Formal Proof of SCHUR Conjugate Function

classification 💻 cs.LO cs.MScs.SCcs.SE
keywords proofconjugateformallyfunctionprogramproveformalfunctions
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.