Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
MEMOCODE
/
Paper
Using the coq theorem prover to verify complex data structure invariants.
Kenneth Roe
,
Scott F. Smith
Venue
C
MEMOCODE
Year
2017
Proceedings
MEMOCODE
DBLP record
conf/memocode/RoeS17 ↗
Browse the full
MEMOCODE paper archive
.