Location
Toggle navigation
HOME
INSTITUTE
Mission
Address
Executive Board
Scientific Members of MPG
Scientific Advisory Board
Board of Trustees
NEWS
Overview
Press Releases
Awards
Spotlights
Campus Event Calendar
25th Anniversary
Employment
DEPARTMENTS
Algorithms & Complexity
Computer Vision and Machine Learning
Internet Architecture
Computer Grapics
Databases and Information Systems
Visual Computing and Artificial Intelligence
Research Group Computational Biology
Automation of Logic
Network and Cloud Systems
PUBLICATIONS
Algorithms & Complexity
Computer Vision and Machine Learning
Internet Architecture
Computer Graphics
Databases and Information Systems
Visual Computing and Artificial Intelligence
Research Group Computational Biology
Automation of Logic
Network and Cloud Systems
Research Reports
Scientific Advisory Board
Curatorship Board
25th anniversary
IMPRS-CS
PEOPLE
SOFTWARE
SERVICES
Joint Central Services
Joint Administration
- Library
- International Office
Joint Scientific IT and Technical Services
- Building and Technical Support
Research Coordination
Representative for Equal Opportunities
- Equal Opportunities
Representative for Severely Disabled Persons
Representative for Safety
Ombudsperson for
Good Scientific Practice
and Doctoral Research
Company Physician
CS@MPG
CS@SAAR
Saarland Informatics Campus
Computer Science Department,
Saarland University
Max Planck Institute for
Software Systems (MPI-SWS)
German Center for
Artificial Intelligence (DFKI)
Center for Security, Privacy
and Accountability (CISPA)
VIA - Saarbrücken Center for
Visual Computing, Interaction
and Artificial Intelligence
Graduate School for
Computer Science
Cluster of Excellence (MMCI)
Max Planck Center for Visual
Computing and Communication
Kaiserslautern-Saarbrücken
Computer Science Cluster
IT Incubator
Publications
Home
Intranet
Server
halma.mpi-inf.mpg.de
Proceedings Article, Paper
@InProceedings
Beitrag in Tagungsband, Workshop
Author, Editor
Author(s):
Baumeister, Hubert
dblp
Editor(s):
Mosses, Peter D.
Nielsen, Mogens
Schwartzbach, Michael I.
dblp
dblp
dblp
BibTeX cite key*:
Baumeister95
Title, Booktitle
Title*:
Relations as Abstract Datatypes: An Institution to Specify Relations between Algebras
Booktitle*:
Proceedings of the 6th Joint Conference on Theory and Practice of Software Development (TAPSOFT '95)
Event, URLs
Conference URL::
Downloading URL:
Event Address*:
Århus, Denmark
Language:
English
Event Date*
(no longer used):
May 1995
Organization:
Event Start Date:
Incorrect data type for operator or @Function: Time/Date expected Incorrect data type for operator or @Function: Time/Date expected Incorrect data type for operator or @Function: Time/Date expected
Event End Date:
Incorrect data type for operator or @Function: Time/Date expected Incorrect data type for operator or @Function: Time/Date expected Incorrect data type for operator or @Function: Time/Date expected
Publisher
Name*:
Springer
URL:
Address*:
Berlin, Germany
Type:
Vol, No, Year, pp.
Series:
Lecture Notes in Computer Science
Volume:
915
Number:
Month:
May
Pages:
756-771
Year*:
1995
VG Wort Pages:
ISBN/ISSN:
Sequence Number:
DOI:
Note, Abstract, ©
(LaTeX) Abstract:
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.
HyperLinks / References / URLs:
http://www.mpi-sb.mpg.de/~hubert/publications/TAPSOFT-95.ps
Download
Access Level:
Correlation
MPG Unit:
Max-Planck-Institut für Informatik
MPG Subunit:
Programming Logics Group
Audience:
Expert
Appearance:
MPII WWW Server, MPII FTP Server, MPG publications list, university publications list, working group publication list, Fachbeirat
BibTeX Entry:
@INPROCEEDINGS
{
Baumeister95
,
AUTHOR = {Baumeister, Hubert},
EDITOR = {Mosses, Peter D. and Nielsen, Mogens and Schwartzbach, Michael I.},
TITLE = {Relations as Abstract Datatypes: An Institution to Specify Relations between Algebras},
BOOKTITLE = {Proceedings of the 6th Joint Conference on Theory and Practice of Software Development (TAPSOFT '95)},
PUBLISHER = {Springer},
YEAR = {1995},
VOLUME = {915},
PAGES = {756--771},
SERIES = {Lecture Notes in Computer Science},
ADDRESS = {Århus, Denmark},
MONTH = {May},
}
Entry last modified by Stephanie Müller, 03/12/2010
Edit History (please click the blue arrow to see the details)
Edit History (please click the blue arrow to see the details)
Editor(s)
Hubert Baumeister
Created
02/23/1996 07:37:28 PM
Revisions
6.
5.
4.
3.
2.
Editor(s)
Stephanie Müller
Christine Kiesel
Hubert Baumeister
Hubert Baumeister
Hubert Baumeister
Edit Dates
26.08.2008 14:32:59
31.08.2001 15:24:32
26/03/98 14:04:54
26/03/98 13:38:13
22/03/96 00:49:54