Techniques for formal modelling and verification on dynamic memory allocators

Abstract : The first part of the thesis demonstrates how to obtain formal specifications of free-list SDMA using a refinement-based approach. The thesis defines a hierarchy of models ranked by the refinement relation that capture a large variety of techniques and policies employed by real-work SDMA. This hierarchy forms an algorithm theory for the free-list SDMA and could be extended with other policies. The formal specifications are written in Event-B and the refinements have been proved using the Rodin platform. The thesis investigates applications of the formal specifications obtained, such as model-based testing, code generation and verification.The second part of the thesis defines a technique for inferring precise invariants of existing implementations of SDMA based abstract interpretation. For this, the thesis defines an abstract domain representing sets of states of the SDMA. The abstract domain is based on a fragment of Separation Logic, called SLMA. This fragment captures properties related with the shape and the content of data structures used by the SDMA to manage the heap. The abstract domain is defined as a specific product of an abstract domain for heap shapes with an abstract domain for finite arrays of locations. To obtain compact elements of this abstract domain, the thesis proposes an hierarchical organisation of the abstract values: a first level abstracts the list of all chunks while a second level selects only the chunks available for allocation. The thesis defines transformers of the abstract values that soundly capture the semantics of statements used in SDMA implementations. A prototype implementation of this abstract domain has been used to analyse simple implementations of SDMA
Complete list of metadatas

Cited literature [161 references]  Display  Hide  Download

https://tel.archives-ouvertes.fr/tel-02296429
Contributor : Abes Star <>
Submitted on : Wednesday, September 25, 2019 - 11:10:06 AM
Last modification on : Friday, September 27, 2019 - 1:14:13 AM

File

FANG_Bin_2_complete_20180910.p...
Version validated by the jury (STAR)

Identifiers

  • HAL Id : tel-02296429, version 1

Collections

Citation

Bin Fang. Techniques for formal modelling and verification on dynamic memory allocators. Data Structures and Algorithms [cs.DS]. Université Sorbonne Paris Cité; Université normale de la Chine de l'Est (Shanghai), 2018. English. ⟨NNT : 2018USPCC093⟩. ⟨tel-02296429⟩

Share

Metrics

Record views

50

Files downloads

11