23201 search results - page 120 / 4641 » Rewriting Systems with Data |
159
click to vote
LPAR
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. We present a novel way for reasoning about (possibly ir)rational quantifier-free non-linear arithmetic by a reduction to SAT/SMT. The approach is incomplete and dedicated...
180
click to vote
DEBU
2010
15 years 2 months ago
2010
Solid-state disks are currently based on NAND flash and expose a standard disk interface. To accommodate limitations of the medium, solid-state disk implementations avoid rewritin...
173
click to vote
IPPS
2002
IEEE
15 years 10 months ago
2002
IEEE
We present a formalization of a proof of self-stabilization in the Coq proof assistant. Coq is a program allowing to define mathematical objects and properties, and to make proof...
161
click to vote
ICTAI
1996
IEEE
15 years 9 months ago
1996
IEEE
We describe constraint solving using a rule-based approach. The distinction made between deduction rules and strategies by computational systems allows us to improve our understan...
157
click to vote
TACS
1994
Springer
15 years 9 months ago
1994
Springer
In the A-calculus, there is a standard notion of what terms should be considered to be "undefined": the unsolvable terms. There are various equivalent characterisations o...