BLISS: Improved Symbolic Execution by Bounded Lazy Initialization with SAT Support

Lazy Initialization (LI) allows symbolic execution to effectively deal with heap-allocated data structures, thanks to a significant reduction in spurious and redundant symbolic structures. Bounded lazy initialization (BLI) improves on LI by taking advantage of precomputed relational bounds on the in...

Descripción completa

Detalles Bibliográficos
Autores principales: Rosner, N., Geldenhuys, J., Aguirre, N.M., Visser, W., Frias, M.F.
Formato: JOUR
Materias:
lazy initialization
Symbolic execution
Symbolic PathFinder
tight field bounds
Concretes
Data structures
Formal logic
Complex data structures
Novel techniques
Orders of magnitude
Satisfiability
Model checking
Acceso en línea:http://hdl.handle.net/20.500.12110/paper_00985589_v41_n7_p639_Rosner
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

Ejemplares similares

Ejemplares similares