Vladimir Yanovski, Israel A. Wagner, et al.
Ann. Math. Artif. Intell.
A method for proving and disprowng propemes of programs ts described Its mam features are Recurstvely defined procedures can be used m assemons, loop mvarlants are not necessary, absence of run time errors is proven, counterexamples to incorrect programs can be given Experience with the method's lmplementaUon is reported. © 1978, ACM. All rights reserved.
Vladimir Yanovski, Israel A. Wagner, et al.
Ann. Math. Artif. Intell.
Rie Kubota Ando
CoNLL 2006
Cynthia Dwork, Moni Naor, et al.
Journal of the ACM
Cristina Cornelio, Judy Goldsmith, et al.
JAIR