Tool support for relational formalisms in programming and specification

编程和规范中关系形式主义的工具支持

• 批准号: 262144-2007
• 负责人: Kahl, Wolfram
• 金额: $ 1.68万
• 依托单位: McMaster University
• 依托单位国家: 加拿大
• 项目类别: Discovery Grants Program - Individual
• 财政年份: 2011
• 资助国家: 加拿大
• 起止时间: 2011-01-01 至 2012-12-31
• 项目状态: 已结题
• 来源: https://www.nserc-crsng.gc.ca/ase-oro/Details-Detailles_eng.asp?id=480172
• 关键词: Tool; support; relational; formalisms; programming

The goal of this research is to improve software developers' productivity and confidence in their products by expanding the use of relational abstractions in different stages of software development. It is well-known that in many application areas, in particular where networks of any kind are involved, concise relation-algebraic specifications are available for many tasks. This research will open up new ways to make many of these specifications executable, with efficient, automatically tuned implementations. In addition, similar formulations can be used in a wide range of applications, including "fuzzy" decision finding, configuration changes via graph transformations, and communication protocols. This research will build a unified framework of tool support for specifying, programming, and reasoning in this family of languages. It will study both stand-alone relation-based specification and programming, and embedding in functional programming, as well as new foundations for functional-logic programming.

这项研究的目标是通过在软件开发的不同阶段扩展关系抽象的使用来提高软件开发人员的生产力和对其产品的信心。 众所周知，在许多应用领域，特别是涉及任何类型的网络的地方，简洁的关系代数规范可用于许多任务。 这项研究将开辟新的方法，通过高效、自动调整的实现，使许多规范变得可执行。 此外，类似的公式可用于广泛的应用，包括“模糊”决策查找、通过图形转换进行配置更改以及通信协议。 这项研究将为该语言家族的指定、编程和推理建立一个统一的工具支持框架。 它将研究独立的基于关系的规范和编程，以及函数式编程的嵌入，以及函数式逻辑编程的新基础。