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
Conference paper
Toward Scientific Workflows in a Serverless World
Aakash Khochare, Yogesh Simmhan, et al.
eScience 2022
Paper
Magic functions
Cynthia Dwork, Moni Naor, et al.
Journal of the ACM
Yehuda Naveli, Michal Rimon, et al.
AAAI/IAAI 2006