Scispace (Formerly Typeset)
  1. Home
  2. Topics
  3. Orthogonal array testing
  4. 2000
  1. Home
  2. Topics
  3. Orthogonal array testing
  4. 2000
Showing papers on "Orthogonal array testing published in 2000"
Journal Article•10.1016/S0950-5849(00)00100-2•
Partition testing with usage models

[...]

Kirk Sayre1, Jesse H. Poore1•
University of Tennessee1
01 Sep 2000-Information & Software Technology
TL;DR: Useful models support many strategies for automated partitioning and generating test cases from the partitioned population, and two strategies are shown here with the efficiency gains demonstrated.
Abstract: The fundamental statistical strategy of improving sampling efficiency through partitioning the population is applied to software testing. Usage models make it possible to apply this strategy to improve the efficiency of testing. The testing budget is allocated to the blocks of the partition, and the software is executed on the sample of uses drawn from each block or sub-population of potential uses. Usage models support many strategies for automated partitioning and generating test cases from the partitioned population. Two strategies are shown here with the efficiency gains demonstrated.

19 citations

Patent•
Verification coverage method

[...]

Robert Paul Kurshan1•
Alcatel-Lucent1
22 May 2000
TL;DR: In this paper, coverage of the testing is obtained by maintaining a store of information that is populated as the testing progresses, maintaining information about the ranges of system variables that are employed during the testing, to permit the designer to assess whether other queries ought to be formulated, or whether portions of the system are superfluous.
Abstract: In testing a system, coverage of the testing is obtained by maintaining a store of information that is populated as the testing progresses. The store maintains information about the ranges of system variables that are employed during the testing. At the conclusion of the testing, the coverage of the testing is reported out, to permit the designer to assess whether other queries ought to be formulated, or whether portions of the system are superfluous. The testing can employ simulations, formal verifications, or some other techniques.

8 citations

Patent•
Method and apparatus for optimizing testing sequences for electronic equipment

[...]

Joseph P. Coyle1•
Sun Microsystems1
16 Mar 2000
TL;DR: In this paper, a programmable test sequencer in an electronic system is optimized by using a single set of sub-tests and varying the testing sequence to produce tests tailored for different purposes such as screening and diagnostic testing.
Abstract: Testing of an electronic system is optimized by using a single set of sub-tests and varying the testing sequence to produce tests tailored for different purposes such as screening and diagnostic testing. For example, a programmable test sequencer in the electronic system responds to a test selection variable by using a first sequence of the sub-tests to optimize the testing process for screening and a second sequence of the sub-tests to optimize the testing process for diagnostic testing. In the diagnostic mode, the sub-tests are run so that each sub-test builds upon the previous sub-tests and uses previously-tested hardware to verify additional hardware. In the screening mode, the sub-tests are the same, but the execution order of the sub-tests is reversed so that more complex hardware is tested first as a screening mechanism.

5 citations

Journal Article•10.1016/S0020-0255(00)00058-X•
The universal safeness of test allocation strategies for partition testing

[...]

Tsong Yueh Chen1, Yuen Tak Yu2•
Swinburne University of Technology1, City University of Hong Kong2
01 Nov 2000-Information Sciences
TL;DR: This paper proves that PSS is actually the only universally safe test allocation strategy for partition testing, thereby settling an open problem in the search for universally safe strategies and shows that a close approximation to PSS may still be safe for most programs.

4 citations

Patent•
A method of installing software on and/or testing a computer system which includes checks for compatibility

[...]

Richard D Amberg, Roger W Wong, Lynch Michael
20 Apr 2000
TL;DR: In this paper, a descriptor file containing a series of component (hardware/software) descriptors is used to obtain a set of steps, which relate to installation/testing, from a database (100).
Abstract: Software installation and/or testing of software/hardware on a build-to-order computer system (160) is automated. A descriptor file, containing a series of component (hardware/software) descriptors, is used to obtain a set of steps, which relate to installation/testing, from a database (100) (eg. relational database, Fig 6). Each step has an associated sequence number which is used to sequence the steps. The compatibility between steps and components is check through processing compatibility information stored on the database. Steps may need to be removed or altered depending on their compatibility. For each step it is determined if that step requires a parameter, if so the parameter's value is calculated. A progress or log file is kept during the installation/testing of the system to ensure the correct sequence of steps is followed. Installation/testing may either be carried out using a setup disk (Fig. 1) or a over a network (Fig 2.).

4 citations

Proceedings Article•10.1145/343647.344146•
Testing arithmetic coprocessor in system environment

[...]

J. Sosnowski1, T. Bech1•
Warsaw University of Technology1
1 Jan 2000
TL;DR: An important contribution of this paper is the integration of various approaches to testing and increased test observability of test results assured by on-chip event monitors and system exceptions.
Abstract: Summary form only given. Arithmetic coprocessors (AC) are quite complex circuits and testing them is an important and not easy problem (not covered in the literature). Analyzing diagnostic software for IBM PCs we found that the testing procedures for ACs are limited to simple basic checks. Hence we decided to develop efficient test procedures in a systematic way. They are executed on the main processor and generate appropriate stimuli to AC functional blocks (e.g. instruction sequencer, data path units) and verify test responses. An important contribution of this paper is the integration of various approaches to testing and increased test observability of test results assured by on-chip event monitors and system exceptions.

1 citations

Proceedings Article•10.1109/ICSMC.2000.885984•
The use of class graph to analyze the effectiveness of an approach for object-oriented class-level testing

[...]

Huo Yan Chen1, Jian-Zhu Lu•
Jinan University1
8 Oct 2000
TL;DR: This work proposes an approach to select a finite number of representative equivalent pairs as test cases from the infinite set of all equivalent pairs based on the concept of equivalent fundamental pairs and analyzes the effectiveness using a class graph.
Abstract: In order to improve reliability and quality, software systems should be tested. The testing of object-oriented software systems is more complex than that of traditional programming. Recently, we have proposed an approach to select a finite number of representative equivalent pairs as test cases from the infinite set of all equivalent pairs. The approach is based on the concept of equivalent fundamental pairs. We analyze the effectiveness of this approach using a class graph. A class graph can be derived from the syntax declaration of the algebraic specification for the given class under test. Using the class graph, we show that our approach omits many testing paths in the class graph but doesn't reduce the testing effect. Hence, the testing efficiency is improved greatly.

1 citations

Journal Article•10.1016/S1474-6670(17)35626-4•
Automatic Interconnections Testing Based on a Modified Boundary-Scan Architecture

[...]

Adam Kristof1, Edward Hrynkiewicz1•
Silesian University of Technology1
01 Feb 2000-IFAC Proceedings Volumes
TL;DR: A method of automatic testing inter-eircuit connections (PCB wires) is proposed, what results in reduced complexity of test procedures and shorter testing time, compared to traditional methods of testing interconnections.
Proceedings Article•10.1145/337180.337197•
Testing levels for object-oriented software

[...]

Yvan Labiche1, P. Thevenod-Fosse1, Hélène Waeselynck1, M.-H. Durand2•
Hoffmann-La Roche1, Airbus2
1 Jun 2000
TL;DR: This paper presents an approach to define a test order by exploiting a model produced during design stages, namely the class diagram, to minimize the number of stubs to be constructed in order to decrease the cost of testing.
Abstract: One of the characteristics of object-oriented software is the complex dependency that may exist between classes due to inheritance, association and aggregation relationships. Hence, where to start testing and how to define an integration strategy are issues that require further investigation. This paper presents an approach to define a test order by exploiting a model produced during design stages (e.g., using OMT, UML), namely the class diagram. Our goal is to minimize the number of stubs to be constructed in order to decrease the cost of testing. This is done by testing a class after the classes it depends on. The novelty of the test order lies in the fact that it takes account of: (i) dynamic (polymorphism) dependencies; (ii) abstract classes that cannot be instantiated, making some testing levels infeasible. The test order is represented by a graph showing which testing levels must be done in sequence and which ones may be done independently. It also provides information about the classes involved in each level and how they are involved (e.g., instantiation or not). The approach is implemented in a tool called TOONS (testing level generator for object-oriented software). It is applied to an industrial case study from the avionics domain.
Journal Article•10.1016/S0020-0255(00)00059-1•
Test case selection with and without replacement

[...]

Hing Leung1, T. H. Tse2, Felix T.S. Chan2, Tsong Yueh Chen3•
New Mexico State University1, University of Hong Kong2, Swinburne University of Technology3
01 Nov 2000-Information Sciences
TL;DR: A new effectiveness metric for software testing, namely the expected number of distinct failures detected, is proposed to re-examine existing partition testing strategies and explore the relationships between these two scenarios.

Tools

SciSpace AgentBiomedical AgentSciSpace RecruitSciSpace for EnterpriseAgent GalleryChat with PDFLiterature ReviewAI WriterFind TopicsParaphraserCitation GeneratorExtract DataAI DetectorCitation Booster

Learn

ResourcesLive Workshops

SciSpace

CareersSupportBrowse PapersPricingSciSpace Affiliate ProgramCancellation & Refund PolicyTermsPrivacyData Sources

Directories

PapersTopicsJournalsAuthorsConferencesInstitutionsCitation StylesWriting templates

Extension & Apps

SciSpace Chrome ExtensionSciSpace Mobile App

Contact

support@scispace.com
SciSpace

© 2026 | PubGenius Inc. | Suite # 217 691 S Milpitas Blvd Milpitas CA 95035, USA

soc2
Secured by Delve