Quantification of software code coverage using artificial bee colony optimization based on Markov approach

DOI10.1007/S13369-017-2554-7zbMATH Open1390.90579OpenAlexW2611869821MaRDI QIDQ1640487FDOQ1640487

Authors: Muthusamy Boopathi, Ramalingam Sujatha, Chandran Senthil Kumar, Srinivasan Narasimman 

Publication date: 14 June 2018

Published in: Arabian Journal for Science and Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s13369-017-2554-7

Recommendations

• scientific article; zbMATH DE number 2040797
• Evolutionary generation of test data for paths coverage based on node probability
• Automatic test case generation using interval arithmetic
• Automatic test data generation for data flow testing using particle swarm optimization
• Global optimization for combination test suite by cluster searching algorithm

zbMATH Keywords

Markov chainartificial bee colonydd-graphinitial test suiteLCSAJ coveragepath coverage

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Theory of software (68N99)

Cites Work

• A Complexity Measure
• Title not available (Why is that?)
• Automatic software test data generation for spanning sets coverage using genetic algorithms

Cited In (1)

• Title not available (Why is that?)

This page was built for publication: Quantification of software code coverage using artificial bee colony optimization based on Markov approach

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