Tim Erdmann, Stefan Zecevic, et al.
ACS Spring 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.
Tim Erdmann, Stefan Zecevic, et al.
ACS Spring 2024
Jungo Kasai, Kun Qian, et al.
ACL 2019
Yale Song, Zhen Wen, et al.
IJCAI 2013
Kfir Toledo, Isaac Keslassy
NOMS 2025