54,542 research outputs found
Answer-set programming as a new approach to event-sequence testing
In many applications, faults are triggered by events that occur in a particular order. Based on the assumption that most bugs are caused by the interaction of a low number of events, Kuhn et al. recently introduced sequence covering arrays (SCAs) as suitable designs for event sequence testing. In practice, directly applying SCAs for testing is often impaired by additional constraints, and SCAs have to be adapted to fit application-specific needs. Modifying precomputed SCAs to account for problem variations can be problematic, if not impossible, and developing dedicated algorithms is costly. In this paper, we propose answer-set programming (ASP), a well-known knowledge-representation formalism from the area of artificial intelligence based on logic programming, as a declarative paradigm for computing SCAs. Our approach allows to concisely state complex coverage criteria in an elaboration tolerant way, i.e., small variations of a problem specification require only small modifications of the ASP representation
-Covering Arrays Generated by a Tiling Probability Model
A t-\a covering array is an matrix, with entries from an
alphabet of size , such that for any choice of rows, and any
ordered string of letters of the alphabet, there exists a column such that
the "values" of the rows in that column match those of the string of letters.
We use the Lov\'asz Local Lemma in conjunction with a new tiling-based
probability model to improve the upper bound on the smallest number of columns
of a t-\a covering array.Comment: 7 page
Modeling high-performance wormhole NoCs for critical real-time embedded systems
Manycore chips are a promising computing platform to cope with the increasing performance needs of critical real-time embedded systems (CRTES). However, manycores adoption by CRTES industry requires understanding task's timing behavior when their requests use manycore's network-on-chip (NoC) to access hardware shared resources. This paper analyzes the contention in wormhole-based NoC (wNoC) designs - widely implemented in the high-performance domain - for which we introduce a new metric: worst-contention delay (WCD) that captures wNoC impact on worst-case execution time (WCET) in a tighter manner than the existing metric, worst-case traversal
time (WCTT). Moreover, we provide an analytical model of the WCD that requests can suffer in a wNoC and we validate it against wNoC designs resembling those in the Tilera-Gx36 and the Intel-SCC 48-core processors. Building on top of our WCD analytical model, we analyze the impact on WCD that different design parameters such as the number of virtual channels, and we make a set of recommendations on what wNoC setups to use in the context of CRTES.Peer ReviewedPostprint (author's final draft
Universal Cycles for Minimum Coverings of Pairs by Triples, with Application to 2-Radius Sequences
A new ordering, extending the notion of universal cycles of Chung {\em et
al.} (1992), is proposed for the blocks of -uniform set systems. Existence
of minimum coverings of pairs by triples that possess such an ordering is
established for all orders. Application to the construction of short 2-radius
sequences is given, with some new 2-radius sequences found through computer
search.Comment: 18 pages, to appear in Mathematics of Computatio
- …