Robust, generic, modularly-verified map: a software verification challenge problem

Authors:
Derek Bronish;Hampton Smith
Affiliations:
The Ohio State University, Columbus, OH, USA;Clemson University, Clemson, SC, USA
Venue:
Proceedings of the 5th ACM workshop on Programming languages meets program verification
Year:
2011

Citing 8
Cited 0

Full functional verification of linked data structures

Proceedings of the 2008 ACM SIGPLAN conference on Programming language design and implementation
Incremental Benchmarks for Software Verification Tools and Techniques

VSTTE '08 Proceedings of the 2nd international conference on Verified Software: Theories, Tools, Experiments
An integrated proof language for imperative programs

Proceedings of the 2009 ACM SIGPLAN conference on Programming language design and implementation
Dafny meets the verification benchmarks challenge

VSTTE'10 Proceedings of the Third international conference on Verified software: theories, tools, experiments
An overview of the Jahob analysis system: project goals and current status

IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Dafny: an automatic program verifier for functional correctness

LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
Boogie: a modular reusable verifier for object-oriented programs

FMCO'05 Proceedings of the 4th international conference on Formal Methods for Components and Objects
Building a push-button RESOLVE verifier: Progress and challenges

Formal Aspects of Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Maps are a fundamental component in the development of modern software. The ability to associate keys with values in the manner of a partial mathematical function is important for a wide range of applications, and also accommodates a broad variety of implementations with diverse performance profiles. The foundational-yet-sophisticated nature of this problem makes it an ideal benchmark for software verification efforts. A tension between modular reasoning and the usefulness of the component can be observed particularly in systems where the keys may be reference types. Criteria for modular verification of a robust map component are elaborated, and existing attempts to verify a map component are surveyed.