Confirmable Workflows in OSCAR
Michael Joswig, Lars Kastner, Benjamin Lorenz
TL;DR
The paper addresses reproducibility of computer algebra workflows, arguing that confirmability requires linking theory, data, code, and environment under the FAIR principles ($F,A,I,R$). It demonstrates an architecture around OSCAR (in Julia) that uses the mrdi-file-format for serialization, project environments, and CI to realize reproducible experiments. Key contributions include practical guidelines for documenting computer algebra experiments, a Julia/OSCAR-based implementation, and integration with MaRDI for long-term data stewardship. This work advances reproducibility and interoperability in mathematical computing, enabling researchers to verify, reuse, and extend results across platforms and over time.
Abstract
We discuss what is special about the reproducibility of workflows in computer algebra. It is emphasized how the programming language Julia and the new computer algebra system OSCAR support such a reproducibility, and how users can benefit for their own work.
