2026-06-08T03:46:49Zhttps://docta.ucm.es/rest/oai/request

oai:docta.ucm.es:20.500.14352/931862025-03-18T13:28:31Zcom_20.500.14352_14col_20.500.14352_15

Blázquez, Jorge Montenegro Montes, Manuel Segura Díaz, Clara María 2024-01-15T16:46:08Z 2024-01-15T16:46:08Z 2021-09-22 https://hdl.handle.net/20.500.14352/93186 https://hdl.handle.net/11705/PROLE/2021/015 https://sistedes2021.spilab.es/prole/ We address the verification of mutable, heap-allocated abstract data types (ADTs) in Dafny. In particular, we devise a generic verification methodology and apply it to the specification and implementation of linear collections such as stacks, queues, deques, and lists with iterators. The layered approach presented in this paper allows us to progressively refine some aspects of the specification, such as iterator invalidation. We also introduce a stratified view of the footprint of an instance (i.e. the set of memory locations owned by that instance), and identify the boilerplate conditions common to all operations of an ADT. We also show the usage of the resulting implementations by means of verified examples. eng http://creativecommons.org/licenses/by-nc-nd/4.0/ open access Attribution-NonCommercial-NoDerivatives 4.0 International Verification of mutable data structures in Dafny: methodological aspects conference paper