P. Trespeuch, Y. Fournier, et al.
Civil-Comp Proceedings
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.
P. Trespeuch, Y. Fournier, et al.
Civil-Comp Proceedings
Vladimir Yanovski, Israel A. Wagner, et al.
Ann. Math. Artif. Intell.
Aamod Khatiwada, Harsha Kokel, et al.
NeurIPS 2024
Aakash Khochare, Yogesh Simmhan, et al.
eScience 2022