Sciweavers

81 search results - page 7 / 17
» Rewrite Systems for Integer Arithmetic
Sort
View
RTA
2010
Springer
13 years 11 months ago
Automated Confluence Proof by Decreasing Diagrams based on Rule-Labelling
Decreasing diagrams technique (van Oostrom, 1994) is a technique that can be widely applied to prove confluence of rewrite systems. To directly apply the decreasing diagrams techn...
Takahito Aoto
ACL2
2006
ACM
14 years 1 months ago
Parameterized congruences in ACL2
Support for congruence-based rewriting is built into ACL2. This capability allows ACL2 to treat certain predicate relations ”just like equality” under appropriate conditions a...
David Greve
CASC
2010
Springer
153views Mathematics» more  CASC 2010»
13 years 4 months ago
Implementing Data Parallel Rational Multiple-Residue Arithmetic in Eden
Abstract. Residue systems present a well-known way to reduce computation cost for symbolic computation. However most residue systems are implemented for integers or polynomials. Th...
Oleg Lobachev, Rita Loogen
ATVA
2008
Springer
90views Hardware» more  ATVA 2008»
13 years 9 months ago
Tree Pattern Rewriting Systems
Classical verification often uses abstraction when dealing with data. On the other hand, dynamic XML-based applications have become pervasive, for instance with the ever growing im...
Blaise Genest, Anca Muscholl, Olivier Serre, Marc ...
DSD
2003
IEEE
69views Hardware» more  DSD 2003»
14 years 21 days ago
A VLIW Architecture for Logarithmic Arithmetic
The Logarithmic Number System (LNS) is an alternative to IEEE-754 standard floating-point arithmetic. LNS multiply, divide and square root are easier than IEEE-754 and naturally ...
Mark G. Arnold