Results 271 to 280 of about 29,773 (302)

Testability in the context of SDL

1992
Abstract The requirements of standardized OSI protocols should be specified using a formal description technique in order to assure an unambiguous description. SDL as an FDT offers this possibility, with respect to behavioural aspects. Since the conformance of implementations are determined from tests based on the specification, the requirements must
Jan Ellsberger, Finn Kristoffersen
openaire   +1 more source

On the Testability of Properties Patterns

2015
The specification pattern system (SPS) provides a simple methodology to specify program properties that can be used during software testing and verification. The testability concept establishes a connection between temporal properties and program traces to show which properties classes can actually be verified to reach a success/fail verdict.
Simone Hanazumi, Ana Cristina Vieira de Melo   +1 more
openaire   +1 more source

Designing UltraSparc for testability

IEEE Design & Test of Computers, 1997
With a focus on a short time to volume production, the UltraSparc microprocessor design incorporated innovative features that optimize test, debug and manufacture. The following areas are discussed: goals; cost-benefit analysis; scan design; decoded multiplexer; test generation flow; custom circuit blocks; boundary cell design; embedded array testing ...
openaire   +1 more source

Testability Design via Testability Measures

1992
Testability measures are used to describe the hardness (or easiness) of test generation for a logic circuit. In the analysis part we evaluate different definitions of testability from two requirements: precision and ease for computing. Postulates for an ideal definition are stated.
openaire   +1 more source

Testability considerations

Proceedings 1994 IEEE International Conference on Computer Design: VLSI in Computers and Processors, 2002
Shangzhi Sun, David Hung-Chang Du, Duen-Ren Liu   +2 more
openaire   +1 more source

Testability of Oracle Automata

2005
An oracle finite automaton (OFA) is a finite/Buchi automaton augmented with a finite number of unbounded, one-way, and writable query tapes. By each transition, an OFA can read an input symbol, append a symbol to the end of a query tape, erase the content of a query tape, or query an oracle with the content of a query tape (called a query string). Here,
Gaoyan Xie, Cheng Li, Zhe Dang
openaire   +1 more source

An ensemble meta-estimator to predict source code testability

Applied Soft Computing Journal, 2022
Saeed Alipour Parsa, Morteza Zakeri-Nasrabadi   +1 more
exaly  

Design for Testability

19th Design Automation Conference, 1982
openaire   +1 more source

Testability

2023
openaire   +1 more source

An empirical study into class testability

Journal of Systems and Software, 2006
Arie van Deursen
exaly