The enumeration of permutation classes has been accomplished with a variety of techniques. One wide-reaching method is that of enumeration schemes, introduced by Zeilberger and extended by Vatter. In this paper we further extend the method of enumeration schemes to words avoiding permutation patterns. The process of finding enumeration schemes is programmable and allows for the automatic enumer...

We develop a memory-e cient o -line algorithm for the enumeration of global states of a distributed computation. The algorithm allows the parameterization of its memory requirements against the running time. In the extreme case, only one global state of a distributed computation must be held in the memory of the enumerating system at a time. This is particularly useful for debugging of memoryin...

Fault diagnosis is to predict the potential fault sites in a logic IC. In this paper, we particularly address the problem of diagnosing faults that exhibit the so-called Byzantine General’s phenomenon, in which a fault manifests itself as a non-logical voltage level at the fault site. Previously, explicit enumeration was suggested to deal with such a problem. However, it is often too time-consu...

For Affine Control Programs or Static (SCoP), symbolic counting of reuse distances could induce polynomials for each pair. These along with cache capacity constraints lead to non-affine (semi-algebraic) sets; and these sets is considered be a hard problem. The state-of-the-art methods use various exact enumeration techniques relying on existing cardinality algorithms that can efficiently count ...