Hagen Soltau, Lidia Mangu, et al.
ASRU 2011
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.
Hagen Soltau, Lidia Mangu, et al.
ASRU 2011
Rakesh Mohan, Ramakant Nevatia
IEEE Transactions on Pattern Analysis and Machine Intelligence
Sebastian Hudert, Torsten Eymann, et al.
IEEE-CEC 2000
Bingzhe Wu, Xiaolu Zhang, et al.
AAAI 2019