Akari Asai, Zeqiu Wu, et al.
ICLR 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.
Akari Asai, Zeqiu Wu, et al.
ICLR 2024
Michael Factor, Dafna Sheinwald
Information Sciences
Rakesh Mohan, Ramakant Nevatia
IEEE Transactions on Pattern Analysis and Machine Intelligence
Vitaly Feldman
JMLR