Abstract
This paper uses a combination of formal specification and testing, to analyse OpenJDK’s BitSet class. This class represents a vector of bits that grows as required. During our analysis, we uncovered a number of bugs. We propose and compare various solutions, supported by our formal specification. While a full mechanical verification of the BitSet class is not yet possible due to limited support for bitwise operations in the KeY theorem prover, we show initial steps taken to formally verify the challenging get(int,int) method, and discuss some required extensions to the theorem prover.
Original language | English |
---|---|
Title of host publication | iFM 2023 - 18th International Conference, iFM 2023, Proceedings |
Subtitle of host publication | 18th International Conference, iFM 2023, Leiden, The Netherlands, November 13–15, 2023, Proceedings |
Editors | Paula Herber, Anton Wijs |
Publisher | Springer |
Pages | 134-152 |
Number of pages | 19 |
ISBN (Electronic) | 9783031477058 |
ISBN (Print) | 9783031477041 |
DOIs | |
Publication status | Published - 2024 |
Event | 18th International Conference on integrated Formal Methods - Leiden, Netherlands Duration: 13 Nov 2023 → 15 Nov 2023 https://ifm23.liacs.nl/ |
Publication series
Series | Lecture Notes in Computer Science |
---|---|
Volume | 14300 |
ISSN | 0302-9743 |
Conference
Conference | 18th International Conference on integrated Formal Methods |
---|---|
Abbreviated title | iFM 2023 |
Country/Territory | Netherlands |
City | Leiden |
Period | 13/11/23 → 15/11/23 |
Internet address |