Algebraic techniques for covering arrays and related structures

DOI10.1016/J.ENDM.2018.11.008MaRDI QIDQ1739926zbMATH OpenOpenAlexFDO

Authors Bernhard Garn, Dimitris Simos

Publication date 29 April 2019

Full work available at URL https://doi.org/10.1016/j.endm.2018.11.008

zbMATH Keywords

combinatorial testingcovering arraysGroebner basesmodelling

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15)

Recommendations

• Algebraic modelling of covering arrays
• Algebraic models for arbitrary strength covering arrays over \(v\)-ary alphabets
• Problems and algorithms for covering arrays
• scientific article; zbMATH DE number 5177325

Cites work

• Algebraic modelling of covering arrays
• Bruno Buchberger's PhD thesis 1965: An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal. Translation from the German
• Covering arrays avoiding forbidden edges
• Covering arrays on graphs
• Covering arrays via set covers
• scientific article; zbMATH DE number 867473 (Why is no real title available?)
• Introduction to combinatorial testing

Cited in

(8)

• Algebraic models for arbitrary strength covering arrays over \(v\)-ary alphabets
• Covering array EXtender
• Software and hardware testing using combinatorial covering suites
• Covering arrays with mixed alphabet sizes
• Algebraic modelling of covering arrays
• Aligators for Arrays (Tool Paper)
• Algebraic and SAT models for SCA generation
• Covering arrays from cyclotomy

This page was built for publication: Algebraic techniques for covering arrays and related structures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1739926)