A general formal memory framework in Coq for verifying the properties of programs based on higher-order logic theorem proving with increased automation, consistency, and reusability.
Please log in to take part in the discussion (add own reviews or comments).
Cite this publication
More citation styles
- please select -
%0 Journal Article
%1 journals/corr/abs-1803-00403
%A Yang, Zheng
%A Lei, Hang
%D 2018
%J CoRR
%K dblp
%T A general formal memory framework in Coq for verifying the properties of programs based on higher-order logic theorem proving with increased automation, consistency, and reusability.
%U http://dblp.uni-trier.de/db/journals/corr/corr1803.html#abs-1803-00403
%V abs/1803.00403
@article{journals/corr/abs-1803-00403,
added-at = {2019-09-17T00:00:00.000+0200},
author = {Yang, Zheng and Lei, Hang},
biburl = {https://www.bibsonomy.org/bibtex/2bf5d1866d8b001d765299ad9815731eb/dblp},
ee = {http://arxiv.org/abs/1803.00403},
interhash = {2d793158beef7363f09438a0e653572c},
intrahash = {bf5d1866d8b001d765299ad9815731eb},
journal = {CoRR},
keywords = {dblp},
timestamp = {2019-09-18T11:38:48.000+0200},
title = {A general formal memory framework in Coq for verifying the properties of programs based on higher-order logic theorem proving with increased automation, consistency, and reusability.},
url = {http://dblp.uni-trier.de/db/journals/corr/corr1803.html#abs-1803-00403},
volume = {abs/1803.00403},
year = 2018
}
