Sebastian Hudert, Torsten Eymann, et al.
IEEE-CEC 2000
Paper
Path Calculus in Program Verification
Abstract
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.
Related
Alex Golts, Daniel Khapun, et al.
MICCAI 2021
David W. Jacobs, Daphna Weinshall, et al.
IEEE Transactions on Pattern Analysis and Machine Intelligence
Vinayak Gupta, Rajmohan C, et al.
ICON 2022