Proving Assertions About Programs最新文献

筛选
英文 中文
The correctness of numerical algorithms 数值算法的正确性
Proving Assertions About Programs Pub Date : 1900-01-01 DOI: 10.1145/800235.807073
T. E. Hull, W. Enright, A. Sedgwick
{"title":"The correctness of numerical algorithms","authors":"T. E. Hull, W. Enright, A. Sedgwick","doi":"10.1145/800235.807073","DOIUrl":"https://doi.org/10.1145/800235.807073","url":null,"abstract":"Structured programming and the use of assertions are two basic techniques needed in organizing proofs of the correctness of algorithms. These techniques can be combined with theorems in numerical analysis to produce proofs of the correctness of numerical algorithms.\u0000 A simple algorithm for finding the sum of n numbers is first used to show how assertions can be modified to take account of the effect of roundoff. A so-called backward error analysis then leads to a proof that the algorithm is correct in the sense that it produces exact results for slightly perturbed problems. Alternative points of view are possible, and one of the distinguishing features of numerical algorithms is that there usually are a number of different senses in which one might want to prove them correct.\u0000 Two other more substantial algorithms, one for solving linear algebraic equations and one for solving differential equations, are then used to show how structured programming and the use of assertions can be combined with error analyses of fairly complicated numerical processes to provide proofs of correctness. One of these algorithms involves roundoff error while the other is affected primarily by truncation error.","PeriodicalId":406987,"journal":{"name":"Proving Assertions About Programs","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126104589","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 19
Formal development of correct algorithms: An example based on earley's recogniser 正确算法的形式化开发:一个基于earley识别器的例子
Proving Assertions About Programs Pub Date : 1900-01-01 DOI: 10.1145/800235.807083
Cliff B. Jones
{"title":"Formal development of correct algorithms: An example based on earley's recogniser","authors":"Cliff B. Jones","doi":"10.1145/800235.807083","DOIUrl":"https://doi.org/10.1145/800235.807083","url":null,"abstract":"This paper contains the formal development of a correct algorithm from an implicit definition of the task to be performed. Each step of the development can be accompanied by a proof of its correctness. As well as ensuring the correctness of the final program, the structured development gives considerable insight into the algorithm and possible alternatives. The example used is a simplified form of the recognition algorithm due to Earley.","PeriodicalId":406987,"journal":{"name":"Proving Assertions About Programs","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131047473","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 39
The "most recent" error: Its causes and correction “最近的”错误:其原因和纠正
Proving Assertions About Programs Pub Date : 1900-01-01 DOI: 10.1145/942578.807085
C. McGowan
{"title":"The \"most recent\" error: Its causes and correction","authors":"C. McGowan","doi":"10.1145/942578.807085","DOIUrl":"https://doi.org/10.1145/942578.807085","url":null,"abstract":"","PeriodicalId":406987,"journal":{"name":"Proving Assertions About Programs","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126529294","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Calculating properties of programs by valuations on specific models 通过对特定模型的赋值来计算程序的性质
Proving Assertions About Programs Pub Date : 1900-01-01 DOI: 10.1145/800235.807086
M. Sintzoff
{"title":"Calculating properties of programs by valuations on specific models","authors":"M. Sintzoff","doi":"10.1145/800235.807086","DOIUrl":"https://doi.org/10.1145/800235.807086","url":null,"abstract":"The proof that a program verifies some property is carried out by the valuation of the program in a model characterizing that property. Specific models are given for sufficient conditions of the correctness of types, locations and asynchronous computations; a hypothetical programming language is used, which includes functions and locations and allows their recursive composition. The application of the method in studying termination or correctness problems is discussed on particular programs.","PeriodicalId":406987,"journal":{"name":"Proving Assertions About Programs","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121754135","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 51
Implementation and applications of Scott's logic for computable functions 可计算函数中Scott逻辑的实现与应用
Proving Assertions About Programs Pub Date : 1900-01-01 DOI: 10.1145/800235.807067
R. Milner
{"title":"Implementation and applications of Scott's logic for computable functions","authors":"R. Milner","doi":"10.1145/800235.807067","DOIUrl":"https://doi.org/10.1145/800235.807067","url":null,"abstract":"The basis for this paper is a logic designed by Dana Scott [1] in 1969 for formalizing arguments about computable functions of higher type. This logic uses typed combinators, and we give a more or less direct translation into typed λ-calculus, which is an easier formalism to use, though not so easy for the metatheory because of the presence of bound variables. We then describe, by example only, a proof-checker program which has been implemented for this logic; the program is fully described in [2]. We relate the induction rule which is central to the logic to two more familiar rules - Recursion Induction and Structural Induction - showing that the former is a theorem of the logic, and that for recursively defined structures the latter is a derived rule of the logic. Finally we show how the syntax and semantics of a simple programming language may be described completely in the logic, and we give an example of a theorem which relates syntactic and semantic properties of programs and which can be stated and proved within the logic.","PeriodicalId":406987,"journal":{"name":"Proving Assertions About Programs","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115923596","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 113
Correctness of a compiler for a Lisp subset Lisp子集编译器的正确性
Proving Assertions About Programs Pub Date : 1900-01-01 DOI: 10.1145/800235.807080
R. L. London
{"title":"Correctness of a compiler for a Lisp subset","authors":"R. L. London","doi":"10.1145/800235.807080","DOIUrl":"https://doi.org/10.1145/800235.807080","url":null,"abstract":"Excerpts of a proof of correctness of a running Lisp compiler for the PDP-10 computer are given. Included are the rationale for presenting this proof and a discussion of an actual extension of the proof to another compiler.","PeriodicalId":406987,"journal":{"name":"Proving Assertions About Programs","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116973925","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 32
The equivalence of models of tasking 任务模型的等价性
Proving Assertions About Programs Pub Date : 1900-01-01 DOI: 10.1145/800235.807084
D. Berry
{"title":"The equivalence of models of tasking","authors":"D. Berry","doi":"10.1145/800235.807084","DOIUrl":"https://doi.org/10.1145/800235.807084","url":null,"abstract":"A technique for proving the equivalence of implementations of multi-tasking programming languages is developed and applied to proving the equivalence of the contour model and a multi-tasking version of the copy rule.","PeriodicalId":406987,"journal":{"name":"Proving Assertions About Programs","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117103364","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
An algebraic description of programs with assertions, verification and simulation 具有断言、验证和仿真的程序的代数描述
Proving Assertions About Programs Pub Date : 1900-01-01 DOI: 10.1145/800235.807068
R. Burstall
{"title":"An algebraic description of programs with assertions, verification and simulation","authors":"R. Burstall","doi":"10.1145/800235.807068","DOIUrl":"https://doi.org/10.1145/800235.807068","url":null,"abstract":"A program in flow diagram form is described by a function from a free category to the category of sets and relations. Attaching assertions to it is described as a natural transformation and so is simulation of one program by another with the same shape of flow diagram. These notions are used to prove the theorems justifying Floyd's method of proving correctness by verification and Milner's method of proving simulation, restricted to programs of similar form. The treatment is novel but the results are not new, except that non-deterministic programs are dealt with throughout.","PeriodicalId":406987,"journal":{"name":"Proving Assertions About Programs","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126043586","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 30
Inductive methods for proving properties of programs 证明程序性质的归纳法
Proving Assertions About Programs Pub Date : 1900-01-01 DOI: 10.1145/800235.807070
Z. Manna, Stephen Nes, J. Vuillemin
{"title":"Inductive methods for proving properties of programs","authors":"Z. Manna, Stephen Nes, J. Vuillemin","doi":"10.1145/800235.807070","DOIUrl":"https://doi.org/10.1145/800235.807070","url":null,"abstract":"We have two main purposes in this paper. First, we clarify and extend known results about computation of recursive programs, emphasizing the difference between the theoretical and practical approaches. Secondly, we present and examine various known methods for proving properties of recursive programs. We discuss in detail two powerful inductive methods, computational induction and structural induction, illustrating their applications by various examples. We also briefly discuss some other related methods.\u0000 Our aim in this work is to introduce inductive methods to as wide a class of readers as possible and to demonstrate their power as practical techniques. We ask the forgiveness of our more theoretical-minded colleagues for our occasional choice of clarity over precision.","PeriodicalId":406987,"journal":{"name":"Proving Assertions About Programs","volume":"118 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123239714","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 121
Recursive definitions of partial functions and their computations 部分函数的递归定义及其计算
Proving Assertions About Programs Pub Date : 1900-01-01 DOI: 10.1145/800235.807072
Jean-Marie Cadiou
{"title":"Recursive definitions of partial functions and their computations","authors":"Jean-Marie Cadiou","doi":"10.1145/800235.807072","DOIUrl":"https://doi.org/10.1145/800235.807072","url":null,"abstract":"The object of this paper is to present a syntactic and semantic model for recursive definitions, and to study the relation between their computed functions and their fixpoints. The recursive definitions that we consider are syntactic generalizations of those introduced in [2] by Kleene and in [5] by McCarthy.\u0000 Each recursive definition yields two classes of fixpoint partial functions (“fixpoints over D &ugr; {ω}” and “fixpoints over D”), and a class of computed partial functions obtained by applying different computation rules to the recursive definition. In this work we first describe the relations between the computed functions and the fixpoints over D &ugr; {ω} (Theorem 1), and between the computed functions and the fixpoints over D (Theorem 2). Our main interest is in the class of fixpoints (over D or D &ugr; {ω}) which are also computed functions of the recursive definition.","PeriodicalId":406987,"journal":{"name":"Proving Assertions About Programs","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125909465","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 82
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书