Sciweavers

736 search results - page 100 / 148
» Algorithms for Ordinal Arithmetic
Sort
View
CADE
2004
Springer
14 years 9 months ago
Decision Procedures for Recursive Data Structures with Integer Constraints
This paper is concerned with the integration of recursive data structures with Presburger arithmetic. The integrated theory includes a length function on data structures, thus prov...
Ting Zhang, Henny B. Sipma, Zohar Manna
ICCAD
2005
IEEE
160views Hardware» more  ICCAD 2005»
14 years 5 months ago
Equivalence verification of polynomial datapaths with fixed-size bit-vectors using finite ring algebra
— This paper addresses the problem of equivalence verification of RTL descriptions. The focus is on datapathoriented designs that implement polynomial computations over fixed-s...
Namrata Shekhar, Priyank Kalla, Florian Enescu, Si...
ISSAC
2009
Springer
169views Mathematics» more  ISSAC 2009»
14 years 3 months ago
Computations modulo regular chains
The computation of triangular decompositions involves two fundamental operations: polynomial GCDs modulo regular chains and regularity test modulo saturated ideals. We propose new...
Xin Li, Marc Moreno Maza, Wei Pan
ICASSP
2008
IEEE
14 years 3 months ago
Efficient 4D motion compensated lossless compression of dynamic volumetric medical image data
Dynamic volumetric (four dimensional- 4D) medical images are typically huge in file size and require a vast amount of resources for storage and transmission purposes. In this pape...
Victor Sanchez, Panos Nasiopoulos, Rafeef Abugharb...
FMCAD
2007
Springer
14 years 2 months ago
Lifting Propositional Interpolants to the Word-Level
— Craig interpolants are often used to approximate inductive invariants of transition systems. Arithmetic relationships between numeric variables require word-level interpolants,...
Daniel Kroening, Georg Weissenbacher