This thesis explores the challenges in abstract library specification, library refinement and reasoning about fine-grained concurrent programs. For abstract library specification, this thesis applies structural separation logic (SSL) to formally specify the behaviour of several libraries in an abstract, local and compositional manner. This thesis further generalises the theory of SSL to allow for library specifications that are language-independent. Most notably, we specify a fragment of the Document Object Model (DOM) library. This result is compelling as it significantly improves upon existing DOM formalisms in that the specifications produced are local, compositional and language-independent. Concerning library refinement, this ...
Abstract. The views framework of Dinsdale-Young and others unifies several compositional techniques ...
Despite recent advances in reasoning about concurrent data structure libraries, the largest implemen...
AbstractParkinson, Bornat, and Calcagno recently introduced a logic for partial correctness in which...
© 2014 The Authors.We study abstract local reasoning for concurrent libraries. There are two main ap...
We study abstract local reasoning for concurrent libraries. There are two main approaches: provide a...
AbstractWe study abstract local reasoning for concurrent libraries. There are two main approaches: p...
One might think that specifying and reasoning about concurrent programs would be easier with more ex...
One might think that specifying and reasoning about concurrent programs would be easier with more ex...
We present an axiomatic specification of a key fragment of DOM using structural separation logic. Th...
One might think that specifying and reasoning about concurrent programs would be easier with more ex...
Abstract. A key difficulty in verifying shared-memory concurrent pro-grams is reasoning compositiona...
Despite recent advances in reasoning about concurrent data structure libraries, the largest implemen...
AbstractConcurrent Separation Logic is a resource-sensitive logic for fault-free partial correctness...
Synchronisation constructs lie at the heart of any reliable concurrent program. Many such constructs...
This paper describes the first results and on-going work in the VerCors project. The VerCors project...
Abstract. The views framework of Dinsdale-Young and others unifies several compositional techniques ...
Despite recent advances in reasoning about concurrent data structure libraries, the largest implemen...
AbstractParkinson, Bornat, and Calcagno recently introduced a logic for partial correctness in which...
© 2014 The Authors.We study abstract local reasoning for concurrent libraries. There are two main ap...
We study abstract local reasoning for concurrent libraries. There are two main approaches: provide a...
AbstractWe study abstract local reasoning for concurrent libraries. There are two main approaches: p...
One might think that specifying and reasoning about concurrent programs would be easier with more ex...
One might think that specifying and reasoning about concurrent programs would be easier with more ex...
We present an axiomatic specification of a key fragment of DOM using structural separation logic. Th...
One might think that specifying and reasoning about concurrent programs would be easier with more ex...
Abstract. A key difficulty in verifying shared-memory concurrent pro-grams is reasoning compositiona...
Despite recent advances in reasoning about concurrent data structure libraries, the largest implemen...
AbstractConcurrent Separation Logic is a resource-sensitive logic for fault-free partial correctness...
Synchronisation constructs lie at the heart of any reliable concurrent program. Many such constructs...
This paper describes the first results and on-going work in the VerCors project. The VerCors project...
Abstract. The views framework of Dinsdale-Young and others unifies several compositional techniques ...
Despite recent advances in reasoning about concurrent data structure libraries, the largest implemen...
AbstractParkinson, Bornat, and Calcagno recently introduced a logic for partial correctness in which...