Multiway Decision Graphs (MDGs) have been recently proposed as an eecient representation of Extended Finite State Machines (EFSMs), suitable for automatic hardware veriication of Register Transfer Level (RTL) designs 7, 14]. We report here on the results of our research into automatic partitioning of state transition relations described using MDGs. The objective is to achieve the maximum possib...

We study enumeration functions for unimodal sequences of positive integers, where the size of a sequence is the sum of its terms. We survey known results for a number of natural variants of unimodal sequences, including Auluck’s generalized Ferrers diagrams, Wright’s stacks, and Andrews’ convex compositions. These results describe combinatorial properties, generating functions, and asymptotic f...

Homing sequence derivation for nondeterministic finite state machines (NFSMs) has important applications in software/hardware system testing and verification. Unlike prior methods based on explicit tree-based search, this article we formulate the of a preset/adaptive homing terms quantified Boolean formula (QBF) solving. This formulation exploits compact circuit representation NFSMs QBF encodin...

We use generic programming techniques to generate well-typed lambda terms. We encode well-typed terms by generalized algebraic datatypes (GADTs) and existential types. The Spine approach (Hinze et al. 2006; Hinze and Löh 2006) to generic programming supports GADTs, but it does not support the definition of generic producers for existentials. We describe how to extend the Spine approach to suppo...

Generalized association rule mining is an extension of traditional association rule mining to discover more informative rules, given a taxonomy. In this paper, we describe a formal framework for the problem of mining generalized association rules. In the framework, The subset-superset and the parent-child relationships among generalized itemsets are introduced to present the different views of ...