Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
MFPS
/
Paper
Does "N+1 Times" Prove More Programs Correct Than "N Times"?
Ana Pasztor
Venue
B
MFPS
Year
1989
Proceedings
Mathematical Foundations of Programming Semantics
DBLP record
conf/mfps/Pasztor89 ↗
Browse the full
MFPS paper archive
.