Next Article in Journal
Q-Rung Probabilistic Dual Hesitant Fuzzy Sets and Their Application in Multi-Attribute Decision-Making
Previous Article in Journal
Ridge Fuzzy Regression Modelling for Solving Multicollinearity
 
 
Search for Articles:
Title / Keyword
Author / Affiliation / Email
Journal
Article Type
 
 
Advanced Search
 
Section
Special Issue
Volume
Issue
Number
Page
 
Journals
Mathematics
Volume 8
Issue 9
10.3390/math8091573
mathematics-logo
Submit to this Journal Review for this Journal Propose a Special Issue
► Article Menu

Article Menu

share Share announcement Help format_quote Cite question_answer Discuss in SciProfiles
first_page
settings
Order Article Reprints
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Coinductive Natural Semantics for Compiler Verification in Coq †

by
Angel Zúñiga
1,* and
Gemma Bel-Enguix
2
1
Posgrado en Ciencia e Ingeniería de la Computación, Instituto de Investigaciones en Matemáticas Aplicadas y en Sistemas, Universidad Nacional Autónoma de México, Mexico City 04510, Mexico
2
Instituto de Ingeniería, Universidad Nacional Autónoma de México, Mexico City 04510, Mexico
*
Author to whom correspondence should be addressed.
†
This paper is an extension of: Zúñiga, A.; Bel-Enguix, G. A Correct Compiler from Mini-ML to a Big-Step Machine Verified Using Natural Semantics in Coq. In Proceedings of the XVIII Jornadas de PROgramación y LEnguajes (PROLE 2018), Seville, Spain, 17–19 September 2018.
Mathematics 2020, 8(9), 1573; https://doi.org/10.3390/math8091573
Submission received: 4 July 2020 / Revised: 1 September 2020 / Accepted: 9 September 2020 / Published: 12 September 2020
(This article belongs to the Section E1: Mathematics and Computer Science)
Browse Figure
Versions Notes

Abstract

(Coinductive) natural semantics is presented as a unifying framework for the verification of total correctness of compilers in Coq (with the feature that a verified compiler can be obtained). In this way, we have a simple, easy, and intuitive framework; to carry out the verification of a compiler, using a proof assistant in which both cases are considered: terminating and non-terminating computations (total correctness).
Keywords: natural semantics; big-step semantics; coinduction; compiler verification; total correctness; Mini-ML; SECD machine; Coq proof assistant natural semantics; big-step semantics; coinduction; compiler verification; total correctness; Mini-ML; SECD machine; Coq proof assistant

Share and Cite

MDPI and ACS Style

Zúñiga, A.; Bel-Enguix, G. Coinductive Natural Semantics for Compiler Verification in Coq. Mathematics 2020, 8, 1573. https://doi.org/10.3390/math8091573

AMA Style

Zúñiga A, Bel-Enguix G. Coinductive Natural Semantics for Compiler Verification in Coq. Mathematics. 2020; 8(9):1573. https://doi.org/10.3390/math8091573

Chicago/Turabian Style

Zúñiga, Angel, and Gemma Bel-Enguix. 2020. "Coinductive Natural Semantics for Compiler Verification in Coq" Mathematics 8, no. 9: 1573. https://doi.org/10.3390/math8091573

APA Style

Zúñiga, A., & Bel-Enguix, G. (2020). Coinductive Natural Semantics for Compiler Verification in Coq. Mathematics, 8(9), 1573. https://doi.org/10.3390/math8091573

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop