scientific article; zbMATH DE number 3878342
[For the entire collection see Zbl 0542.00016.] It has become customary to focus attention on the semantic aspects of specification and implementation, a model theoretic or algebraic viewpoint. We feel, however, that certain concepts are best dealt with at the syntactic level, rather than via a detour through semantics, and that implementation is one of these concepts. We regard logic as the most appropriate medium for talking about specification. In this paper, we give a syntactic account of implementation and prove the basic results -- composability of implementations and how to deal with structured (hierarchical) specifications modularly -- for abstract data types.
- Specification and initialization of a logic computer system
- On observational equivalence and algebraic specification
- Implementing specifications by dynamic inheritance
- On pushout consistency, modularity and interpolation for logical specifications
- On local modularity variants and \(\Pi\)-institutions
- On methods for safe introduction of operations
- scientific article; zbMATH DE number 3936498 (Why is no real title available?)
- Refinement and implementation
- scientific article; zbMATH DE number 1902048 (Why is no real title available?)
- On the Modularization Theorem for logical specifications
- On the fragility of interpolation
- A language for configuring multi-level specifications
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3343424)