A learning-based approach to unit testing of numerical software

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6435 LNCS, Issue , 2010, Pages 221-235

  Meinke, Karl ^a   Niu, Fei ^a  

^a ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATED TEST CASE GENERATION; FIRST-ORDER; LEARNING-BASED APPROACH; MEAN TIME TO FAILURE; NUMERICAL CODE; NUMERICAL SOFTWARE; PIECEWISE POLYNOMIAL MODELS; POLYNOMIAL MODELS; PROGRAM SPECIFICATION; RANDOM TESTING; REAL CLOSED FIELDS; SATISFIABILITY ALGORITHMS; TEST CASE; UNIT TESTING;

ALGORITHMS; FORMAL LOGIC; MATHEMATICAL MODELS; RANDOM ERRORS; APPLICATION PROGRAMS; BENCHMARKING; ITERATIVE METHODS;

ITERATIVE METHODS; SOFTWARE TESTING;

EID: 78649885303     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-16573-3_16     Document Type: Conference Paper

References (14)

1. Caviness, B.F., Johnson, J.R.: Quantifier Elimination and Cylindrical Algebraic Decomposition. Springer, Heidelberg (1998)
2. Chauhan, P., Clarke, E.M., Kukula, J.H., Sapra, S., Veith, H., Wang, D.: Automated abstraction refinement for model checking large state spaces using sat based conflict analysis. In: Aagaard, M.D., O'Leary, J.W. (eds.) FMCAD 2002. LNCS, vol. 2517, Springer, Heidelberg (2002)
3. Clarke, E., Gupta, A., Kukula, J., Strichman, O.: Sat-based abstraction refinement using ilp and machine learning. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol. 2404, Springer, Heidelberg (2002)
4. Cox, M.G., Harris, P.M., Johnson, E.G., Kenward, P.D., Parkin, G.I.: Testing the numerical correctness of software. Technical Report CMSC 34/04, National Physical Laboratory, Teddington (January 2004)
5. Groce, A., Peled, D., Yannakakis, M.: Adaptive model checking. Logic Journal of the IGPL 14(5), 729-744 (2006)
6. Hatton, L., Roberts, A.: How accurate is scientific software? ACM Transactions on Software Engineering 20(10), 786-797 (1994)
7. Hatton, L.: The chimera of software quality. Computer 40(8), 104, 102-103 (2007)
8. Knupp, P., Salari, K.: Verification of Computer Codes in Computational Science and Engineering. CRC Press, Boca Raton (2002)
9. Loeckx, J., Sieber, K.: The foundations of program verification, 2nd edn. John Wiley & Sons, Inc., New York (1987)
10. Meinke, K.: Automated black-box testing of functional correctness using function approximation. In: ISSTA 2004: Proceedings of the 2004 ACM SIGSOFT international symposium on Software testing and analysis, pp. 143-153. ACM, New York (2004)
11. Poston, R.M.: Automating Specification-Based Software Testing. IEEE Computer Society Press, Los Alamitos (1997)
12. Reimer, M.: Multivariate Polynomial Approximation. Birkhäuser, Basel (October 2003)
13. Roache, P.J.: Building pde codes to be verifiable and validatable. Computing in Science and Engineering, 30-38 (September/October 2004)
14. Tarski, A.: Decision Method for Elementary Algebra and Geometry. Univ. of California Press, Berkeley (1951)