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
Michael Factor, Dafna Sheinwald
Information Sciences
Arthur Nádas
IEEE Transactions on Neural Networks
P. Trespeuch, Y. Fournier, et al.
Civil-Comp Proceedings