Aamod Khatiwada, Harsha Kokel, et al.
NeurIPS 2024
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.
Aamod Khatiwada, Harsha Kokel, et al.
NeurIPS 2024
Aditya Saxena, Shambhavi Shanker, et al.
AGU 2025
Yuta Tsuboi, Yuya Unno, et al.
AAAI 2011
Vladimir Yanovski, Israel A. Wagner, et al.
Ann. Math. Artif. Intell.