Name
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. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1145/1929529.1929533 | PLPV |
Keywords | Field | DocType |
modularly-verified map,modular verification,associate key,modern software,diverse performance profile,broad variety,software verification challenge problem,modular reasoning,software verification effort,robust map component,fundamental component,map component,dictionaries,software verification | Functional verification,Programming language,Intelligent verification,Computer science,Algorithm,Verification,Runtime verification,Software,Software verification and validation,High-level verification,Software verification | Conference |
Citations | PageRank | References |
0 | 0.34 | 7 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Derek Bronish | 1 | 93 | 6.47 |
| Hampton Smith | 2 | 56 | 5.01 |