Integrating ADTs in KeY and their application to history-based reasoning about collection
We discuss integrating abstract data types (ADTs) in the KeY theorem prover by a new approach to model data types using Isabelle/HOL as an interactive back-end, and represent Isabelle theorems as user-defined taclets in KeY. As a case study of this new approach, we reason about Java’s Collection interface using histories, and we prove the correctness of several clients that operate on multiple objects, thereby significantly improving the state-of-the-art of history-based reasoning. Open Science. Includes video material (Bian and Hiep in FigShare, 2021. https://doi.org/10.6084/m9.figshare.c.5413263) and a source code artifact (Bian et al. in Zenodo, 2022. https://doi.org/10.5281/zenodo.7079126).
|, , , , , ,|
|Formal Methods in System Design|
|Organisation||Centrum Wiskunde & Informatica, Amsterdam (CWI), The Netherlands|
Bian, J, Hiep, H.A, de Boer, F.S, & de Gouw, C.P.T. (2023). Integrating ADTs in KeY and their application to history-based reasoning about collection. Formal Methods in System Design. doi:10.1007/s10703-023-00426-x