Deutsch
 
Hilfe Datenschutzhinweis Impressum
  DetailsucheBrowse

Datensatz

 
 
DownloadE-Mail
  Relations as Abstract Datatypes: An Institution to Specify Relations between Algebras

Baumeister, H. (1995). Relations as Abstract Datatypes: An Institution to Specify Relations between Algebras. In P. D. Mosses, M. Nielsen, & M. I. Schwartzbach (Eds.), TAPSOFT '95: Theory and Practice of Software Development (pp. 756-771). Berlin, Germany: Springer.

Item is

Externe Referenzen

einblenden:
ausblenden:
externe Referenz:
https://rdcu.be/dxCO4 (Verlagsversion)
Beschreibung:
-
OA-Status:
Keine Angabe

Urheber

einblenden:
ausblenden:
 Urheber:
Baumeister, Hubert1, Autor           
Affiliations:
1Programming Logics, MPI for Informatics, Max Planck Society, ou_40045              

Inhalt

einblenden:
ausblenden:
Schlagwörter: -
 Zusammenfassung: One way to model the execution state of an imperative program is as
a many sorted algebra. Program variables are modeled by functions
and their types by sorts. The execution of a program is modeled by a
relation between the states of the program (algebras) before and after
the execution of the program. There are several methods to specify such
relations between algebras. One method is to use specifications in the
style of Z, VDM-SL or Larch. Specifications in Z of relations between
states are first order formulas over the value of the variables comprising
the state before and after an operation. In this paper we shall define an
institution for the specification of relations between structures of some
base institution (eg.\ the institution of equational logic or first order
predicate logic).
Sets of structures over a common signature, abstract datatypes, in this
institution
denote relations between structures of the base institution. This makes it
possible to apply a rich repertoire of already existent techniques for
specifying
abstract datatypes, which can be found for example in the work of Goguen
and Burstall, Sannella, Wirsing and Tarlecki, Ehrig, Pepper and Orejas and
others, to the specification of relations. This paper tries to narrow the gap
between
algebraic specification languages like Clear, ASL or Act-One and
model theoretic based specification languages like Z, VDM-SL or the
Larch Interface language.

Details

einblenden:
ausblenden:
Sprache(n): eng - English
 Datum: 2010-03-121995
 Publikationsstatus: Erschienen
 Seiten: -
 Ort, Verlag, Ausgabe: -
 Inhaltsverzeichnis: -
 Art der Begutachtung: -
 Identifikatoren: eDoc: 519507
Anderer: Local-ID: C1256104005ECAFC-4357FF8D279CD440C12562D900664EC6-Baumeister95
DOI: 10.1007/3-540-59293-8_233
BibTex Citekey: Baumeister_TaPSOFT95
 Art des Abschluß: -

Veranstaltung

einblenden:
ausblenden:
Titel: 6th Joint Conference on Theory and Practice of Software Development
Veranstaltungsort: Århus, Denmark
Start-/Enddatum: 1995-05-22 - 1995-05-26

Entscheidung

einblenden:

Projektinformation

einblenden:

Quelle 1

einblenden:
ausblenden:
Titel: TAPSOFT '95: Theory and Practice of Software Development
  Untertitel : 6th International Joint Conference CAAP/FASE, Aarhus, Denmark, May 22 - 26, 1995. Proceedings
  Kurztitel : TAPSOFT 1995
Genre der Quelle: Konferenzband
 Urheber:
Mosses, Peter D.1, Herausgeber
Nielsen, Mogens1, Herausgeber
Schwartzbach, Michael I.1, Herausgeber
Affiliations:
1 External Organizations, ou_persistent22            
Ort, Verlag, Ausgabe: Berlin, Germany : Springer
Seiten: - Band / Heft: - Artikelnummer: - Start- / Endseite: 756 - 771 Identifikator: ISBN: 978-3-540-59293-8

Quelle 2

einblenden:
ausblenden:
Titel: Lecture Notes in Computer Science
  Kurztitel : LNCS
Genre der Quelle: Reihe
 Urheber:
Affiliations:
Ort, Verlag, Ausgabe: -
Seiten: - Band / Heft: 915 Artikelnummer: - Start- / Endseite: - Identifikator: -