First-Order Specifications of Programmable Data Types

Authors:
Grazyna Mirkowska;Andrzej Salwicki;Marian Srebrny;Andrzej Tarlecki
Affiliations:
-;-;-;-
Venue:
SIAM Journal on Computing
Year:
2001

Citing 0
Cited 3

Algorithmic Logic + SpecVer = the Methodology for High Integrity Programming − Invited Paper

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Algorithmic Logic + SpecVer = the Methodology for High Integrity Programming − Invited Paper

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Some Methodological Remarks Inspired by the Paper “On inner classes” by A. Igarashi and B. Pierce

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider first-order specifications together with the restriction to accept only programmable algebras as models. We provide a criterion which links this approach with the "generation principle": all programmable models of any specification SP that meets this criterion are reachable. We also show an example of a specification which does not satisfy the criterion and admits a programmable yet nonreachable model. Moreover, a general method of showing the existence of programmable but nonreachable models for a class of first-order specifications is given.