Category localization semantics for specification refinements

Authors:
Jerzy Tomasik;Jerzy Weyman
Affiliations:
LLAIC1, Université Clermont 1, Aubière cedex, France 63172;Department of Mathematics, Northeastern University, Boston, USA 02115
Venue:
Annals of Mathematics and Artificial Intelligence
Year:
2007

Citing 5
Cited 1

A study in the foundations of programming methodology: specifications, institutions, charters and parchments

Proceedings of a tutorial and workshop on Category theory and computer programming
Some fundamental algebraic tools for the semantics of computation, part 3: indexed categories

Theoretical Computer Science
The Semantics of CLEAR, A Specification Language

Proceedings of the Abstract Software Specifications, 1979 Copenhagen Winter School
Specware: Formal Support for Composing Software

MPC '95 Mathematics of Program Construction
Combining and Representing Logical Systems

CTCS '97 Proceedings of the 7th International Conference on Category Theory and Computer Science

Theories of initial segments of standard models of arithmetics and their complete extensions

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe the theory of refinements of specifications based on localizations of categories. The approach allows us to enlarge the family of refinements (i.e. specification morphisms) of the category Spec --- the category of first order theories (specifications) of multi-sorted algebras. We prove that the class of specification morphisms in the category Spec can be enriched by the class of all interpretations of theories from Spec in all definitional extensions of theories of multi-sorted algebras. It provides a guide for finding a path leading from a given specification to a specification which is a provably correct code in a programming language (like C++, Lisp, Java).