کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
10329288 | 685348 | 2005 | 21 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A Proof Calculus for Natural Semantics Based on Greatest Fixed Point Semantics
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: A Proof Calculus for Natural Semantics Based on Greatest Fixed Point Semantics A Proof Calculus for Natural Semantics Based on Greatest Fixed Point Semantics](/preview/png/10329288.png)
چکیده انگلیسی
Formal semantics of programming languages needs to model the potentially infinite state transition behavior of programs as well as the computation of their final results simultaneously. This requirement is essential in correctness proofs for compilers. We show that a greatest fixed point interpretation of natural semantics is able to model both aspects equally well. Technically, we infer this interpretation of natural semantics based on an easily omprehensible introduction to the dual definition and proof principles of induction and coinduction. Furthermore, we develop a proof calculus based on it and demonstrate its application for two typical problems.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Electronic Notes in Theoretical Computer Science - Volume 132, Issue 1, 30 May 2005, Pages 73-93
Journal: Electronic Notes in Theoretical Computer Science - Volume 132, Issue 1, 30 May 2005, Pages 73-93
نویسندگان
Sabine Glesner,