Sciweavers

3889 search results - page 532 / 778
» The Use of Program Dependence Graphs in Software Engineering
Sort
View
ICST
2009
IEEE
15 years 11 months ago
Using JML Runtime Assertion Checking to Automate Metamorphic Testing in Applications without Test Oracles
It is challenging to test applications and functions for which the correct output for arbitrary input cannot be known in advance, e.g. some computational science or machine learni...
Christian Murphy, Kuang Shen, Gail E. Kaiser
120
Voted
DOCENG
2010
ACM
15 years 6 months ago
Linking data and presentations: from mapping to active transformations
Modern GUI toolkits, and especially RIA ones, propose the concept of binding to dynamically link domain data and their presentations. Bindings are very simple to use for predefine...
Olivier Beaudoux, Arnaud Blouin
ISPASS
2009
IEEE
15 years 11 months ago
Analyzing CUDA workloads using a detailed GPU simulator
Modern Graphic Processing Units (GPUs) provide sufficiently flexible programming models that understanding their performance can provide insight in designing tomorrow’s manyco...
Ali Bakhoda, George L. Yuan, Wilson W. L. Fung, He...
MSR
2005
ACM
15 years 10 months ago
Improving evolvability through refactoring
Refactoring is one means of improving the structure of existing software. Locations for the application of refactoring are often based on subjective perceptions such as ”bad sme...
Jacek Ratzinger, Michael Fischer, Harald Gall
GECCO
2010
Springer
196views Optimization» more  GECCO 2010»
15 years 9 months ago
Using synthetic test suites to empirically compare search-based and greedy prioritizers
The increase in the complexity of modern software has led to the commensurate growth in the size and execution time of the test suites for these programs. In order to address this...
Zachary D. Williams, Gregory M. Kapfhammer