Provably correct derivation of algorithms using FermaT

Author:

Ward Martin1,Zedan Hussein1

Affiliation:

1. Software Technology Research Lab, De Montfort University, Bede Island Building, LE1 9BH, The Gateway, Leicester, UK

Abstract

Abstract The transformational programming method of algorithm derivation starts with a formal specification of the result to be achieved, plus some informal ideas as to what techniques will be used in the implementation. The formal specification is then transformed into an implementation, by means of correctness-preserving refinement and transformation steps, guided by the informal ideas. The transformation process will typically include the following stages: (1) Formal specification (2) Elaboration of the specification, (3) Divide and conquer to handle the general case (4) Recursion introduction, (5) Recursion removal, if an iterative solution is desired, (6) Optimisation, if required. At any stage in the process, sub-specifications can be extracted and transformed separately. The main difference between this approach and the invariant based programming approach (and similar stepwise refinement methods) is that loops can be introduced and manipulated while maintaining program correctness and with no need to derive loop invariants. Another difference is that at every stage in the process we are working with a correct program: there is never any need for a separate “verification” step. These factors help to ensure that the method is capable of scaling up to the development of large and complex software systems. The method is applied to the derivation of a complex linked list algorithm and produces code which is over twice as fast as the code written by Donald Knuth to solve the same problem.

Publisher

Association for Computing Machinery (ACM)

Subject

Theoretical Computer Science,Software

Reference51 articles.

1. ISO JTC 1/SC 7 (2006) Software engineering—software life cycle processes—maintenance. ISO/IEC 14764:2006

2. An Open Extensible Tool Environment for Event-B

3. Invariant based programming: basic approach and teaching experiences

4. Bauer FL (1979) Program development by stepwise transformations—the project CIP. In: Goos G Hartmanis H (eds) Program construction. Lecture Notes in Computer Science. #69 Springer New York pp 237–266

5. Bauer FL Berghammer R et al The CIP Language Group (1985) The Munich Project CIP. Volume I: the wide spectrum language CIP-L. Lecture Notes in Computer Science #183 Springer New York

Cited by 3 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Formality, Agility, Security, and Evolution in Software Engineering;Software Technology: 10 Years of Innovation in IEEE Computer;2018-09-03

2. Enabling code transformations with FermaT on simplified bytecode;Journal of Software: Evolution and Process;2017-02-20

3. The formal semantics of program slicing for nonterminating computations;Journal of Software: Evolution and Process;2016-10-04

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3