2026-06-08T03:08:10Zhttps://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

00925njm 22002777a 4500 dc Blázquez, Jorge author Montenegro Montes, Manuel author Segura Díaz, Clara María author 2021-09-22 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. https://hdl.handle.net/20.500.14352/93186 https://hdl.handle.net/11705/PROLE/2021/015 https://sistedes2021.spilab.es/prole/ Verification of mutable data structures in Dafny: methodological aspects