Formalization of the Nominative Algorithmic Algebra in Mizar-Reference-Cited by-同舟云学术

Formalization of the Nominative Algorithmic Algebra in Mizar

Published:2017-09-07 Issue: Volume: Page:176-186
ISSN:2194-5357
Container-title:Information Systems Architecture and Technology: Proceedings of 38th International Conference on Information Systems Architecture and Technology – ISAT 2017
language:
Short-container-title:

Author:

Korniłowicz Artur,Kryvolap Andrii,Nikitchenko Mykola,Ivanov Ievgen

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-67229-8_16

Reference22 articles.

1. International Telecommunication Union: Overview of the Internet of Things. ITU-T Recommendation Y.4000/Y.2060, June 2012. http://handle.itu.int/11.1002/1000/11559

2. Wiedijk, F. (ed.): The Seventeen Provers of the World. Lecture Notes in Artificial Intelligence, vol. 3600. Springer, Heidelberg (2006)

3. The CompCert project. http://compcert.inria.fr

4. CakeML: A verified implementation of ML. https://cakeml.org

5. The seL4 Microkernel. https://sel4.systems

Cited by 12 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Partial Correctness of an Algorithm Computing Lucas Sequences;Formalized Mathematics;2020-12-01

2. General Theory and Tools for Proving Algorithms in Nominative Data Systems;Formalized Mathematics;2020-12-01

3. Partial Correctness of a Fibonacci Algorithm;Formalized Mathematics;2020-07-01

4. Expressibility in the Kleene Algebra of Partial Predicates with the Complement Composition;Information and Communication Technologies in Education, Research, and Industrial Applications;2020

5. Partial Correctness of a Power Algorithm;Formalized Mathematics;2019-07-01