Rakesh Mohan, Ramakant Nevatia
IEEE Transactions on Pattern Analysis and Machine Intelligence
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.
Rakesh Mohan, Ramakant Nevatia
IEEE Transactions on Pattern Analysis and Machine Intelligence
Berrin Yanikoglu, Peter A. Sandon
Pattern Recognition
Zhikun Yuen, Paula Branco, et al.
DSAA 2023
Alain Vaucher, Philippe Schwaller, et al.
AMLD EPFL 2022