Conference proceeding
Efficient solving of string constraints for security analysis
Proceedings of the Symposium and Bootcamp on the science of security, pp.4-6
HotSos '16
04/19/2016
DOI: 10.1145/2898375.2898393
Abstract
Motivation The security of software is increasingly more critical for consumer confidence, protection of privacy, protection of intellectual property, and even national security. As threats to software security have become more sophisticated, so too have the techniques developed to ensure security. One basic technique that has become a fundamental tool in static security analysis is symbolic execution. There are now a number of successful approaches that rely on symbolic methods to reduce security questions about programs to constraint satisfaction problems in some formal logic (e.g., [4, 5, 7, 16]). Those problems are then solved automatically by specialized reasoners for the target logic. The found solutions are then used to construct automatically security exploits in the original programs or, more generally, identify security vulnerabilities.
Details
- Title: Subtitle
- Efficient solving of string constraints for security analysis
- Creators
- Clark BarrettCesare TinelliMorgan DetersTianyi LiangAndrew ReynoldsNestan Tsiskaridze
- Resource Type
- Conference proceeding
- Publication Details
- Proceedings of the Symposium and Bootcamp on the science of security, pp.4-6
- Series
- HotSos '16
- DOI
- 10.1145/2898375.2898393
- Publisher
- ACM
- Grant note
- name: National Science Foundation, award: 1228765, 1228768
- Language
- English
- Date published
- 04/19/2016
- Academic Unit
- Computer Science
- Record Identifier
- 9984002414102771
Metrics
17 Record Views