Constraint-based Testing for Buffer Overflows

Al Sardy L, Saglietti F, Tang T, Sonnenberg H (2018)


Publication Language: English

Publication Type: Conference contribution

Publication year: 2018

Publisher: Springer

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

Series: Lecture Notes in Computer Science (LNCS)

Book Volume: 10489

Pages Range: 99-111

Conference Proceedings Title: Computer Safety, Reliability, and Security SAFECOMP 2018 Workshops ASSURE, DECSoS, SASSUR, STRIVE, and WAISE

Event location: Vasteras (S)

ISBN: 978-3-319-99228-0

DOI: 10.1007/978-3-319-99229-7_10

Abstract

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.

Authors with CRIS profile

Related research project(s)

How to cite

APA:

Al Sardy, L., Saglietti, F., Tang, T., & Sonnenberg, H. (2018). Constraint-based Testing for Buffer Overflows. In Gallina, Barbara ; Skavhaug, Amund ; Schoitsch, Erwin ; Bitsch, Friedemann (Eds.), Computer Safety, Reliability, and Security SAFECOMP 2018 Workshops ASSURE, DECSoS, SASSUR, STRIVE, and WAISE (pp. 99-111). Vasteras (S): Springer.

MLA:

Al Sardy, Loui, et al. "Constraint-based Testing for Buffer Overflows." Proceedings of the SAFECOMP Workshop DecSoS, Vasteras (S) Ed. Gallina, Barbara ; Skavhaug, Amund ; Schoitsch, Erwin ; Bitsch, Friedemann, Springer, 2018. 99-111.

BibTeX: Download