Sciweavers

1054 search results - page 83 / 211
» A Formalization of the Turing Test
Sort
View
JSC
2006
81views more  JSC 2006»
15 years 4 months ago
Complexity bounds for zero-test algorithms
In this paper, we analyze the complexity of a zero test for expressions built from formal power series solutions of first order differential equations with non degenerate initial ...
Joris van der Hoeven, John Shackell
QSIC
2009
IEEE
15 years 11 months ago
From UML Statecharts to LOTOS: A Semantics Preserving Model Transformation
—A well-founded testing theory encourages the practical application of test case generation techniques. This aims at overcoming the ever increasing complexity of softwareenabled ...
Valentin Chimisliu, Christian Schwarzl, Bernhard P...
ISESE
2006
IEEE
15 years 10 months ago
An industrial case study of structural testing applied to safety-critical embedded software
Effective testing of safety-critical real-time embedded software is difficult and expensive. Many companies are hesitant about the cost of formalized criteria-based testing and a...
Jing Guan, Jeff Offutt, Paul Ammann
KBSE
2007
IEEE
15 years 11 months ago
Direct-dependency-based software compatibility testing
Software compatibility testing is an important quality assurance task aimed at ensuring that component-based software systems build and/or execute properly across a broad range of...
Il-Chul Yoon, Alan Sussman, Atif M. Memon, Adam A....
MBEES
2008
15 years 6 months ago
Composition of Model-based Test Coverage Criteria
: In this paper, we discuss adjustable coverage criteria and their combinations in model-based testing. We formalize coverage criteria and specify test goals using OCL. Then, we pr...
Mario Friske, Bernd-Holger Schlingloff, Stephan We...