This article proposes two heuristic approaches targeted at the optimized generation of test cases capable of triggering buffer overflows resp. underflows. Both testing techniques are based on guiding conditions statically derived by Integer Constraint Analysis. First experimental evaluations confirmed the superiority of local optimization algorithms over global ones.
CITATION STYLE
Al Sardy, L., Saglietti, F., Tang, T., & Sonnenberg, H. (2018). Constraint-based testing for buffer overflows. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11094 LNCS, pp. 99–111). Springer Verlag. https://doi.org/10.1007/978-3-319-99229-7_10
Mendeley helps you to discover research relevant for your work.