Cargando…
Efficient Bounded Model Checking of Heap-Manipulating Programs using Tight Field Bounds
Software model checkers are able to exhaustively explore different bounded program executions arising from various sources of non-determinism. These tools provide statements to produce non-deterministic values for certain variables, thus forcing the corresponding model checker to consider all possib...
Autores principales: | Ponzio, Pablo, Godio, Ariel, Rosner, Nicolás, Arroyo, Marcelo, Aguirre, Nazareno, Frias, Marcelo F. |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
2021
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7978807/ http://dx.doi.org/10.1007/978-3-030-71500-7_11 |
Ejemplares similares
-
Bounded Model Checking for Hyperproperties
por: Hsu, Tzu-Han, et al.
Publicado: (2021) -
Tight bounds for the median of a gamma distribution
por: Lyon, Richard F.
Publicado: (2023) -
Tight security bounds for decoy-state quantum key distribution
por: Yin, Hua-Lei, et al.
Publicado: (2020) -
A framework for efficient modular heap analysis
por: Madhavan, Ravichandhran, et al.
Publicado: (2015) -
Dartagnan: Bounded Model Checking for Weak Memory Models (Competition Contribution)
por: Ponce-de-León, Hernán, et al.
Publicado: (2020)