Search Results - "Dramnesc, I."
-
1
Theory Exploration in Theorema: Case Study on Lists
Published in 2012 7th IEEE International Symposium on Applied Computational Intelligence and Informatics (SACI) (01-05-2012)“…We present the systematic build-up in the Theorema system of the theory of lists. This was carried out in parallel with the process of synthesis of some…”
Get full text
Conference Proceeding
-
2
Automated Synthesis of Some Algorithms on Finite Sets
Published in 2012 14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (01-09-2012)“…We start from the set theory axioms and we represent sets by monotone lists (sorted lists without duplications). For this, we define a representation function…”
Get full text
Conference Proceeding -
3
Proof Techniques for Synthesis of Sorting Algorithms
Published in 2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (01-09-2011)“…In the context of constructive synthesis of sorting algorithms, starting from the specification of the problem (input and output conditions), the proof of…”
Get full text
Conference Proceeding -
4
Discovery of inductive algorithms through automated reasoning: A case study on sorting
Published in 2012 IEEE 10th Jubilee International Symposium on Intelligent Systems and Informatics (01-09-2012)“…By constructive proofs of the existence of the sorted version of the input list, we synthesize automatically five inductive sorting algorithms: Selection-Sort,…”
Get full text
Conference Proceeding