Reseña: Programming and reasonning with PowerLists in Coq
Se ha publicado un artículo de razonamiento formalizado en Coq sobre programas paralelos titulado Programming and reasonning with PowerLists in Coq.
Sus autores son
- Frédéric Loulergue (de la Univ. de Orleans, Francia) y
- Virginia Niculescu (de la Univ. Babes-Bolyai de Cluj-Napoca, Rumanía).
Su resumen es
For parallel programs correctness by construction is an essential feature since debugging is almost impossible. To build correct programs by constructions is not a simple task, and usually the methodologies used for this purpose are rather theoretical based on a pen-and-paper style. A better approach could be based on tools and theories that allow a user to develop an efficient parallel application by implementing easily simple programs satisfying conditions, ideally automatically, proved. PowerLists theory and the variants represent a good theoretical base for an approach like this, and Coq proof assistant is a tool that could be used for automatic proofs. The goal of this paper is to model the PowerList theory in Coq, and to use this modelling to program and reason on parallel programs in Coq. This represents the first step in building a framework that ease the development of correct and verifiable parallel programs.
El código de las teorías desarrolladas en Coq se encuentra aquí.