Sciweavers

2218 search results - page 25 / 444
» Testing Expressibility Is Hard
Sort
View
TSE
2011
145views more  TSE 2011»
13 years 2 months ago
Semi-Proving: An Integrated Method for Program Proving, Testing, and Debugging
— We present an integrated method for program proving, testing, and debugging. Using the concept of metamorphic relations, we select necessary properties for target programs. For...
Tsong Yueh Chen, T. H. Tse, Zhiquan Zhou
HICSS
2009
IEEE
103views Biometrics» more  HICSS 2009»
13 years 11 months ago
Automated Acceptance Testing Using Fit
Automated acceptance testing is a new and promising agile testing approach. Fit is the most established technical framework for specifying and executing acceptance tests which, id...
Geir Kjetil Hanssen, Børge Haugset
ENTCS
2008
83views more  ENTCS 2008»
13 years 7 months ago
Linearity, Persistence and Testing Semantics in the Asynchronous Pi-Calculus
In [24] the authors studied the expressiveness of persistence in the asynchronous -calculus (A) wrt weak barbed congruence. The study is incomplete because it ignores the issue of...
Diletta Cacciagrano, Flavio Corradini, Jesú...
APBC
2004
107views Bioinformatics» more  APBC 2004»
13 years 9 months ago
An Empirical Bayes Adjustment to Multiple p-values for the Detection of Differentially Expressed Genes in Microarray Experiments
In recent microarray experiments thousands of gene expressions are simultaneously tested in comparing samples (e.g., tissue types or experimental conditions). Application of a sta...
Somnath Datta, Susmita Datta
ESORICS
1994
Springer
13 years 11 months ago
On the Expressive Power of the Unary Transformation Model
The Transformation Model TRM was recently introduced 10 in the literature by Sandhu and Ganta. TRM is based on the concept of transformation of rights. The propagation of access ri...
Ravi S. Sandhu, Srinivas Ganta