当前位置: X-MOL 学术J. Log. Algebr. Methods Program. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Specifying with syntactic theory functors
Journal of Logical and Algebraic Methods in Programming ( IF 0.9 ) Pub Date : 2020-04-02 , DOI: 10.1016/j.jlamp.2020.100543
Magne Haveraaen , Markus Roggenbach

We propose a framework, syntactic theory functors (STFs), for creating syntactic structuring mechanisms for specification languages. Good support for common reuse patterns is important for systematically developing specifications for large systems. Though immaterial to foundational theory, lack of support otherwise causes lengthy writing of boilerplate code or repeated adaptation from one context to another.

We present STFs in the context of the Goguen & Burstall institution theory. This theory captures the essential structure of ontologies, modelling and formal specifications (OMS). In particular it provides powerful structuring mechanisms that are independent of the specification formalism, i.e., they are institution-independent.

The presented STF framework is institution-independent as well. As such it encompasses many approaches to software and information systems. STFs subsume the standard institution-independent structuring mechanisms, and open up new ways of reusing existing and structuring new specifications. In this, STFs subsume and enrich the tool-set of ‘good practices’, which includes separation of concerns, ease of reuse of specification-text, and improved theorem proving support. STFs are aimed at structuring and reuse beyond the classical mechanisms.

However, most STFs are institution-specific and support specific reuse patterns in that institution. With such institution-specific STFs it is possible to incrementally grow more complex institutions from simpler ones. This is very much needed when developing ontologies or specification languages for a new domain.

In this paper, we motivate STFs with examples in Casl, the common standard algebraic specification language. We further demonstrate how STFs can ease specification through capturing repeated constructions once and for all as patterns formulated as STFs.



中文翻译:

用句法理论函子指定

我们提出了一个框架,语法理论函子(STF),用于为规范语言创建语法结构化机制。对通用重用模式的良好支持对于系统地开发大型系统的规范很重要。尽管对基础理论不重要,但缺乏支持会导致冗长的样板代码编写或从一个上下文到另一个上下文的反复适应。

我们在Goguen&Burstall制度理论的背景下介绍STF。该理论涵盖了本体,建模和形式规范(OMS)的基本结构。特别是,它提供了独立于规范形式主义的强大结构化机制,即它们与机构无关。

提出的STF框架也与机构无关。因此,它涵盖了许多软件和信息系统方法。STF包含了独立于机构的标准结构机制,并开辟了重用现有方法和结构新规范的新方式。在这种情况下,STF包含并丰富了“良好实践”的工具集,其中包括关注点分离,规范文本易于重用以及改进的定理证明支持。STF旨在超越传统机制的结构和重用。

但是,大多数STF是特定于机构的,并且在该机构中支持特定的重用模式。借助此类特定于机构的STF,有可能将较简单的机构逐步发展为更复杂的机构。在为新域开发本体或规范语言时,这是非常需要的。

在本文中,我们通过Casl(常见的标准代数规范语言)中的示例来激发STF 。我们进一步演示了STF如何通过一劳永逸地捕获重复的构造作为制定为STF的模式来简化规范。

更新日期:2020-04-02
down
wechat
bug