Constructing specification morphisms

DOI10.1016/S0747-7171(06)80006-4zbMath0804.68094OpenAlexW2046489718MaRDI QIDQ1322845

Douglas R. Smith

Publication date: 9 May 1994

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0747-7171(06)80006-4

zbMATH Keywords

algebraic specificationsrefinementsoftware engineeringsoftware developmentconnections between specificationssource specificationspecification morphismsunskolemization

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65)

Related Items (2)

Theory Presentation Combinators ⋮ An abstract formalization of correct schemas for program synthesis

Uses Software

• OBJ3
• Nuprl
• DTRE

Cites Work

• Properties preserved under homomorphism
• Algorithm theories and design tactics
• Un-Skolemizing clause sets
• A complete, nonredundant algorithm for reversed Skolemization
• Top-down synthesis of divide-and-conquer algorithms
• Toward formal development of programs from algebraic specifications: Implementations revisited
• Order-sorted algebra. I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations
• The algebraic specification of abstract data types
• Extracting information from resolution proof trees
• On the algebraic definition of programming languages
• Special relations in automated deduction
• Initial Algebra Semantics and Continuous Algebras
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Constructing specification morphisms