Mustansar Fiaz, Mubashir Noman, et al.
IGARSS 2025
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.
Mustansar Fiaz, Mubashir Noman, et al.
IGARSS 2025
Shyam Marjit, Harshit Singh, et al.
WACV 2025
Bingzhe Wu, Xiaolu Zhang, et al.
AAAI 2019
Rudra M. Tripathy, Amitabha Bagchi, et al.
Intelligent Data Analysis