Unifying theories of programming Lecture Notes in Computer Science 10134

Journal article

Bowen, JP and Zhu, H (2017). Unifying theories of programming Lecture Notes in Computer Science 10134. 10134, pp. V-VI.
AuthorsBowen, JP and Zhu, H
Abstract

Preface to the UTP 2016 Symposium proceedings Interest in the fundamental problem of the combination of formal notations and theories of programming has grown consistently in recent decades. The theories define, in various different ways, many common notions, such as abstraction, refinement, choice,
termination, feasibility, locality, concurrency, and communication. Despite these differences, such theories may be unified in a way that greatly facilitates their study and
comparison. Moreover, such a unification offers a means of combining different languages describing various facets and artefacts of software development in a seamless and logically consistent manner.

Keywords08 Information And Computing Sciences; Artificial Intelligence & Image Processing
Year2017
Journal citation10134, pp. V-VI
PublisherSpringer
Web address (URL)http://utp2016.ecnu.edu.cn
Publication dates
Print27 Jan 2017
Publication process dates
Deposited15 Aug 2017
Accepted05 Jun 2016
Accepted author manuscript
License
File Access Level
Open
Additional information

We cannot provide a copy of this article for copyright reasons.

SeriesLecture Notes in Computer Science
ISBN9783319522272
Permalink -

https://openresearch.lsbu.ac.uk/item/870v2

Restricted files

Accepted author manuscript

  • 91
    total views
  • 0
    total downloads
  • 6
    views this month
  • 0
    downloads this month

Export as