97 search results - page 17 / 20 » Test input generation for red-black trees using abstraction |
ICTAC
2004
Springer
14 years 25 days ago
2004
Springer
We give an inductive method for proving weak innermost termination of rule-based programs, from which we automatically infer, for each successful proof, a finite strategy for data...
DAM
2010
13 years 7 months ago
2010
Abstract. A set of phylogenetic trees with overlapping leaf sets is consistent if it can be merged without conflicts into a supertree. In this paper, we study the polynomial-time a...
COMPGEOM
2006
ACM
13 years 11 months ago
2006
ACM
Despite extensive study over the last four decades and numerous applications, no I/O-efficient algorithm is known for the union-find problem. In this paper we present an I/O-effic...
ML
2006
ACM
14 years 1 months ago
2006
ACM
We present a new way to generate type-error messages in a polymorphic, implicitly, and strongly typed language (specifically Caml). Our method separates error-message generation ...
ICPR
2010
IEEE
13 years 4 months ago
2010
IEEE
Abstract--Rough face alignments lead to suboptimal performance of face identification systems. In this study, we present a novel approach for identifying genders from facial images...