Please use this identifier to cite or link to this item: http://dr.iiserpune.ac.in:8080/xmlui/handle/123456789/3736
Full metadata record
DC FieldValueLanguage
dc.contributor.authorMAITY, SOUMENen_US
dc.date.accessioned2019-07-23T11:33:27Z-
dc.date.available2019-07-23T11:33:27Z-
dc.date.issued2012-01en_US
dc.identifier.citationIEICE Transactions on Information and Systems, E95(9), 2227-2231.en_US
dc.identifier.issn0916-8532en_US
dc.identifier.issn1745-1361en_US
dc.identifier.urihttp://dr.iiserpune.ac.in:8080/xmlui/handle/123456789/3736-
dc.identifier.urihttps://doi.org/10.1587/transinf.E95.D.2227en_US
dc.description.abstractIn most software development environments, time, computing and human resources needed to perform the testing of a component is strictly limited. In order to deal with such situations, this paper proposes a method of creating the best possible test suite (covering the maximum number of 3-tuples) within a fixed number of test cases.en_US
dc.language.isoenen_US
dc.publisherInstitute of Electronics, Information and Communication Engineersen_US
dc.subject3-Way Softwareen_US
dc.subjectBudget Constraintsen_US
dc.subjectCovering arraysen_US
dc.subjectTest case generationen_US
dc.subjectFinite fieldsen_US
dc.subjectLinear groupen_US
dc.subject2012en_US
dc.title3-Way Software Testing with Budget Constraintsen_US
dc.typeArticleen_US
dc.contributor.departmentDept. of Mathematicsen_US
dc.identifier.sourcetitleIEICE Transactions on Information and Systemsen_US
dc.publication.originofpublisherForeignen_US
Appears in Collections:JOURNAL ARTICLES

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.