3424 search results - page 261 / 685 » Automated Testing of Classes |
188
Voted
CL
2000
Springer
15 years 11 months ago
2000
Springer
Abstract. We consider the problem of specifying and computing consistent answers to queries against databases that do not satisfy given integrity constraints. This is done by simul...
152
click to vote
LICS
1999
IEEE
15 years 11 months ago
1999
IEEE
We give a new decision procedure for the guarded fragment with equality. The procedure is based on resolution with superposition. We argue that this method will be more useful in ...
194
click to vote
LPAR
1999
Springer
15 years 11 months ago
1999
Springer
Abstract. Walther’s estimation calculus was designed to prove the termination of functional programs, and can also be used to solve the similar problem of proving the well-founde...
192
click to vote
TPHOL
1998
IEEE
15 years 11 months ago
1998
IEEE
We show how extensible records with structural subtyping can be represented directly in Higher-Order Logic (HOL). Exploiting some specific properties of HOL, this encoding turns o...
147
click to vote
LOPSTR
1998
Springer
15 years 11 months ago
1998
Springer
Well-quasi orders in general, and homeomorphic embedding in particular, have gained popularity to ensure online termination of program analysis, specialisation and transformation t...