A fully verified container library
Artikel i vetenskaplig tidskrift, 2018

The comprehensive functionality and nontrivial design of realistic general-purpose container libraries pose challenges to formal verification that go beyond those of individual benchmark problems mainly targeted by the state of the art. We present our experience verifying the full functional correctness of EiffelBase2: a container library offering all the features customary in modern language frameworks, such as external iterators, and hash tables with generic mutable keys and load balancing. Verification uses the automated deductive verifier AutoProof, which we extended as part of the present work. Our results indicate that verification of a realistic container library (135 public methods, 8400 LOC) is possible with moderate annotation overhead (1.4 lines of specification per LOC) and good performance (0.2 s per method on average).



Object-oriented software


Deductive verification


Nadia Polikarpova

Massachusetts Institute of Technology (MIT)

Julian Tschannen

Google Switzerland GmbH

Carlo A Furia

Chalmers, Data- och informationsteknik, Formella metoder

Formal Aspects of Computing

0934-5043 (ISSN) 1433-299X (eISSN)

Vol. 30 5 495-523


Språkteknologi (språkvetenskaplig databehandling)

Biblioteks- och informationsvetenskap

Inbäddad systemteknik



Mer information

Senast uppdaterat