Software
LogicGuard is a stream monitor specification language and system. ...
MiniMaple is a software for formal specification and verification of Maple programs. ...
The RISC ProgramExplorer is a computer-supported program reasoning environment for a simple imperative programming language "MiniJava"; it incorporates the RISC ProofNavigator as a semi-automatic proving assistant. The environment has been developed mainly for educational purposes (see this paper for a ...
The RISC ProofNavigator is an interactive proof assistant for supporting formal reasoning about computer programs and computing systems, see the README file and this short paper for the main ideas; it is the core reasoning component of the RISC ProgramExplorer. ...
RISCAL
The RISC Algorithm Language: A Language and Associated Software System for Specifying and Verifying Mathematical Algorithms
The RISC Algorithm Language (RISCAL) is a specification language and associated software system for describing mathematical algorithms, formally specifying their behavior based on mathematical theories, and validating the correctness of algorithms, specifications, and theories by execution/evaluation. The software has been ...
Publications
2025
Equational Generalization Problems with Atom-Variables
Alexander Baumgartner, Temur Kutsia, Daniele Nantes-Sobrinho, Manfred Schmidt-Schauss
In: Intelligent Computer Mathematics - 18th International Conference, CICM 2025, Brasilia, Brazil, October 6-10, 2025, Proceedings, Valeria de Paiva and Peter Koepke (ed.), Lecture Notes in Computer Science 16136, pp. 133-151. 2025. Springer, ISBN 978-3-032-07020-3. [doi]author = {Alexander Baumgartner and Temur Kutsia and Daniele Nantes-Sobrinho and Manfred Schmidt-Schauss},
title = {{Equational Generalization Problems with Atom-Variables}},
booktitle = {{Intelligent Computer Mathematics - 18th International Conference, CICM 2025, Brasilia, Brazil, October 6-10, 2025, Proceedings}},
language = {english},
series = {Lecture Notes in Computer Science},
volume = {16136},
pages = {133--151},
publisher = {Springer},
isbn_issn = {ISBN 978-3-032-07020-3},
year = {2025},
editor = {Valeria de Paiva and Peter Koepke},
refereed = {yes},
length = {19},
url = {https://doi.org/10.1007/978-3-032-07021-0_8}
}
Combining Generalization Algorithms in Regular Collapse-Free Theories
Mauricio Ayala-Rincón, David Cerna, Temur Kutsia, Christophe Ringeissen
In: Proceedings of the 10th International Conference on Formal Structures for Computation and Deduction (FSCD 2025), Maribel Fernandez (ed.), LIPIcs - Leibniz International Proceedings in Informatics 337, pp. 7:1-7:18. 2025. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, ISBN 978-3-95977-374-4. [doi]author = {Mauricio Ayala-Rincón and David Cerna and Temur Kutsia and Christophe Ringeissen},
title = {{Combining Generalization Algorithms in Regular Collapse-Free Theories}},
booktitle = {{Proceedings of the 10th International Conference on Formal Structures for Computation and Deduction (FSCD 2025)}},
language = {english},
series = {LIPIcs - Leibniz International Proceedings in Informatics},
volume = {337},
pages = {7:1--7:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
isbn_issn = {ISBN 978-3-95977-374-4},
year = {2025},
editor = {Maribel Fernandez},
refereed = {yes},
length = {0},
url = {https://doi.org/10.4230/LIPIcs.FSCD.2025.7}
}
Semantics-Based Rapid Prototyping of a Subset of SQL
Wolfgang Schreiner, William Steingartner
Technical report no. 25-02 in RISC Report Series, Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz, Austria. ISSN 2791-4267 (online). February 2025. Licensed under CC BY 4.0 International. [doi] [pdf]author = {Wolfgang Schreiner and William Steingartner},
title = {{Semantics-Based Rapid Prototyping of a Subset of SQL}},
language = {english},
abstract = {This report documents the application of our semantics-based language generator SLANG to developing a rapid prototype of a non-trivial domain-specific language, a substantial subset of the Structured Query Language SQL that we have named SubSQL. After developing a mathematical/logical formulation of the language’s abstract syntax, formal type system, and denotational semantics, we have translated this formulation into a SLANG specification from which the SLANG software generates Java code that implements a parser, a printer, a type-checker, and an executor of the language. This implementation is based on several manually created Java classes that implement the mathematical domains and operations used in the formalization, a simple persistent database, and a high-level application programming interface that allows to execute complete SubSQL scripts from file or individual SubSQL commands within Java programs. The results represent a blueprint for the semantics-based development of other domain-specific languages of similar complexity.},
number = {25-02},
year = {2025},
month = {February},
keywords = {formal semantics of programming languages, domain specific languages, rapid prototyping, interpreters},
sponsor = {Aktion Österreich–Slowakei project 2024-05-15-001, KEGA project 030TUKE-4/2023},
length = {179},
license = {CC BY 4.0 International},
type = {RISC Report Series},
institution = {Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz},
address = {Altenberger Straße 69, 4040 Linz, Austria},
issn = {2791-4267 (online)}
}
Executable Semantics for Teaching Concatenative Stack-Based DSLs: The Case of StackLang
William Steingartner, Wolfgang Schreiner
In: New Trends in Database and Information Systems, ADBIS 2025 Short Papers, Doctoral Consortium and Tutorials, Tampere, Finland, September 23-26, 2025, Proceedings, Panos K. Chrysanthis, Kjetil Nørvåg, Kostas Stefanidis, Zheying Zhang, Elisa Quintarelli, Ester Zumpano (ed.), Communications in Computer and Information Science (CCIS) 2676, pp. 248-263. 2025. Springer, Cham, Switzerland, ISBN 978-3-032-05726-6. [doi]author = {William Steingartner and Wolfgang Schreiner},
title = {{Executable Semantics for Teaching Concatenative Stack-Based DSLs: The Case of StackLang}},
booktitle = {{New Trends in Database and Information Systems, ADBIS 2025 Short Papers, Doctoral Consortium and Tutorials, Tampere, Finland, September 23-26, 2025, Proceedings}},
language = {english},
abstract = {In the context of teaching computer science, many domain-specific languages (DSLs) used for data manipulation and transformation follow imperative paradigms, yet their semantics remain informal or tool-dependent. This paper proposes a pedagogical framework based on executable formal semantics to improve conceptual understanding and practical competence in such DSLs. Using a minimal imperative DSL developed as a teaching tool to illustrate arithmetic and data transformations, we define its syntax and semantics using denotational semantics and develop an executable interpreter directly derived from the formal rules. The framework enables students to explore and visualize the effects of each language construct, reason about program behavior, and verify correctness properties. We present a case study in which we focus on the gradual use of cross-curricular relationships and gradually build a comprehensive package for students that draws on knowledge from several courses focused on formal methods in software engineering. The paper concludes with a discussion of the potential of this methodology to bridge the gap between formal methods and practical education in the field of computer science.},
series = {Communications in Computer and Information Science (CCIS)},
volume = {2676},
pages = {248--263},
publisher = {Springer},
address = {Cham, Switzerland},
isbn_issn = {ISBN 978-3-032-05726-6},
year = {2025},
editor = {Panos K. Chrysanthis and Kjetil Nørvåg and Kostas Stefanidis and Zheying Zhang and Elisa Quintarelli and Ester Zumpano},
refereed = {yes},
keywords = {formal semantics, domain-specific languages, computer science education},
sponsor = {Aktion Österreich–Slowakei project 2024-05-15-001, KEGA project 030TUKE-4/2023},
length = {15},
url = {https://doi.org/10.1007/978-3-032-05727-3_23}
}
Thinking Programs
Wolfgang Schreiner
Texts & Monographs in Symbolic Computation 2nd edition, 2025. Springer, Cham, Switzerland, Hardcover ISBN 978-3-031-99704-4, Softcover ISBN 978-3-031-99707-5, eBook ISBN 978-3-031-99705-1. [doi]author = {Wolfgang Schreiner},
title = {{Thinking Programs}},
language = {english},
series = {Texts & Monographs in Symbolic Computation},
publisher = {Springer, Cham, Switzerland},
isbn_issn = {Hardcover ISBN 978-3-031-99704-4, Softcover ISBN 978-3-031-99707-5, eBook ISBN 978-3-031-99705-1},
year = {2025},
edition = {2nd},
translation = {0},
length = {641},
url = {https://doi.org/10.1007/978-3-031-99705-1}
}
2024
A Formalization of the General Theory of Quaternions
Thaynara Arielly de Lima, André Luiz Galdino, Bruno Berto de Oliveira Ribeiro, and Mauricio Ayala-Rincón
In: Leibniz International Proceedings in Informatics (LIPIcs), Yves Bertot, Temur Kutsia, and Michael Norrish (ed.), pp. 11:1-11:18. 2024. ISSN 1868-8969.author = {Thaynara Arielly de Lima and André Luiz Galdino and Bruno Berto de Oliveira Ribeiro and and Mauricio Ayala-Rincón},
title = {{A Formalization of the General Theory of Quaternions}},
booktitle = {{Leibniz International Proceedings in Informatics (LIPIcs)}},
language = {english},
pages = {11:1--11:18},
isbn_issn = {ISSN 1868-8969},
year = {2024},
editor = {Yves Bertot and Temur Kutsia and and Michael Norrish},
refereed = {yes},
length = {18}
}
Science and Meditation: Creating the Future (English Translation of "Wissenschaft und Meditation")
Bruno Buchberger
1st edition, 2024. Amazon, 979-8332230837.author = {Bruno Buchberger},
title = {{Science and Meditation: Creating the Future (English Translation of "Wissenschaft und Meditation")}},
language = {english},
publisher = {Amazon},
isbn_issn = { 979-8332230837},
year = {2024},
edition = {1st},
translation = {0},
length = {153}
}
Equational Anti-unification over Absorption Theories
Mauricio Ayala-Rincón, David M. Cerna, Andres Felipe Gonzalez Barragan, Temur Kutsia
In: Automated Reasoning - 12th International Joint Conference, IJCAR 2024, Nancy, France, July 3-6, 2024, Proceedings, Christoph Benzmüller, Marijn J. H. Heule, Renate A. Schmidt (ed.), Lecture Notes in Artificial Intelligence 14740, pp. 317-337. 2024. Springer, ISBN 978-3-031-63500-7. [doi]author = {Mauricio Ayala-Rincón and David M. Cerna and Andres Felipe Gonzalez Barragan and Temur Kutsia},
title = {{Equational Anti-unification over Absorption Theories}},
booktitle = {{Automated Reasoning - 12th International Joint Conference, IJCAR 2024, Nancy, France, July 3-6, 2024, Proceedings}},
language = {english},
series = {Lecture Notes in Artificial Intelligence},
volume = {14740},
pages = {317--337},
publisher = {Springer},
isbn_issn = {ISBN 978-3-031-63500-7},
year = {2024},
editor = {Christoph Benzmüller and Marijn J. H. Heule and Renate A. Schmidt},
refereed = {yes},
length = {21},
url = {https://doi.org/10.1007/978-3-031-63501-4_17}
}
A Formalization of the General Theory of Quaternions
de Lima Thaynara Arielly, Galdino André Luiz, de Oliveira Ribeiro Bruno Berto, Ayala-Rincón Mauricio Bertot, Yves and Kutsia, Temur and Norrish, Michael
In: 15th International Conference on Interactive Theorem Proving (ITP 2024), Bertot, Yves and Kutsia, Temur and Norrish, Michael (ed.), Leibniz International Proceedings in Informatics (LIPIcs) 309, pp. 11:1-11:18. 2024. Dagstuhl, Germany, ISBN 978-3-95977-337-9 ISSN 1868-8969. [url]author = {de Lima Thaynara Arielly and Galdino André Luiz and de Oliveira Ribeiro Bruno Berto and Ayala-Rincón Mauricio Bertot and Yves and Kutsia and Temur and Norrish and Michael},
title = {{A Formalization of the General Theory of Quaternions}},
booktitle = {{15th International Conference on Interactive Theorem Proving (ITP 2024)}},
language = {english},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
volume = {309},
pages = {11:1--11:18},
address = {Dagstuhl, Germany},
isbn_issn = {ISBN 978-3-95977-337-9 ISSN 1868-8969},
year = {2024},
annote = {Keywords: Theory of quaternions, Hamilton’s quaternions, Algebraic formalizations, PVS},
editor = {Bertot and Yves and Kutsia and Temur and Norrish and Michael},
refereed = {yes},
length = {0},
url = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITP.2024.11}
}
Solving Quantitative Equations
Georg Ehling, Temur Kutsia
In: Automated Reasoning - 12th International Joint Conference, IJCAR 2024, Nancy, France, July 3-6, 2024, Proceedings, Christoph Benzmüller, Marijn J. H. Heule, Renate A. Schmidt (ed.), Lecture Notes in Artificial Intelligence 14740, pp. 381-400. 2024. Springer, ISBN 978-3-031-63500-7. [doi]author = {Georg Ehling and Temur Kutsia},
title = {{Solving Quantitative Equations}},
booktitle = {{Automated Reasoning - 12th International Joint Conference, IJCAR 2024, Nancy, France, July 3-6, 2024, Proceedings}},
language = {english},
series = {Lecture Notes in Artificial Intelligence},
volume = {14740},
pages = {381--400},
publisher = {Springer},
isbn_issn = {ISBN 978-3-031-63500-7},
year = {2024},
editor = {Christoph Benzmüller and Marijn J. H. Heule and Renate A. Schmidt},
refereed = {yes},
length = {20},
url = {https://doi.org/10.1007/978-3-031-63501-4_20}
}
Semantics-Based Rapid Prototyping of a Machine Controller Language
Wolfgang Schreiner, William Steingartner
In: 2024 IEEE 17th International Scientific Conference on Informatics, Poprad, Slovakia, November 13-15, Valerie Novitzká, Anikó Szakál (ed.), pp. 348-353. 2024. IEEE, ISBN 979-8-3503-8767-4. [doi]author = {Wolfgang Schreiner and William Steingartner},
title = {{Semantics-Based Rapid Prototyping of a Machine Controller Language}},
booktitle = {{2024 IEEE 17th International Scientific Conference on Informatics, Poprad, Slovakia, November 13-15}},
language = {english},
abstract = {We present the use of the semantics-based language generator SLANG to implement a machine controller language EFSM which is based on the principle of extended finite state machines. SLANG allows to rapidly prototype EFSM by a formal definition of the language's abstract syntax, concrete syntax, type system, and denotational semantics; from this, SLANG generates a parser, a printer, a type checker, and an interpreter for EFSM. Subsequently we implement in EFSM a controller for an (idealized) robot vacuum cleaner and validate its operation by simulation and visualization. Our presentation may thus also serve as a template for the semantics-based rapid prototyping of other domain-specific languages.},
pages = {348--353},
publisher = {IEEE},
isbn_issn = {ISBN 979-8-3503-8767-4},
year = {2024},
editor = {Valerie Novitzká and Anikó Szakál},
refereed = {yes},
keywords = {rapid prototyping, semantics of programming languages, interpreters, automata, embedded systems},
sponsor = {Aktion Österreich-Slowakei grants 2023-03-15-001 and 2024-05-15-001, KEGA project 030TUKE-4/2023},
length = {6},
url = {https://doi.org/10.1109/Informatics62280.2024.10900792}
}
2023
Is ChatGPT Smarter Than Master’s Applicants?
Bruno Buchberger
Technical report no. 23-04 in RISC Report Series, Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz, Austria. ISSN 2791-4267 (online). January 2023. Licensed under CC BY 4.0 International. [doi] [pdf]author = {Bruno Buchberger},
title = {{Is ChatGPT Smarter Than Master’s Applicants?}},
language = {English},
abstract = {During the selection procedure for a particular informatics fellowship program sponsored by Upper Austrian companies, I ask the applicants a couple of simple technical questions about programming, etc., in a Zoom meeting. I put the same questions to the dialogue system ChatGPT, [ChatGPT]. The result surprised me: Nearly all answers of ChatGPT were totally correct and nicely explained. Also, in the dialogues to clarify some critical points in the answers, the explanations by ChatGPT were amazingly clear and goal-oriented.In comparison: I tried out the same questions in the personal Zoom interviews with approximately 30 applicants from five countries. Only the top three candidates (with a GPA of 1.0, i.e., the highest possible GPA in their bachelor’s study) performed approximately equally well in the interview. All the others performed (far) worse than ChatGPT. And, of course, all answers from ChatGPT came within 1 to 10 seconds, whereas most of the human applicants' answers needed lengthy and arduous dialogues.I am particularly impressed by the ability of ChatGPT to extract meaningful and well-structured programs from problem specifications in natural language. In this experiment, I also added some questions that ask for proofs for simple statements in natural language, which I do not ask in the student's interviews. The performance of ChatGPT was quite impressive as far as formalization and propositional logic are concerned. In examples where predicate logic reasoning is necessary, the ChatGPT answers are not (yet?) perfect. I am pleased to see that ChatGPT tries to present the proofs in a “natural style” This is something that I had as one of my main goals when I initiated the Theorema project in 1995. I think we already achieved this in the early stage of Theorema, and we performed this slightly better and more systematically than ChatGPT does.I also tried to develop a natural language input facility for Theorema in 2017, i.e., a tool to formalize natural language statements in predicate logic. However, I could not continue this research for a couple of reasons. Now I see that ChatGPT achieved this goal. Thus, I think that the following combination of methods could result in a significant leap forward:- the “natural style” proving methods that we developed within Theorema (for the automated generation of programs from specifications, the automated verification of programs in the frame of knowledge, and the automated proof of theorems in theories), in particular, my “Lazy Thinking Method” for algorithm synthesis from specifications- and the natural language formalization techniques of ChatGPT.I propose this as a research project topic and invite colleagues and students to contact me and join me in this effort: Buchberger.bruno@gmail.com.},
number = {23-04},
year = {2023},
month = {January},
keywords = {ChatGPT, automated programming, program synthesis, automated proving, formalization of natural language, master's screening},
length = {30},
license = {CC BY 4.0 International},
type = {RISC Report Series},
institution = {Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz},
address = {Altenberger Straße 69, 4040 Linz, Austria},
issn = {2791-4267 (online)}
}
Automated Programming, Symbolic computation, Machine Learning: My Personal View
Bruno Buchberger
Ann. Math. Artif. Intell. 91(5), pp. 569-589. 2023. 1012-2443.author = {Bruno Buchberger},
title = {{Automated Programming, Symbolic computation, Machine Learning: My Personal View}},
language = {english},
journal = {Ann. Math. Artif. Intell.},
volume = {91},
number = {5},
pages = {569--589},
isbn_issn = {1012-2443},
year = {2023},
refereed = {yes},
length = {21}
}
International Young Talents Hotspot Austria
Bruno Buchberger
In: Ideen, die gehen!, W. Schüssel, G. Kneifel (ed.), pp. 37-39. 2023. Edition Kleine Zeitung, 20234.author = {Bruno Buchberger},
title = {{International Young Talents Hotspot Austria}},
booktitle = {{Ideen, die gehen!}},
language = {english},
pages = {37--39},
publisher = {Edition Kleine Zeitung},
isbn_issn = {20234},
year = {2023},
editor = {W. Schüssel and G. Kneifel},
refereed = {no},
length = {3}
}
Wissenschaft und Meditation: Auf dem Weg zur bewussten Naturgesellschaft
Bruno Buchberger
1st edition, December 2023. Amazon, 979-8868299117.author = {Bruno Buchberger},
title = {{Wissenschaft und Meditation: Auf dem Weg zur bewussten Naturgesellschaft}},
language = {german},
publisher = {Amazon},
isbn_issn = {979-8868299117},
year = {2023},
month = {December},
edition = {1st},
translation = {0},
length = {184}
}
Anti-unification and Generalization: a Survey
David Cerna, Temur Kutsia
In: Proceedings of IJCAI 2023 - 32nd International Joint Conference on Artifical Intelligence, Edith Elkind (ed.), pp. 6563-6573. 2023. ijcai.org, ISBN 978-1-956792-03-4 . [doi]author = {David Cerna and Temur Kutsia},
title = {{Anti-unification and Generalization: a Survey}},
booktitle = {{Proceedings of IJCAI 2023 - 32nd International Joint Conference on Artifical Intelligence}},
language = {english},
pages = {6563--6573},
publisher = {ijcai.org},
isbn_issn = {ISBN 978-1-956792-03-4 },
year = {2023},
editor = {Edith Elkind},
refereed = {yes},
length = {11},
url = {https://doi.org/10.24963/ijcai.2023/736}
}
Equational Anti-Unification over Absorption Theories
Mauricio Ayala-Rincón, David M. Cerna, Andres Felipe Gonzalez Barragan, Temur Kutsia
arXiv:2310.11136. Technical report, 2023. [doi]author = {Mauricio Ayala-Rincón and David M. Cerna and Andres Felipe Gonzalez Barragan and Temur Kutsia},
title = {{Equational Anti-Unification over Absorption Theories}},
language = {english},
year = {2023},
institution = {arXiv:2310.11136},
length = {23},
url = {https://doi.org/10.48550/arXiv.2310.11136}
}
Concrete Abstractions
Wolfgang Schreiner
Texts & Monographs in Symbolic Computation 1st edition, 2023. Springer, Cham, Switzerland, Hardcover ISBN 978-3-031-24933-4, Softcover ISBN 978-3-031-24936-5, eBook ISBN 978-3-031-24934-1. [doi]author = {Wolfgang Schreiner},
title = {{Concrete Abstractions}},
language = {english},
series = {Texts & Monographs in Symbolic Computation},
publisher = {Springer},
address = {Cham, Switzerland},
isbn_issn = {Hardcover ISBN 978-3-031-24933-4, Softcover ISBN 978-3-031-24936-5, eBook ISBN 978-3-031-24934-1},
year = {2023},
edition = {1st},
translation = {0},
keywords = {logic in computer science, model checking, formal modeling and reasoning, program specification and verification, discrete structures and algorithms, nondeterminism and concurrency},
length = {270},
url = {https://doi.org/10.1007/978-3-031-24934-1}
}
The SLANG Semantics-Based Language Generator
Wolfgang Schreiner, William Steingartner
Technical report no. 23-13 in RISC Report Series, Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz, Austria. ISSN 2791-4267 (online). September 2023. Licensed under CC BY 4.0 International. [doi] [pdf]author = {Wolfgang Schreiner and William Steingartner},
title = {{The SLANG Semantics-Based Language Generator}},
language = {english},
abstract = {This report documents the SLANG semantics-based language generator. SLANG is a software for generating rapid prototype implementations of programming languages from their formal specifications. Its input is a text file that describes the abstract syntax of a language and its concrete text representation; from this, a parser is generated (utilizing the ANTLR4 tool) that transforms the text representation of a program into its abstract syntax tree and a printer that generates from the abstract syntax tree its text representation. Furthermore, one can equip the language with a formal type system (by logical inference rules) from which a type checker is generated. Finally, one can give the language a formal semantics, in the denotational style (by function equations) and/or in the big-step operational style (by transition steps); from this, a language interpreter is generated. SLANG is implemented in Java and produces Java source code; it should be easy to extend the software also to other target languages.},
number = {23-13},
year = {2023},
month = {September},
keywords = {formal semantics of programming languages, denotational semantics, operational semantics, type systems, interpreters},
sponsor = {Supported by the Slovak Academic Information Agency SAIA project 2023-03-15-001 “Semantics-Based Rapid Prototyping of Domain-Specific Languages”},
length = {59},
license = {CC BY 4.0 International},
type = {RISC Report Series},
institution = {Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz},
address = {Altenberger Straße 69, 4040 Linz, Austria},
issn = {2791-4267 (online)}
}
Formalisation of Relational Algebra and a SQL-like Language with the RISCAL Model Checker
Joachim Borya
Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz, Austria. Bachelor Thesis. May 2023. Also available as RISC Report 23-06. [doi] [pdf]author = {Joachim Borya},
title = {{Formalisation of Relational Algebra and a SQL-like Language with the RISCAL Model Checker}},
language = {english},
abstract = {The relational database model is based on the mathematical concept of relational algebra.Query languages have been developed to make data available quickly without creatingdedicated access procedures that depend on the internal representation of the data. SQL(structured query language) can be seen as a quasi-standard for this. This thesis dealswith the formalization and verification of relational algebra and a small but elementarysubset of SQL with the help of the RISCAL model checker, a software tool for the formalspecification and verification of mathematical theories and algorithms.},
year = {2023},
month = {May},
note = {Also available as RISC Report 23-06},
translation = {0},
institution = {Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz, Austria},
keywords = {formal methods, program verification, model checking, automated theorem proving},
length = {77},
url = {https://doi.org/10.35011/risc.23-06}
}


