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

Mostrar todas las versiones(2)

In this article we present BLISS, a novel technique that builds upon BLI, extending it with field bound refinement and satisfiability checks. Field bounds are refined while a symbolic structure is concretized, avoiding cases that, due to the concrete part of the heap and the field bounds, can be dee...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Rosner, Nicolás, Geldenhuys, Jaco, Aguirre, Nazareno Matías, Visser, Willem
Formato: Objeto de conferencia Resumen
Lenguaje:Inglés
Publicado: 2016
Materias:
Ciencias Informáticas
Bounded Lazy Initialization (BLI)
Acceso en línea:http://sedici.unlp.edu.ar/handle/10915/57306
http://45jaiio.sadio.org.ar/sites/default/files/asse-26.pdf
Aporte de:
SEDICI (UNLP) de Universidad Nacional de La Plata

Ejemplares similares

Ejemplares similares