Generation of mutants for boolean expression

DOI10.1080/09720529.2008.10698211MaRDI QIDQ3637789zbMATH OpenOpenAlexFDO

Authors

Publication date 14 July 2009

Published in Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/09720529.2008.10698211

zbMATH Keywords

software testingmutation analysisfaultmutantBoolean expressionfault modelDisjunctive Normal Form

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• Generating Boolean \(\mu\)-expressions
• Generation of Boolean functions under the assumption of monotonicity
• Runtime analysis of mutation-based geometric semantic genetic programming on Boolean functions
• Random Boolean expressions
• Model generation with Boolean constraints
• Exploiting regularities for Boolean function synthesis
• Efficient synthesis of a class of Boolean programs from I-O data: application to genetic networks
• scientific article; zbMATH DE number 1107683

Cites work

• scientific article; zbMATH DE number 3127542 (Why is no real title available?)
• scientific article; zbMATH DE number 108425 (Why is no real title available?)
• Automatically generating test data from a Boolean specification
• Software is different

Cited in

(1)

• Boolean expression based on hypergraphs with algorithm

This page was built for publication: Generation of mutants for boolean expression

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