The Automation of C Program Verification by Symbolic Method of Loop Invariants Elimination
During deductive verification of programs written in imperative languages, the generation and proof of verification conditions corresponding to loops can cause difficulties, because each one must be provided with an invariant whose construction is often a challenge. As a rule, the methods of invaria...
محفوظ في:
| المؤلفون الرئيسيون: | , , |
|---|---|
| التنسيق: | Artigo |
| اللغة: | Inglês |
| منشور في: |
Yaroslavl State University
2018-10-01
|
| سلاسل: | Моделирование и анализ информационных систем |
| الموضوعات: | |
| الوصول للمادة أونلاين: | https://www.mais-journal.ru/jour/article/view/745 |
| الوسوم: |
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|