Search Results - "Jebelean, T."

  • Showing 1 - 17 results of 17
Refine Results
  1. 1

    An algorithm for automated generation of invariants for loops with conditionals by Kovacs, L.I., Jebelean, T.

    “…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. 2

    Comparing several GCD algorithms by Jebelean, T.

    “…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. 3

    Functional-based synthesis of systolic online multipliers by Jebelean, T., Szakacs, L.

    “…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. 4
  5. 5

    Theory Exploration in Theorema: Case Study on Lists by Dramnesc, I., Jebelean, T.

    “…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. 6

    A Double-Digit Lehmer-Euclid Algorithm for Finding the GCD of Long Integers by Jebelean, Tudor

    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. 7
  8. 8

    Automated Synthesis of Some Algorithms on Finite Sets by Dramnesc, I., Jebelean, T.

    “…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. 9

    Proof Techniques for Synthesis of Sorting Algorithms by Dramnesc, I., Jebelean, T.

    “…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. 10

    Discovery of inductive algorithms through automated reasoning: A case study on sorting by Dramnesc, I., Jebelean, T.

    “…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. 11

    Soundness of a Logic-Based Verification Method for Imperative Loops by Erascu, M., Jebelean, T.

    “…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. 12

    Bidirectional Exact Integer Division by KRANDICK, WERNER, JEBELEAN, TUDOR

    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. 13

    Systolic normalization of rational numbers by Jebelean, T.

    “…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. 14

    Multi-Domain Logic and its Applications to SAT by Jebelean, T., Kusper, G.

    “…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. 15

    Designing systolic arrays for integer GCD computation by Jebelean, T.

    “…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. 16

    Design of a systolic coprocessor for rational addition by Jebelean, T.

    “…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. 17

    Combining Logic and Algebraic Techniques for Program Verification in Theorema by Kovacs, L., Popov, N., Jebelean, T.

    “…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