Integrating ADTs in KeY and Their Application to History-Based Reasoning

FORMAL METHODS, FM 2021(2021)

引用 3|浏览13
暂无评分
摘要
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 translate Isabelle theorems to 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.
更多
查看译文
关键词
Formal verification, Abstract data type, Program correctness, Java Collection Framework, KeY, Isabelle/HOL
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要