Search Results - "Jebelean, T."
-
1
An algorithm for automated generation of invariants for loops with conditionals
Published in Seventh International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC'05) (2005)“…We present an algorithm that generates automatically (algebraic) invariant properties of a loop with conditionals. In the proposed algorithm program analysis…”
Get full text
Conference Proceeding -
2
Comparing several GCD algorithms
Published in Proceedings of IEEE 11th Symposium on Computer Arithmetic (1993)“…The execution times of several algorithms for computing the GCD of arbitrary precision integers are compared. These algorithms are the known ones (Euclidean,…”
Get full text
Conference Proceeding -
3
Functional-based synthesis of systolic online multipliers
Published in Seventh International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC'05) (2005)“…Systolic online algorithms for the multiplication of univariate polynomials and of multiple precision integers are synthesised using a novel method based on…”
Get full text
Conference Proceeding -
4
Solution lifting method for handling meta-variables in TH∃OREM
Published in Journal of mathematical sciences (New York, N.Y.) (01-03-2005)Get full text
Journal Article -
5
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 -
6
A Double-Digit Lehmer-Euclid Algorithm for Finding the GCD of Long Integers
Published in Journal of symbolic computation (01-01-1995)“…The use of pairs of double digits in the Lehmer-Euclid multiprecision GCD algorithm halves the number of long multiplications, but a straightforward…”
Get full text
Journal Article -
7
Special Issue on Calculemus-99: Integrating Computation and Deduction Foreword of the Guest Editors
Published in Journal of symbolic computation (01-09-2001)Get full text
Journal Article -
8
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 -
9
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 -
10
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 -
11
Soundness of a Logic-Based Verification Method for Imperative Loops
Published in 2012 14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (01-09-2012)“…We present a logic-based verification method for imperative loops (including ones with abrupt termination) and the automatic proof of its soundness. The…”
Get full text
Conference Proceeding -
12
Bidirectional Exact Integer Division
Published in Journal of symbolic computation (01-04-1996)“…Division of integers is called exactif the remainder is zero. We show that the high-order part and the low-order part of the exact quotient can be computed…”
Get full text
Journal Article -
13
Systolic normalization of rational numbers
Published in Proceedings of International Conference on Application Specific Array Processors (ASAP '93) (1993)“…The authors present a systolic algorithm for normalization of rational numbers which is scalable to arbitrary length operands, and they discuss the possibility…”
Get full text
Conference Proceeding -
14
Multi-Domain Logic and its Applications to SAT
Published in 2008 10th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (01-09-2008)“…We describe a new formalism and special proof methods for a novel generalization of propositional logic, which is especially suitable for solving the…”
Get full text
Conference Proceeding -
15
Designing systolic arrays for integer GCD computation
Published in Proceedings of IEEE International Conference on Application Specific Array Processors (ASSAP'94) (1994)“…We improve the classical result of Brent and Kung (1985) by a factor of 12 in area consumption, while maintaining the same average running time. Global…”
Get full text
Conference Proceeding Journal Article -
16
Design of a systolic coprocessor for rational addition
Published in Proceedings The International Conference on Application Specific Array Processors (1995)“…We design a systolic coprocessor for the addition of signed normalized rational numbers. This is the most complicated rational operation: it involves GCD,…”
Get full text
Conference Proceeding -
17
Combining Logic and Algebraic Techniques for Program Verification in Theorema
Published in Second International Symposium on Leveraging Applications of Formal Methods, Verification and Validation (isola 2006) (01-11-2006)“…We study and implement concrete methods for the verification of both imperative as well as functional programs in the frame of the Theorema system. The…”
Get full text
Conference Proceeding