498 search results - page 60 / 100 » Term Rewriting |
ENTCS
2006
14 years 9 months ago
2006
The problem of obtaining small conflict clauses in SMT systems has received a great deal of attention recently. We report work in progress to find small subsets of the current par...
BIRTHDAY
2005
Springer
15 years 3 months ago
2005
Springer
Expander2 is a flexible multi-purpose workbench for interactive rewriting, verification, constraint solving, flow graph analysis and other procedures that build up proofs or co...
131
click to vote
LPAR
2007
Springer
15 years 3 months ago
2007
Springer
Proof nets are a parallel syntax for sequential proofs of linear logic, firstly introduced by Girard in 1987. Here we present and intrinsic (geometrical) characterization of proof...
FSE
2005
Springer
15 years 3 months ago
2005
Springer
For the power consumption model called Hamming weight model, we rewrite DPA attacks in terms of correlation coefficients between two Boolean functions. We exhibit properties of S-b...
ERSHOV
1999
Springer
15 years 2 months ago
1999
Springer
We extend positive supercompilation to handle negative as well as positive information. This is done by instrumenting the underlying unfold rules with a small rewrite system that h...