Sciweavers

2218 search results - page 6 / 444
» Testing Expressibility Is Hard
Sort
View
RTCSA
1999
IEEE
13 years 12 months ago
Scheduling Fault-Tolerant Distributed Hard Real-Time Tasks Independently of the Replication Strategies
Replication is a well-know fault-tolerance technique, and several replication strategies exist (e.g. active, passive, and semi-active replication). To be used in hard real-time sy...
Pascal Chevochot, Isabelle Puaut
DSN
2007
IEEE
14 years 2 months ago
BlackJack: Hard Error Detection with Redundant Threads on SMT
Testing is a difficult process that becomes more difficult with scaling. With smaller and faster devices, tolerance for errors shrinks and devices may act correctly under certain ...
Ethan Schuchman, T. N. Vijaykumar
TSD
2010
Springer
13 years 5 months ago
Listening-Test-Based Annotation of Communicative Functions for Expressive Speech Synthesis
This paper is focused on the evaluation of listening test that was realized with a view to objectively annotate expressive speech recordings and further develop a limited domain ex...
Martin Gruber, Jindrich Matousek
ICST
2008
IEEE
14 years 2 months ago
Quality of Automatically Generated Test Cases based on OCL Expressions
In this paper, we deal with coverage criteria for boundary testing. We focus on the automatic generation of boundary tests based on OCL expressions and evaluate the quality of the...
Stephan Weißleder, Bernd-Holger Schlingloff
CORR
2010
Springer
139views Education» more  CORR 2010»
13 years 7 months ago
A proof Procedure for Testing Membership in Regular Expressions
We propose an algorithm that tests membership for regular expressions and show that the algorithm is correct. This algorithm is written in the style of a sequent proof system. The...
Keehang Kwon, Hong Pyo Ha, Jiseung Kim