Conference paper
The bionic DBMS is coming, but what will it look like?
Ryan Johnson, Ippokratis Pandis
CIDR 2013
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
Akari Asai, Zeqiu Wu, et al.
ICLR 2024
Eunho Yang, Aurelie C. Lozano, et al.
ICML 2014
Hong-linh Truong, Maja Vukovic, et al.
ICDH 2024