Toward formal development of programs from algebraic specifications: Implementations revisited (Q1090100): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: ML / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4152697 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3677154 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Axioms for abstract model theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Programming in a wide spectrum language: A collection of examples / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3709866 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3695436 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic implementations preserve program correctness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial abstract types / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3731650 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3906394 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3667921 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing equivalences for processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3917479 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Theory of Specification, Implementation, and Parametrization of Abstract Data Types / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3341871 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3947104 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic implementation of abstract data types / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3906461 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221381 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3667933 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Specifications: Parameter Passing and Implementation with Respect to Observability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4105777 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic and operational semantics of specifications allowing exceptions and errors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3332238 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some fundamental algebraic tools for the semantics of computation. I. Comma categories, colimits, signatures and theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4723263 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3719824 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3956373 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Initial Algebra Semantics and Continuous Algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4199490 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Report on the Larch shared language / rank
 
Normal rank
Property / cites work
 
Property / cites work: Final Data Types and Their Specification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3668830 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4693151 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Deductive Approach to Program Synthesis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3687683 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of type polymorphism in programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3686016 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3677150 / rank
 
Normal rank
Property / cites work
 
Property / cites work: LCF considered as a programming language / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3938468 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3707381 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3677153 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3345753 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4725720 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On observational equivalence and algebraic specification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4721633 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3954805 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3666260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the existence of free models in abstract algebraic institutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-varieties in abstract algebraic institutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3687694 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Specifications, models, and implementations of data abstractions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structured algebraic specifications: A kernel language / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf02737104 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4249644839 / rank
 
Normal rank

Latest revision as of 08:58, 30 July 2024

scientific article
Language Label Description Also known as
English
Toward formal development of programs from algebraic specifications: Implementations revisited
scientific article

    Statements

    Toward formal development of programs from algebraic specifications: Implementations revisited (English)
    0 references
    0 references
    0 references
    1988
    0 references
    The program development process is viewed as a sequence of implementation steps leading from a specification to a program. Based on an elementary notion of refinement, two notions of implementation are studied: constructor implementations which involve a construction ''on top of'' the implementing specification, and abstractor implementations which additionally provide for abstraction from some details of the implemented specification. These subsume most formal notions of implementation in the literature. Both kinds of implementations satisfy a vertical composition and a (modified) horizontal composition property. All the definitions and results are shown to generalize to the framework of an arbitrary institution, and a way of changing institutions during the implementation process is introduced. All this is illustrated by means of simple concrete examples.
    0 references
    program development process
    0 references
    refinement
    0 references
    constructor implementations
    0 references
    abstractor implementations
    0 references
    institution
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers