TY - GEN
T1 - It's doomed; We can prove it
AU - Hoenicke, Jochen
AU - Leino, K. Rustan M.
AU - Podelski, Andreas
AU - Schäf, Martin
AU - Wies, Thomas
PY - 2009
Y1 - 2009
N2 - Programming errors found early are the cheapest. Tools applying to the early stage of code development exist but either they suffer from false positives ("noise") or they require strong user interaction. We propose to avoid this deficiency by defining a new class of errors. A program fragment is doomed if its execution will inevitably fail, in whatever state it is started. We use a formal verification method to identify such errors fully automatically and, most significantly, without producing noise. We report on preliminary experiments with a prototype tool.
AB - Programming errors found early are the cheapest. Tools applying to the early stage of code development exist but either they suffer from false positives ("noise") or they require strong user interaction. We propose to avoid this deficiency by defining a new class of errors. A program fragment is doomed if its execution will inevitably fail, in whatever state it is started. We use a formal verification method to identify such errors fully automatically and, most significantly, without producing noise. We report on preliminary experiments with a prototype tool.
UR - http://www.scopus.com/inward/record.url?scp=70649095126&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=70649095126&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-05089-3_22
DO - 10.1007/978-3-642-05089-3_22
M3 - Conference contribution
AN - SCOPUS:70649095126
SN - 3642050883
SN - 9783642050886
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 338
EP - 353
BT - FM 2009
T2 - 2nd World Congress on Formal Methods, FM 2009
Y2 - 2 November 2009 through 6 November 2009
ER -