Verifying OpenJDK’s LinkedList using KeY (extended paper)

Hiep, Hans-Dieter A.; Maathuis, Olaf; Bian, Jinting; Boer, Frank S. de; Gouw, Stijn de

doi:10.1007/s10009-022-00679-7

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2023

2024

Publication Types

Select...

Book3

Article1

Relationship

Self Cite0

Independent4

Authors

Journals

Cited by 4 publications

References 28 publications

(34 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

Reasoning About Exceptional Behavior at the Level of Java Bytecode

Paganoni,

Furia

2023

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Reasoning About Exceptional Behavior at the Level of Java Bytecode

Paganoni,

Furia

2023

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Analysis and Formal Specification of OpenJDK’s BitSet

Tatman,

Hiep,

de Gouw

2023

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Formally Verifying an Efficient Sorter

Beckert,

Sanders,

Ulbrich

et al. 2024

Lecture Notes in Computer Science

View full text Add to dashboard Cite

In this experience report, we present the complete formal verification of a Java implementation of inplace superscalar sample sort ( "Image missing") using the KeY program verification system. As "Image missing" is one of the fastest general purpose sorting algorithms, this is an important step towards a collection of basic toolbox components that are both provably correct and highly efficient. At the same time, it is an important case study of how careful, highly efficient implementations of complicated algorithms can be formally verified directly. We provide an analysis of which features of the KeY system and its verification calculus are instrumental in enabling algorithm verification without any compromise on algorithm efficiency.

show abstract

Verifying OpenJDK’s LinkedList using KeY (extended paper)

Abstract: As a particular case study of the formal verification of state-of-the-art, real software, we discuss the specification and verification of a corrected version of the implementation of a linked list as provided by the Java Collection Framework.

Cited by 4 publications

References 28 publications

Reasoning About Exceptional Behavior at the Level of Java Bytecode

Reasoning About Exceptional Behavior at the Level of Java Bytecode

Analysis and Formal Specification of OpenJDK’s BitSet

Formally Verifying an Efficient Sorter

Contact Info

Product

Resources

About