Property-oriented semantics of structured specifications

We consider structured specifications built from flat specifications using union, translation and hiding with their standard model-class semantics in the context of an arbitrary institution. We examine the alternative of sound property-oriented semantics for such specifications, and study their rela...

Full description

Saved in:
Bibliographic Details
Published in:Mathematical structures in computer science 2014-04, Vol.24 (2), p.np-np, Article e240205
Main Authors: SANNELLA, DONALD, TARLECKI, ANDRZEJ
Format: Article
Language:English
Subjects:
Applied mathematics
Completeness
Computer science
Mathematical models
Semantics
Sound
Specifications
Translations
Unions
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We consider structured specifications built from flat specifications using union, translation and hiding with their standard model-class semantics in the context of an arbitrary institution. We examine the alternative of sound property-oriented semantics for such specifications, and study their relationship to model-class semantics. An exact correspondence between the two (completeness) is not achievable in general. We show through general results on property-oriented semantics that the semantics arising from the standard proof system is the strongest sound and compositional property-oriented semantics in a wide class of such semantics. We also sharpen one of the conditions that does guarantee completeness and show that it is a necessary condition.
ISSN:0960-1295
1469-8072
DOI:10.1017/S0960129513000212