Sana Stojanović
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Sana Stojanović has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Predrag Janičić
Department of Computer Science, Faculty of Mathematics, University of Belgrade, Belgrade, Serbia
4 shared publications - Filip Marić
Faculty of Mathematics, University of Belgrade, Belgrade, Serbia
2 shared publications - Julien Narboux
CNRS, Inria, IRIF, Université Paris Cité, Paris, France
2 shared publications - Andrija Urošević
Faculty of Mathematics, University of Belgrade, 11000 Belgrade, Serbia
1 shared publication Julien Narboux
University of Strasbourg
1 shared publicationMarc Bezem
University of Bergen
1 shared publication
Latest Publications
- Open Access
- 1 January 2024
- Published by Centre for Evaluation in Education and Science (CEON/CEES) in Journal of Educational Studies in Mathematics and Computer Science
- Vol. 1 (2) , 37-49
Improving mathematical proving skills through interactive theorem proving
Understanding and constructing proofs of mathematical theorems is a fundamental component of mastering mathematics and developing the logical apparatus. In addition, the theorems in mathematical textbooks are often only understandable through their proofs. However, students sometimes lack the precision needed to write detailed proofs and the understanding of basic proving concepts. In this paper, we propose the use of interactive theorem provers by math teachers with the goal of improving students' mathematical proving skills and understanding of logical rules. This approach utilizes feedback from interactive theorem provers while gradually progressing through carefully selected areas of mathematics and computer science. We propose the focused use of two areas, firstly the subset of elementary mathematical theorems and secondly an area that can be selected by teachers in relation to their subject area (and can include almost any area of mathematics and computer science). The proposed approach was implemented in the elective course "Introduction to Interactive Theorem Proving" for fourth year undergraduate students at the Faculty of Mathematics in Belgrade. The course utilizes the interactive theorem prover Isabelle and encompasses constructing formal proofs of elementary mathematical theorems (selected as the first area) and the formal verification of appropriate functional algorithms (selected as the second area). Upon completion of the course, students attain proficiency to formalize tasks and solutions from international mathematical Olympiads and to verify certain algorithms and data structures. The results of our approach are based on the experience with six generations of students who have carried out a variety of formalization projects from different areas of mathematics and computer science, thus demonstrating the vast applicability of the proposed approach. We show that under intensive teacher guidance, students are quite capable of understanding and constructing formal proofs. This resulted in an extremely positive outcome in the first use of interactive theorem proving at the undergraduate level. The course is designed in such a way that the required prior knowledge is ground-level mathematical knowledge. Thus, it is possible to learn interactive theorem proving in parallel with the mathematical logic courses, with the aim of additionally understanding important logic and proof concepts used in all areas of mathematics from the very beginning.
- 1 January 2024
- Published by Centre for Evaluation in Education and Science (CEON/CEES) in Journal of Educational Studies in Mathematics and Computer Science
- Vol. 1 (2) , 37-49
Open AccessImproving mathematical proving skills through interactive theorem proving
Understanding and constructing proofs of mathematical theorems is a fundamental component of mastering mathematics and developing the logical apparatus. In addition, the theorems in mathematical textbooks are often only understandable through their proofs. However, students sometimes lack the precision needed to write detailed proofs and the understanding of basic proving concepts. In this paper, we propose the use of interactive theorem provers by math teachers with the goal of improving students' mathematical proving skills and understanding of logical rules. This approach utilizes feedback from interactive theorem provers while gradually progressing through carefully selected areas of mathematics and computer science. We propose the focused use of two areas, firstly the subset of elementary mathematical theorems and secondly an area that can be selected by teachers in relation to their subject area (and can include almost any area of mathematics and computer science). The proposed approach was implemented in the elective course "Introduction to Interactive Theorem Proving" for fourth year undergraduate students at the Faculty of Mathematics in Belgrade. The course utilizes the interactive theorem prover Isabelle and encompasses constructing formal proofs of elementary mathematical theorems (selected as the first area) and the formal verification of appropriate functional algorithms (selected as the second area). Upon completion of the course, students attain proficiency to formalize tasks and solutions from international mathematical Olympiads and to verify certain algorithms and data structures. The results of our approach are based on the experience with six generations of students who have carried out a variety of formalization projects from different areas of mathematics and computer science, thus demonstrating the vast applicability of the proposed approach. We show that under intensive teacher guidance, students are quite capable of understanding and constructing formal proofs. This resulted in an extremely positive outcome in the first use of interactive theorem proving at the undergraduate level. The course is designed in such a way that the required prior knowledge is ground-level mathematical knowledge. Thus, it is possible to learn interactive theorem proving in parallel with the mathematical logic courses, with the aim of additionally understanding important logic and proof concepts used in all areas of mathematics from the very beginning.
- Open Access
- 30 October 2020
- Published by Open Publishing Association in Electronic Proceedings in Theoretical Computer Science
- Vol. 328, 35-55
Formalizing IMO Problems and Solutions in Isabelle/HOL
The International Mathematical Olympiad (IMO) is perhaps the most celebrated mental competition in the world and as such is among the greatest grand challenges for Artificial Intelligence (AI). The IMO Grand Challenge, recently formulated, requires to build an AI that can win a gold medal in the competition. We present some initial steps that could help to tackle this goal by creating a public repository of mechanically checked solutions of IMO Problems in the interactive theorem prover Isabelle/HOL. This repository is actively maintained by students of the Faculty of Mathematics, University of Belgrade, Serbia within the course "Introduction to Interactive Theorem Proving".
- 30 October 2020
- Published by Open Publishing Association in Electronic Proceedings in Theoretical Computer Science
- Vol. 328, 35-55
Open AccessFormalizing IMO Problems and Solutions in Isabelle/HOL
The International Mathematical Olympiad (IMO) is perhaps the most celebrated mental competition in the world and as such is among the greatest grand challenges for Artificial Intelligence (AI). The IMO Grand Challenge, recently formulated, requires to build an AI that can win a gold medal in the competition. We present some initial steps that could help to tackle this goal by creating a public repository of mechanically checked solutions of IMO Problems in the interactive theorem prover Isabelle/HOL. This repository is actively maintained by students of the Faculty of Mathematics, University of Belgrade, Serbia within the course "Introduction to Interactive Theorem Proving".
- 29 August 2018
- Published by Springer Nature in Annals of Mathematics and Artificial Intelligence
- Vol. 85 (2-4) , 89-117
From informal to formal proofs in Euclidean geometry
- 29 August 2018
- Published by Springer Nature in Annals of Mathematics and Artificial Intelligence
- Vol. 85 (2-4) , 89-117
From informal to formal proofs in Euclidean geometry
- Open Access
- 7 January 2015
- Published by Springer Nature in Annals of Mathematics and Artificial Intelligence
- Vol. 74 (3-4) , 249-269
Automated generation of machine verifiable and readable proofs: A case study of Tarski’s geometry
- 7 January 2015
- Published by Springer Nature in Annals of Mathematics and Artificial Intelligence
- Vol. 74 (3-4) , 249-269
Open AccessAutomated generation of machine verifiable and readable proofs: A case study of Tarski’s geometry
- Open Access
A Vernacular for Coherent Logic
We propose a simple, yet expressive proof representation from which proofs for different proof assistants can easily be generated. The representation uses only a few inference rules and is based on a frag- ment of first-order logic called coherent logic. Coherent logic has been recognized by a number of researchers as a suitable logic for many ev- eryday mathematical developments. The proposed proof representation is accompanied by a corresponding XML format and by a suite of XSL transformations for generating formal proofs for Isabelle/Isar and Coq, as well as proofs expressed in a natural language form (formatted in LATEX or in HTML). Also, our automated theorem prover for coherent logic exports proofs in the proposed XML format. All tools are publicly available, along with a set of sample theorems.
Open AccessA Vernacular for Coherent Logic
We propose a simple, yet expressive proof representation from which proofs for different proof assistants can easily be generated. The representation uses only a few inference rules and is based on a frag- ment of first-order logic called coherent logic. Coherent logic has been recognized by a number of researchers as a suitable logic for many ev- eryday mathematical developments. The proposed proof representation is accompanied by a corresponding XML format and by a suite of XSL transformations for generating formal proofs for Isabelle/Isar and Coq, as well as proofs expressed in a natural language form (formatted in LATEX or in HTML). Also, our automated theorem prover for coherent logic exports proofs in the proposed XML format. All tools are publicly available, along with a set of sample theorems.
- 1 January 2013
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 181-192
Preprocessing of the Axiomatic System for More Efficient Automated Proving and Shorter Proofs
- 1 January 2013
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 181-192
Preprocessing of the Axiomatic System for More Efficient Automated Proving and Shorter Proofs
- 1 January 2011
- Published by Springer Nature
- p. 201-220
A Coherent Logic Based Geometry Theorem Prover Capable of Producing Formal and Readable Proofs
- 1 January 2011
- Published by Springer Nature
- p. 201-220
A Coherent Logic Based Geometry Theorem Prover Capable of Producing Formal and Readable Proofs