Sciweavers

1054 search results - page 77 / 211
» A Formalization of the Turing Test
Sort
View
ICDE
2011
IEEE
220views Database» more  ICDE 2011»
14 years 8 months ago
Generating test data for killing SQL mutants: A constraint-based approach
—Complex SQL queries are widely used today, but it is rather difficult to check if a complex query has been written correctly. Formal verification based on comparing a specifi...
Shetal Shah, S. Sudarshan, Suhas Kajbaje, Sandeep ...
141
Voted
ASWEC
2006
IEEE
15 years 10 months ago
Compatibility Test for Coordination Aspects of Software Components
Combining third party software components to customer-individual application systems requires first, standardized specification techniques for describing the technical as well as ...
Johannes Maria Zaha, Antonia Albani
ECBS
2005
IEEE
160views Hardware» more  ECBS 2005»
15 years 10 months ago
Traceability-Driven Model Refinement for Test Case Generation
Testing complex Computer-Based Systems is not only a demanding but a very critical task. Therefore the use of models for generating test data is an important goal. Tool support du...
Matthias Riebisch, Michael Hübner
129
Voted
COCO
2005
Springer
128views Algorithms» more  COCO 2005»
15 years 10 months ago
More on Noncommutative Polynomial Identity Testing
We continue the study of noncommutative polynomial identity testing initiated by Raz and Shpilka and present efficient algorithms for the following problems in the noncommutative...
Andrej Bogdanov, Hoeteck Wee
VL
2003
IEEE
126views Visual Languages» more  VL 2003»
15 years 10 months ago
Generalizing WYSIWYT visual testing to screen transition languages
ct How can rigorous forms of testing be supported in a way that is both compatible with the visual aspect of visual programming languages, and usable by the audiences using those l...
Darren Brown, Margaret M. Burnett, Gregg Rothermel...