Universal realization, persistent interconnection and implementation of abstract modules

Goguen, Joseph A.; Meseguer, José

doi:10.1007/bfb0012775

Cited by 87 publications

(24 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…There had been some work on behavioural interpretation of specifications before ASL, notably [GGM76], [Rei81], [GM82] and [Gan83]. ASL introduced behavioural abstraction as an explicit construct, which facilitated understanding of the relationship between behaviourally abstracted specifications and "normal" specifications in a single language.…”

Section: Behavioural Specificationsmentioning

confidence: 99%

The Foundational Legacy of ASL

Sannella

Tarlecki

2015

Software, Services, and Systems

View full text Add to dashboard Cite

show abstract

Section: Behavioural Specificationsmentioning

confidence: 99%

The Foundational Legacy of ASL

Sannella

Tarlecki

2015

Software, Services, and Systems

View full text Add to dashboard Cite

show abstract

“…Hence (d)⇔(a). But a proof of this was already in [9] and [14], albeit in a slightly different setting.…”

Section: Characterizing Parametric Specificationsmentioning

confidence: 99%

“…Some syntactic parametricity conditions, ensuring that consistent refinements of the parameter induce consistent refinements of the body, were proposed early on [9,14]. However, the analogous semantic characterizations, ensuring that models of the parameter induce models of the body, were given only in terms of free functors, which only exist for (essentially) algebraic specifications, i.e.…”

Section: Fieldmentioning

confidence: 99%

Semantics of First Order Parametric Specifications

Pavlović

1999

FM’99 — Formal Methods

View full text Add to dashboard Cite

Abstract. Parametricity is one of the most effective ways to achieve compositionality and reuse in software development. Parametric specifications have been thoroughly analyzed in the algebraic setting and are by now a standard part of most software development toolkits. However, an effort towards classifying, specifying and refining algorithmic theories, rather than mere datatypes, quickly leads beyond the realm of algebra, and often to full first order theories. We extend the standard semantics of parametric specifications to this more general setting.The familiar semantic characterization of parametricity in the algebraic case is expressed in terms of the free functor, i.e. using the initial models. In the general case, initial models may not exist, and the free functor is not available. Various syntactic, semantic, and abstract definitions of parametricity have been offered, but their exact relationships are often unclear. Using the methods of categorical model theory, we establish the equivalence of two well known, yet so far unrelated, definitions of parametricity, one syntactic, one semantic. Besides providing support for both underlying views, and a way for aligning the systems based on each of them, the offered general analysis and its formalism open several avenues for future research and applications.

show abstract

“…Each clause C is a set of atomic formulae (i e., the ordering and multiplicity of the atomic formulae 1 We do not address the problem of empty sorts here and will present calculi which work under the assumption that sorts are not empty We will usually gave signatures with at least one constant for every sort, but other means of restricting the signatures [19,10] or ensuring nonemptiness [10,12] can be used instead. It seems also that the most flexible approach which generalizes calculus by introducing explicit variables [10,11,7] can be adapted to our framework.…”

Section: The Specification Languagementioning

confidence: 99%

Generated models and the ω-rule: The nondeterministic case

Walicki

Meldal

1995

TAPSOFT '95: Theory and Practice of Software Development

View full text Add to dashboard Cite

Abstract.A language for specifying nondeterminisuc operations which generalizes the equational specificauon language is introduced. Then, vanous notions of generated multimodels are discussed and sufficmnt condiuons for the existence of quasi-initial semanucs of nondeterministic specifications are given. Two calculi are introduced: NEQ and NIP. The former is sound and complete with respect to the class of all muhimodels. The latter is an extension of the former veuh the ta-mle. It is sound and complete with respect to one of the classes of the generated mulnmodels. The calcuh reduce to the respective determimstic calculi whenever the specffl cation involves only deterministic operations.

show abstract

Universal realization, persistent interconnection and implementation of abstract modules

Cited by 87 publications

References 19 publications

The Foundational Legacy of ASL

The Foundational Legacy of ASL

Semantics of First Order Parametric Specifications

Generated models and the ω-rule: The nondeterministic case

Contact Info

Product

Resources

About