Specificational functions

Author:

Morris J. M.1,Bunkenburg A.1

Affiliation:

1. Univ. of Glasgow, Glasgow, Scotland, UK

Abstract

Mathematics supplies us with various operators for creating functions from relations, sets, known functions, and so on. Function inversion is a simple example. These operations are useful in specifying programs. However, many of them have strong constraints on their arguments to ensure that the result is indeed a function. For example, only functions that are bijective may be inverted. This is a serious impediment to their use in specifications, because at best it limits the specifier's expressive power, and at worst it imposes strong proof obligations on the programmer. We propose to loosen the definition of functions so that the constraints on operations such as inversion can be greatly relaxed. The specificational functions that emerge generalize traditional functions in that their application to some arguments may yield no good outcome, while for other arguments their application may yield any of several outcomes unpredictably. While these functions are not in general algorithmic, they can serve as specifications of traditional functions as embodied in programming languages. The idea of specificational functions is not new, but accommodating them in all their generality without falling foul of a myriad of anomalies has proved elusive. We investigate the technical problems that have hindered their use, and propose solutions. In particular, we develop a formal axiomatization for reasoning about specificational functions, and we prove its consistency by constructing a model.

Publisher

Association for Computing Machinery (ACM)

Subject

Software

Reference27 articles.

1. BICARREGUI J. C. FITZGERALD J. S. LINDSAY P. t. MOORE R. AND RITCHIE B. 1994. Proof in VDM: A practioner's guide. FACIT. Springer Verlag. BICARREGUI J. C. FITZGERALD J. S. LINDSAY P. t. MOORE R. AND RITCHIE B. 1994. Proof in VDM: A practioner's guide. FACIT. Springer Verlag.

2. BIRD R. AND DE MOOR O. 1997. Algebra of Programming. Prentice Hall London. ISBN 0-13- 507245-X. BIRD R. AND DE MOOR O. 1997. Algebra of Programming. Prentice Hall London. ISBN 0-13- 507245-X.

3. BRINK C. AND SCHMIDT CJ. 1996. Relational Methods in Computer Science. Springer Verlag. Supplemental volume of the journal Computing. BRINK C. AND SCHMIDT CJ. 1996. Relational Methods in Computer Science. Springer Verlag. Supplemental volume of the journal Computing.

4. BUNKENBURG t. 1997. Expression Refinement. Ph.D. thesis Computing Science Department University of Glasgow. BUNKENBURG t. 1997. Expression Refinement. Ph.D. thesis Computing Science Department University of Glasgow.

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

1. The Semantics of Plurals;Proceedings of the 15th ACM SIGPLAN International Conference on Software Language Engineering;2022-11-29

2. How to Calculate with Nondeterministic Functions;Lecture Notes in Computer Science;2019

3. Template-based program verification and program synthesis;International Journal on Software Tools for Technology Transfer;2012-01-25

4. Dually nondeterministic functions;ACM Transactions on Programming Languages and Systems;2008-10

5. Modelling higher-order dual nondeterminacy;Acta Informatica;2008-06-21

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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