Westudy the problemof finding, in a givenword, allmaximal gappedpalindromes verifying two types of constraints, that we call long-armed and length-constrained palindromes. For each of the two classes, we propose an algorithm that runs in time O(n+ S) for a constantsize alphabet, where S is the number of output palindromes. Both algorithms can be extended to compute biological gapped palindromes...

......................................................................................................................................... iii

This paper develops a novel approach for formally verifying both safety and liveness properties of designs using sequential ATPG tools. The properties are automatically mapped into a monitor circuit with a target fault so that finding a test for the fault corresponds to formally establishing the property. The mapping of the properties to the monitor circuit is described in detail and the proces...

ing and Verifying Strategy-proofness for

Model verification and validation is crucial to the credibility of a simulation study. The ability to investigate the detailed behavior of a complex stochastic model that is simulated in a powerful modeling environment like Möbius is important to identify root causes of errors in models or to gain confidence that a model performs as expected. In this paper, we briefly describe how the Traviando...

We call a family G ⊂ P[n] a k-generator of P[n] if every x ⊂ [n] can be expressed as a union of at most k disjoint sets in G. Frein, Lévêque and Sebő [1] conjectured that for any n ≥ k, such a family must be at least as large as the k-generator obtained by taking a partition of [n] into classes of sizes as equal as possible, and taking the union of the power-sets of the classes. We generalize a...