Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

An efficient method to generate feasible paths for basis path testing

From MaRDI portal
Publication:963407
Jump to:navigation, search

DOI10.1016/j.ipl.2008.01.007zbMath1186.68129OpenAlexW2094452104MaRDI QIDQ963407

Jian Zhang, Jun Yan

Publication date: 19 April 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2008.01.007


zbMATH Keywords

software engineeringtest data generationbasis path testingpath feasibility


Mathematics Subject Classification ID

Theory of software (68N99)


Related Items (3)

Estimating the volume of the solution space of SMT(LIA) constraints by a flat histogram method ⋮ Automatic generation of basis test paths using variable length genetic algorithm ⋮ On the use of meta-heuristic algorithms for automated test suite generation in software testing


Uses Software

  • PathCrawler


Cites Work

  • Symbolic execution and program testing
  • A Complexity Measure


This page was built for publication: An efficient method to generate feasible paths for basis path testing

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:963407&oldid=12948888"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 19:22.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki