Wave Equation Numerical Resolution: A Comprehensive Mechanized Proof of a C Program
نویسندگان
چکیده
منابع مشابه
Wave Equation Numerical Resolution: Mathematics and Program
We formally prove the C program that implements a simple numerical scheme for the resolution of the one-dimensional acoustic wave equation. Such an implementation introduces errors at several levels: the numerical scheme introduces method errors, and the floating-point computation leads to round-off errors. We formally specify in Coq the numerical scheme, prove both the method error and the rou...
متن کاملa swot analysis of the english program of a bilingual school in iran
با توجه به جایگاه زبان انگلیسی به عنوان زبانی بین المللی و با در نظر گرفتن این واقعیت که دولت ها و مسئولان آموزش و پرورش در سراسر جهان در حال حاضر احساس نیاز به ایجاد موقعیتی برای کودکان جهت یاد گیری زبان انگلیسی درسنین پایین در مدارس دو زبانه می کنند، تحقیق حاضر با استفاده از مدل swot (قوت ها، ضعف ها، فرصتها و تهدیدها) سعی در ارزیابی مدرسه ای دو زبانه در ایران را دارد. جهت انجام این تحقیق در م...
15 صفحه اولA Mechanized Program Verifier
In my view, the “verification problem” is the theorem proving problem, restricted to a computational logic. My approach is: adopt a functional programming language, build a general purpose formal reasoning engine around it, integrate it into a program and proof development environment, and apply it to model and verify a wide variety of computing artifacts, usually modeled operationally within t...
متن کاملFormal Proof of a Wave Equation Resolution Scheme: The Method Error
Popular finite difference numerical schemes for the resolution of the one-dimensional acoustic wave equation are well-known to be convergent. We present a comprehensive formalization of the simplest scheme and formally prove its convergence in Coq. The main difficulties lie in the proper definition of asymptotic behaviors and the implicit way they are handled in the mathematical pen-and-paper p...
متن کاملMechanized semantics - with applications to program proof and compiler verification
The semantics of a programming language describe mathematically the meaning of programs written in this language. An example of use of semantics is to define a programming language with much greater precision than standard language specifications written in English. (See for example the definition of Standard ML [35].) In turn, semantics enable us to formally verify some programs, proving that ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Automated Reasoning
سال: 2012
ISSN: 0168-7433,1573-0670
DOI: 10.1007/s10817-012-9255-4