Michael Factor, Dafna Sheinwald
Information Sciences
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.
Michael Factor, Dafna Sheinwald
Information Sciences
Vinayak Gupta, Rajmohan C, et al.
ICON 2022
Rudra M. Tripathy, Amitabha Bagchi, et al.
Intelligent Data Analysis
Elron Bandel, Yotam Perlitz, et al.
NAACL 2024