Loading...
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...
Saved in:
| Published in: | Fundamental Approaches to Software Engineering |
|---|---|
| Main Authors: | , , , , , |
| Format: | Artigo |
| Language: | Inglês |
| Published: |
2021
|
| Subjects: | |
| Online Access: | https://ncbi.nlm.nih.gov/pmc/articles/PMC7978807/ https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1007/978-3-030-71500-7_11 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|