Let M = M, +, <, 0, S be a linear o-minimal expansion of an ordered group, and G = G, ⊕, eG an n-dimensional group definable in M. We show that if G is definably connected w...
Abstract We propose a novel testing technique for object-oriented programs. Based on the state and activity models of a system, we construct an intermediate representation, which w...
Abstract. Sreedhar et al. [SGL98, Sre95] have presented an eliminationbased algorithm to solve data flow problems. A thorough analysis of the algorithm shows that the worst-case pe...
In this paper we present an algorithm for generating quadratic assignment problem (QAP) instances with known provably optimal solution. The flow matrix of such instances is constru...
This paper presents a hierarchical case representation using a context guided retrieval method. The performance of this method is compared to that of a simpler flat file represe...