#### Filter Results:

#### Publication Year

1993

2016

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

Theorema is a project that aims at supporting the entire process of mathematical theory exploration within one coherent logic and software system. This survey paper illustrates the style of Theorema-supported mathematical theory exploration by a case study (the automated synthesis of an algorithm for the construction of Gröbner Bases) and gives an overview… (More)

A generalization of the binary algorithm for operation at 'word level " by using a new concept of 'modular conjugates " computes the GCD of multiprecision integers two times faster than Lehmer–Euclid method. Most importantly, however, the new algorithm is suitable for systolic parallelization, in 'least-significant digits jirst " pipelined manner and for… (More)

The Theorema project aims at extending current computer algebra systems by facilities for supporting mathematical proving. The present early-prototype version of the The-orema software system is implemented in Mathematica 3.0. The system consists of a general higher-order predicate logic prover and a collection of special provers that call each other… (More)

Combining Karatsuba multiplication with a technique developed by Krandick for computing the high-order part of the quotient, we obtain an integer division algorithm which is only two times slower, on average, than Karatsubamultipli-cation. Thernain idea istodelay part of the dividend update until this can be done by multiplication between large balanced… (More)

— We present an algorithm that generates automatically (algebraic) invariant properties of a loop with conditionals. In the proposed algorithm program analysis is performed in order to transform the code into a form for which algebraic and combinatorial techniques can be applied to obtain invariant properties. These invariants are then used for verifying… (More)

We describe practical experiments of program verification in the frame of the Theorema system. This includes both imperative programs (using Hoare logic), as well as functional programs (using fixpoint theory). For a certain class of imperative programs we are able to generate automatically the loop invariants and then verification conditions, by using… (More)

—In the context of constructive synthesis of sorting algorithms, starting from the specification of the problem (input and output conditions), the proof of existence of a sorted tuple is performed inductively and we design, implement, and experiment with different proof techniques: First we use a back-chaining mechanism similar to a Prolog engine for first… (More)

Division of integers is called exact if the remainder is zero. We show that the high-order part and the low-order part of the exact quotient can be computed independently from each other. A sequential implementation of this algorithm is up to twice as fast as ordinary exact division and four times as fast as the general classical division algorithm if the… (More)