Sciweavers

81 search results - page 6 / 17
» Rewrite Systems for Integer Arithmetic
Sort
View
LPAR
2010
Springer
13 years 5 months ago
Interpolating Quantifier-Free Presburger Arithmetic
Craig interpolation has become a key ingredient in many symbolic model checkers, serving as an approximative replacement for expensive quantifier elimination. In this paper, we foc...
Daniel Kroening, Jérôme Leroux, Phili...
SOFSEM
2010
Springer
14 years 4 months ago
Improved Matrix Interpretation
We present a new technique to prove termination of Term Rewriting Systems, with full automation. A crucial task in this context is to find suitable well-founded orderings. A popul...
Pierre Courtieu, Gladys Gbedo, Olivier Pons
FDL
2003
IEEE
14 years 21 days ago
Using Rewriting-Logic Notation for Funcional Verification in Data-Stream Based Reconfigurable Computing
Reconfigurable Systolic Arrays are a generalization of Systolic Arrays where node operations and interconnections can be redefined even at run time. This flexibility increases the...
Mauricio Ayala-Rincón, Ricardo P. Jacobi, C...
ASAP
1996
IEEE
94views Hardware» more  ASAP 1996»
13 years 11 months ago
A New Euclidean Division Algorithm For Residue Number Systems
We propose in this paper a new algorithm and architecture for performing divisions in residue number systems. Our algorithm is suitable for residue number systems with large modul...
Jean-Claude Bajard, Laurent-Stéphane Didier...
CADE
2005
Springer
14 years 7 months ago
An Algorithm for Deciding BAPA: Boolean Algebra with Presburger Arithmetic
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
Viktor Kuncak, Huu Hai Nguyen, Martin C. Rinard