A fully verified container library-Reference-Cited by-同舟云学术

A fully verified container library

Published:2018-09 Issue:5 Volume:30 Page:495-523
ISSN:0934-5043
Container-title:Formal Aspects of Computing
language:en
Short-container-title:Form. Asp. Comput.

Author:

Polikarpova Nadia¹,Tschannen Julian²,Furia Carlo A.³

Affiliation:

1. MIT CSAIL, Cambridge, MA, USA

2. Google, Zurich, Switzerland

3. Chalmers University of Technology, Göteborg, Sweden

Abstract

Abstract 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).

Publisher

Association for Computing Machinery (ACM)

Subject

Theoretical Computer Science,Software

Link

http://link.springer.com/article/10.1007/s00165-017-0435-1/fulltext.html

Reference89 articles.

1. Ameri M Furia CA (June 2016) Why just Boogie? Translating between intermediate verification languages. In: Proceedings of the 12th international conference on integrated formal methods (iFM) volume 9681 of lecture notes in computer science. Springer pp 1–17

2. Barnett M Chang B-YE DeLine R Jacobs B Leino KRM (2005) Boogie: a modular reusable verifier for object-oriented programs. In: FMCO pp 364–387

3. Verification of Object-Oriented Programs with Invariants.

4. Blanc N.; Groce A.; Kroening D.: Verifying C++ with STL containers via predicate abstraction. 22nd IEEE/ACM international conference on automated software engineering (ASE 2007) Nov 5–9 2007 pp. 521–524. Atlanta Georgia USA (2007)

5. Beyer D Henzinger TA Théoduloz G (2006) Lazy shape analysis. In: 18th international conference on computer aided verification CAV 2006 Seattle WA USA Aug 17–20 2006 Proceedings volume 4144 of lecture notes in computer science. Springer pp 532–546

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Reasoning About Exceptional Behavior at the Level of Java Bytecode;iFM 2023;2023-11-06

2. Leaf: Modularity for Temporary Sharing in Separation Logic;Proceedings of the ACM on Programming Languages;2023-10-16

3. Verification of mutable linear data structures and iterator-based algorithms in Dafny;Journal of Logical and Algebraic Methods in Programming;2023-08

4. Mostly Automated Proof Repair for Verified Libraries;Proceedings of the ACM on Programming Languages;2023-06-06

5. Specifying and Verifying Higher-order Rust Iterators;Tools and Algorithms for the Construction and Analysis of Systems;2023