arXiv:1004.5034cs.LO
Formal Proof of SCHUR Conjugate Function
Early discovery. Linked by one identifiable commenter. This paper is outside the main ranking; a mention is not an endorsement.
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.
Where does the "world's fastest" claim come from, and how was it determined? Z3 is a good SMT prover for some formulas that come from program verification, but it is neither uniformly better nor faster than other provers, one of which predates it by what, 10 years? See the…
pascal_cuoqView on HNParent context