Linking semantic models

  • He Jifeng*
  • *Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

A theory of programming is intended to help in the construction of programs that provably meet their specifications. It starts with a complete lattice of specifications, used as a domain for the semantics of the programming language. The operators of the language are defined as monotonie functions over this domain. This paper presents a method which enables us to derive an enriched semantics for the imperative languages. We show that the new definition of the primitive commands can be recast as the weakest solution of the embedding equation, and demonstrate how the operators of the programming language are redefined from the homomorphic property of the embedding and the healthiness conditions imposed on "real" programs.

Original languageEnglish
Title of host publicationTheoretical Aspects of Computing - ICTAC 2007- 4th International Colloquium, Proceedings
PublisherSpringer Verlag
Pages18-33
Number of pages16
ISBN (Print)9783540752905
DOIs
StatePublished - 2007
Event4th International Colloquium on Theoretical Aspects of Computing, ICTAC 2007 - Macao, China
Duration: 26 Sep 200728 Sep 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4711 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference4th International Colloquium on Theoretical Aspects of Computing, ICTAC 2007
Country/TerritoryChina
CityMacao
Period26/09/0728/09/07

Fingerprint

Dive into the research topics of 'Linking semantic models'. Together they form a unique fingerprint.

Cite this