Sciweavers

81 search results - page 2 / 17
» Rewrite Systems for Integer Arithmetic
Sort
View
CSL
2007
Springer
15 years 4 months ago
Unbounded Proof-Length Speed-Up in Deduction Modulo
In 1973, Parikh proved a speed-up theorem conjectured by G¨odel 37 years before: there exist arithmetical formulæ that are provable in first order arithmetic, but whose shorter ...
Guillaume Burel
SYNASC
2005
IEEE
117views Algorithms» more  SYNASC 2005»
15 years 3 months ago
Functional-Based Synthesis of Systolic Online Multipliers
— Systolic online algorithms for the multiplication of univariate polynomials and of multiple precision integers are synthesised using a novel method based on the following funct...
Tudor Jebelean, Laura Szakacs
CADE
2010
Springer
14 years 11 months ago
MUNCH - Automated Reasoner for Sets and Multisets
This system description provides an overview of the MUNCH reasoner for sets and multisets. MUNCH takes as the input a formula in a logic that supports expressions about sets, multi...
Ruzica Piskac, Viktor Kuncak
FLOPS
2008
Springer
14 years 11 months ago
Certified Exact Real Arithmetic Using Co-induction in Arbitrary Integer Base
In this paper we describe some certified algorithms for exact real arithmetic based on co-recursion. Our work is based on previous experiences using redundant digits of base 2 but ...
Nicolas Julien
CADE
2007
Springer
15 years 10 months ago
A Sequent Calculus for Integer Arithmetic with Counterexample Generation
We introduce a calculus for handling integer arithmetic in first-order logic. The method is tailored to Java program verification and meant to be used both as a supporting procedur...
Philipp Rümmer