Show simple item record

dc.contributor.authorHaveraaen, Magne
dc.contributor.authorRoggenbach, Marcus
dc.date.accessioned2021-10-05T08:13:35Z
dc.date.available2021-10-05T08:13:35Z
dc.date.created2021-10-04T13:09:24Z
dc.date.issued2020
dc.identifier.issn2352-2208
dc.identifier.urihttps://hdl.handle.net/11250/2787611
dc.description.abstractWe 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.en_US
dc.language.isoengen_US
dc.publisherElsevieren_US
dc.relation.urihttps://doi.org/10.1016/j.jlamp.2020.100543
dc.rightsNavngivelse 4.0 Internasjonal*
dc.rights.urihttp://creativecommons.org/licenses/by/4.0/deed.no*
dc.titleSpecifying with syntactic theory functorsen_US
dc.typeJournal articleen_US
dc.typePeer revieweden_US
dc.description.versionpublishedVersionen_US
dc.rights.holderCopyright 2020 the authorsen_US
dc.source.articlenumber100543en_US
cristin.ispublishedtrue
cristin.fulltextoriginal
cristin.qualitycode2
dc.identifier.doi10.1016/j.jlamp.2020.100543
dc.identifier.cristin1943041
dc.source.journalJournal of Logical and Algebraic Methods in Programmingen_US
dc.identifier.citationJournal of Logical and Algebraic Methods in Programming. 2020, 113, 100543.en_US
dc.source.volume113en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

Navngivelse 4.0 Internasjonal
Except where otherwise noted, this item's license is described as Navngivelse 4.0 Internasjonal