Name
Abstract | ||
|---|---|---|
This paper explores the certification of properties of an efficient functional program in the area of symbolic computation: the calculation of Gröbner basis of a set of multivariate polynomials. Our experience in the development of industrial systems and the certification of some of its relevant properties has led us to use a methodology consisting of functional programs to write the code and the formal verification of fundamental properties. The functional language OBJECTIVE CAML has been chosen to implement the program. To verify the properties two approaches are explored: manual proofs that reason directly over the source code of the algorithms, applying techniques like equational reasoning, and theorem provers that are used as a tool to help us certify a model of the real system. The chosen proof assistant is COQ. Not only will the certification of the software be taken into consideration but also its efficiency. In addition, we present a graphical interface which eases the use of the program. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1016/j.jsc.2007.07.016 | J. Symb. Comput. |
Keywords | DocType | Volume |
Certifying property,fundamental property,OBJECTIVE CAML,efficient functional program,functional language,Gröbner bases,Buchberger’s algorithm,chosen proof assistant,Formal methods,bner basis,formal verification,Software verification,Theorem provers,functional program,bner base,equational reasoning,source code,Functional programming | Journal | 44 |
Issue | ISSN | Citations |
5 | Journal of Symbolic Computation | 5 |
PageRank | References | Authors |
0.51 | 7 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| J. Santiago Jorge | 1 | 6 | 3.31 |
| Víctor M. Gulias | 2 | 30 | 6.06 |
| Jose L. Freire | 3 | 16 | 1.45 |