Eiffel: the language
Numerical recipes in C (2nd ed.): the art of scientific computing
Numerical recipes in C (2nd ed.): the art of scientific computing
C4.5: programs for machine learning
C4.5: programs for machine learning
An Analysis of Test Data Selection Criteria Using the RELAY Model of Fault Detection
IEEE Transactions on Software Engineering
Generating oracles from your favorite temporal logic specifications
SIGSOFT '96 Proceedings of the 4th ACM SIGSOFT symposium on Foundations of software engineering
View-dependent simplification of arbitrary polygonal environments
Proceedings of the 24th annual conference on Computer graphics and interactive techniques
Surface simplification using quadric error metrics
Proceedings of the 24th annual conference on Computer graphics and interactive techniques
A visual test development environment for GUI systems
Proceedings of the 1998 ACM SIGSOFT international symposium on Software testing and analysis
The Pareto principle applied to software quality assurance
Handbook of software quality assurance (3rd ed.)
Helping the automated validation process of user interfaces systems
Proceedings of the 20th international conference on Software engineering
Automated test oracles for GUIs
SIGSOFT '00/FSE-8 Proceedings of the 8th ACM SIGSOFT international symposium on Foundations of software engineering: twenty-first century applications
An automated oracle for verifying GUI objects
ACM SIGSOFT Software Engineering Notes
Semi-proving: an integrated method based on global symbolic evaluation and metamorphic testing
ISSTA '02 Proceedings of the 2002 ACM SIGSOFT international symposium on Software testing and analysis
Assertions to better specify the amazon bug
SEKE '02 Proceedings of the 14th international conference on Software engineering and knowledge engineering
A Developer's Survey of Polygonal Simplification Algorithms
IEEE Computer Graphics and Applications
Automated testing of virtual reality application interfaces
EGVE '03 Proceedings of the workshop on Virtual environments 2003
Automated support for classifying software failure reports
Proceedings of the 25th International Conference on Software Engineering
The data mining approach to automated software testing
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
A General Model for Finite-Sample Effects in Training and Testing of Competing Classifiers
IEEE Transactions on Pattern Analysis and Machine Intelligence
Specification-driven automated testing of GUI-based Java programs
ACM-SE 42 Proceedings of the 42nd annual Southeast regional conference
Active learning for automatic classification of software behavior
ISSTA '04 Proceedings of the 2004 ACM SIGSOFT international symposium on Software testing and analysis
Mining with rarity: a unifying framework
ACM SIGKDD Explorations Newsletter - Special issue on learning from imbalanced datasets
Tree-Based Methods for Classifying Software Failures
ISSRE '04 Proceedings of the 15th International Symposium on Software Reliability Engineering
A scalable formal method for design and automatic checking of user interfaces
ACM Transactions on Software Engineering and Methodology (TOSEM)
Is mutation an appropriate tool for testing experiments?
Proceedings of the 27th international conference on Software engineering
MuJava: an automated class mutation system: Research Articles
Software Testing, Verification & Reliability
The Vital Few Versus the Trivial Many: Examining the Pareto Principle for Software
COMPSAC '05 Proceedings of the 29th Annual International Computer Software and Applications Conference - Volume 01
Avoiding coincidental correctness in boundary value analysis
ACM Transactions on Software Engineering and Methodology (TOSEM)
COMPSAC '06 Proceedings of the 30th Annual International Computer Software and Applications Conference - Volume 01
Journal of Systems and Software - Special issue: Quality software
Test conditions for fault classes in Boolean specifications
ACM Transactions on Software Engineering and Methodology (TOSEM)
Automating image segmentation verification and validation by learning test oracles
Information and Software Technology
Hi-index | 0.00 |
Graphics applications often need to manipulate numerous graphical objects stored as polygonal models. Mesh simplification is an approach to vary the levels of visual details as appropriate, thereby improving on the overall performance of the applications. Different mesh simplification algorithms may cater for different needs, producing diversified types of simplified polygonal model as a result. Testing mesh simplification implementations is essential to assure the quality of the graphics applications. However, it is very difficult to determine the oracles (or expected outcomes) of mesh simplification for the verification of test results. A reference model is an implementation closely related to the program under test. Is it possible to use such reference models as pseudo-oracles for testing mesh simplification programs? If so, how effective are they? This paper presents a fault-based pattern classification methodology called PAT, to address the questions. In PAT, we train the C4.5 classifier using black-box features of samples from a reference model and its fault-based versions, in order to test samples from the subject program. We evaluate PAT using four implementations of mesh simplification algorithms as reference models applied to 44 open-source three-dimensional polygonal models. Empirical results reveal that the use of a reference model as a pseudo-oracle is effective for testing the implementations of resembling mesh simplification algorithms. However, the results also show a tradeoff: When compared with a simple reference model, the use of a resembling but sophisticated reference model is more effective and accurate but less robust.