命令式程序的微积分:形式化和实现

2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2009-09-26 DOI:10.1109/SYNASC.2009.42

Madalina Erascu, T. Jebelean

{"title":"命令式程序的微积分:形式化和实现","authors":"Madalina Erascu, T. Jebelean","doi":"10.1109/SYNASC.2009.42","DOIUrl":null,"url":null,"abstract":"As an extension of our previous work on imperative program verification, we present a formalism for handling the total correctness of While loops in imperative programs, consisting in functional based definitions of the verification conditions for both partial correctness and for termination.A specific feature of our approach is the generation of verification conditions as first order formulae, including the termination condition which is expressed as an induction principle.","PeriodicalId":286180,"journal":{"name":"2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"147 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"A Calculus for Imperative Programs: Formalization and Implementation\",\"authors\":\"Madalina Erascu, T. Jebelean\",\"doi\":\"10.1109/SYNASC.2009.42\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"As an extension of our previous work on imperative program verification, we present a formalism for handling the total correctness of While loops in imperative programs, consisting in functional based definitions of the verification conditions for both partial correctness and for termination.A specific feature of our approach is the generation of verification conditions as first order formulae, including the termination condition which is expressed as an induction principle.\",\"PeriodicalId\":286180,\"journal\":{\"name\":\"2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing\",\"volume\":\"147 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-09-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SYNASC.2009.42\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SYNASC.2009.42","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 6

摘要

作为我们之前关于命令式程序验证工作的扩展，我们提出了一种处理命令式程序中While循环的总正确性的形式化方法，包括部分正确性和终止性验证条件的基于函数的定义。我们方法的一个特点是作为一阶公式生成验证条件，包括用归纳原理表示的终止条件。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A Calculus for Imperative Programs: Formalization and Implementation

As an extension of our previous work on imperative program verification, we present a formalism for handling the total correctness of While loops in imperative programs, consisting in functional based definitions of the verification conditions for both partial correctness and for termination.A specific feature of our approach is the generation of verification conditions as first order formulae, including the termination condition which is expressed as an induction principle.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing

自引率

0.00%

发文量