Isabela Dramnesc

Proceedings of the Symbolic Computation in Software Science - 10th International Symposium, 2024

Certification of Tail Recursive Bubble-Sort in Theorema and Coq.

[BibT_eX]

[DOI]

Proceedings of the LPAR 2024 Complementary Volume, Port Louis, Mauritius, May 26-31, 2024, 2024

2023

Mechanical Verification of Insert-Sort and Merge-Sort Using Multisets in Theorema.

[BibT_eX]

[DOI]

Proceedings of the 21st IEEE Jubilee International Symposium on Intelligent Systems and Informatics, 2023

2022

Experiments with Automated Reasoning in the Class.

[BibT_eX]

[DOI]

Proceedings of the Intelligent Computer Mathematics - 15th International Conference, 2022

2021

Synthesis of sorting algorithms using multisets in <i>Theorema</i>.

[BibT_eX]

[DOI]

J. Log. Algebraic Methods Program., 2021

Synthesis of Merging algorithms on binary trees using multisets in Theorema.

[BibT_eX]

[DOI]

Proceedings of the 15th IEEE International Symposium on Applied Computational Intelligence and Informatics, 2021

AlCons : Deductive Synthesis of Sorting Algorithms in Theorema.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Aspects of Computing - ICTAC 2021, 2021

2020

Deductive Synthesis of Min-Max-Sort Using Multisets in Theorema.

[BibT_eX]

[DOI]

Proceedings of the 14th IEEE International Symposium on Applied Computational Intelligence and Informatics, 2020

2019

Mechanical synthesis of sorting algorithms for binary trees by logic and combinatorial techniques.

[BibT_eX]

[DOI]

J. Symb. Comput., 2019

Proof-Based Synthesis of Sorting Algorithms Using Multisets in Theorema.

[BibT_eX]

[DOI]

Proceedings of the Proceedings Third Symposium on Working Formal Methods, 2019

Case Studies on Algorithm Discovery from Proofs: The Delete Function on Lists and Binary Trees using Multisets.

[BibT_eX]

[DOI]

Proceedings of the 17th IEEE International Symposium on Intelligent Systems and Informatics, 2019

Automatic Synthesis of Merging and Inserting Algorithms on Binary Trees Using Multisets in Theorema.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Aspects of Computer and Information Sciences, 2019

2016

A case study on algorithm discovery from proofs: The insert function on binary trees.

[BibT_eX]

[DOI]

Proceedings of the 11th IEEE International Symposium on Applied Computational Intelligence and Informatics, 2016

Proof-Based Synthesis of Sorting Algorithms for Trees.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2016

2015

Synthesis of list algorithms by mechanical proving.

[BibT_eX]

[DOI]

J. Symb. Comput., 2015

Combinatorial Techniques for Proof-Based Synthesis of Sorting Algorithms.

[BibT_eX]

[DOI]

Proceedings of the 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2015

Theory exploration of binary trees.

[BibT_eX]

[DOI]

Proceedings of the 13th IEEE International Symposium on Intelligent Systems and Informatics, 2015

A case study in proof based synthesis of algorithms on monotone lists.

[BibT_eX]

[DOI]

Proceedings of the 10th IEEE Jubilee International Symposium on Applied Computational Intelligence and Informatics, 2015

2014

Theory exploration of sets represented as monotone lists.

[BibT_eX]

[DOI]

Proceedings of the IEEE 12th International Symposium on Intelligent Systems and Informatics, 2014

2012

Automated Synthesis of Some Algorithms on Finite Sets.

[BibT_eX]

[DOI]

Proceedings of the 14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2012

Discovery of inductive algorithms through automated reasoning: A case study on sorting.

[BibT_eX]

[DOI]

Proceedings of the 10th IEEE Jubilee International Symposium on Intelligent Systems and Informatics, 2012

Theory Exploration in Theorema: Case Study on Lists.

[BibT_eX]

[DOI]

Proceedings of the 7th IEEE International Symposium on Applied Computational Intelligence and Informatics, 2012

2011

Proof Techniques for Synthesis of Sorting Algorithms.

[BibT_eX]

[DOI]