Dynamic program analysis tools such as Eraser, Memcheck, or ThreadSanitizer abstract the contents of individual memory locations and store the abstraction results in a separate data structure called shadow memory. They then use this meta-information to efficiently implement the actual analyses. In this paper, we describe the implementation of an efficient symbolic shadow memory extension for the CBMC bounded model checker that can be accessed through an API, and sketch its use in the design of a new data race analyzer that is implemented by a code-to-code translation
Sequentialization is one of the most promising approaches for the symbolic analysis of concurrent pr...
Modern multicore processors, such as the Cell Broadband Engine, achieve high performance by equippin...
This project investigated different types of data races that can exist within C code, and then incre...
CBMC implements bit-precise bounded model checking for C programs and has been developed and maintai...
Several existing dynamic binary analysis tools use shadow mem-ory—they shadow, in software, every by...
Conference of 2017 ACM SIGPLAN International Symposium on Memory Management, ISMM 2017 ; Conference ...
We present Dartagnan, a bounded model checker (BMC) for concurrent programs under weak memory models...
We present Dartagnan, a bounded model checker (BMC) for concurrent programs under weak memory models...
International audienceOne classical approach to ensuring memory safety of C programs is based on sto...
Conference of 30th Annual ACM Symposium on Applied Computing, SAC 2015 ; Conference Date: 13 April 2...
In this thesis, we describe and evaluate approaches for the efficient reasoning of realworld C progr...
Abstract. We propose a SAT-based bounded verification technique, called TCBMC, for threaded C progra...
Abstract. A key challenge in model checking software is the difficulty of verifying properties of im...
International audienceThe C programming language does not prevent out-of- bounds memory accesses. Th...
Abstract. Bounded model checking (BMC) has successfully been used for many practical program verific...
Sequentialization is one of the most promising approaches for the symbolic analysis of concurrent pr...
Modern multicore processors, such as the Cell Broadband Engine, achieve high performance by equippin...
This project investigated different types of data races that can exist within C code, and then incre...
CBMC implements bit-precise bounded model checking for C programs and has been developed and maintai...
Several existing dynamic binary analysis tools use shadow mem-ory—they shadow, in software, every by...
Conference of 2017 ACM SIGPLAN International Symposium on Memory Management, ISMM 2017 ; Conference ...
We present Dartagnan, a bounded model checker (BMC) for concurrent programs under weak memory models...
We present Dartagnan, a bounded model checker (BMC) for concurrent programs under weak memory models...
International audienceOne classical approach to ensuring memory safety of C programs is based on sto...
Conference of 30th Annual ACM Symposium on Applied Computing, SAC 2015 ; Conference Date: 13 April 2...
In this thesis, we describe and evaluate approaches for the efficient reasoning of realworld C progr...
Abstract. We propose a SAT-based bounded verification technique, called TCBMC, for threaded C progra...
Abstract. A key challenge in model checking software is the difficulty of verifying properties of im...
International audienceThe C programming language does not prevent out-of- bounds memory accesses. Th...
Abstract. Bounded model checking (BMC) has successfully been used for many practical program verific...
Sequentialization is one of the most promising approaches for the symbolic analysis of concurrent pr...
Modern multicore processors, such as the Cell Broadband Engine, achieve high performance by equippin...
This project investigated different types of data races that can exist within C code, and then incre...