國立高雄大學圖資館 |

Language: English

Back

Unifying theories of programming6th ...

(1998 :)

Unifying theories of programming6th International Symposium, UTP 2016, Reykjavik, Iceland, June 4-5, 2016 : revised selected papers /

Record Type:	Electronic resources : Monograph/item
Title/Author:	Unifying theories of programmingedited by Jonathan P. Bowen, Huibiao Zhu.
Reminder of title:	6th International Symposium, UTP 2016, Reykjavik, Iceland, June 4-5, 2016 : revised selected papers /
remainder title:	UTP 2016
other author:	Bowen, Jonathan P.
corporate name:
Published:	Cham :Springer International Publishing :2017.
Description:	ix, 217 p. :ill., digital ;24 cm.
Contained By:	Springer eBooks
Subject:	Computer programmingCongresses.
Online resource:	http://dx.doi.org/10.1007/978-3-319-52228-9
ISBN:	9783319522289$q(electronic bk.)

Unifying theories of programming6th International Symposium, UTP 2016, Reykjavik, Iceland, June 4-5, 2016 : revised selected papers /
Unifying theories of programming6th International Symposium, UTP 2016, Reykjavik, Iceland, June 4-5, 2016 : revised selected papers /[electronic resource] :UTP 2016edited by Jonathan P. Bowen, Huibiao Zhu. - Cham :Springer International Publishing :2017. - ix, 217 p. :ill., digital ;24 cm. - Lecture notes in computer science,101340302-9743 ;. - Lecture notes in computer science ;4891..

Abstraction refinement -- Choice -- Termination -- Feasibility -- Locality -- Concurrency -- Communication.

This book constitutes the refereed proceedings of the 6th International Symposium on Unifying Theories of Programming, UTP 2016, held in Reykjavik, Iceland, in June 2016, in conjunction with the 12th International Conference on Integrated Formal Methods, iFM 2016. The 8 revised full papers presented were carefully reviewed and selected from 10 submissions. They deal with the fundamental problem of combination of formal notations and theories of programming that define in various different ways many common notions, such as abstraction refinement, choice, termination, feasibility, locality, concurrency, and communication. They also show that despite many differences, such theories may be unified in a way that greatly facilitates their study and comparison.

ISBN: 9783319522289$q(electronic bk.)

Standard No.: 10.1007/978-3-319-52228-9doiSubjects--Topical Terms:

384564
Computer programming
--Congresses.

LC Class. No.: QA76.6 / .U86 2016

Dewey Class. No.: 005.1

Unifying theories of programming6th International Symposium, UTP 2016, Reykjavik, Iceland, June 4-5, 2016 : revised selected papers /
LDR:02064nmm a2200361 a 4500 001 506690
003 DE-He213
005 20170803171458.0
006 m d
007 cr nn 008maaau
008 171030s2017 gw s 0 eng d
020 $a 9783319522289$q(electronic bk.)
020 $a 9783319522272$q(paper)
024 7 $a 10.1007/978-3-319-52228-9 $2 doi
035 $a 978-3-319-52228-9
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.6 $b .U86 2016
072 7 $a UM $2 bicssc
072 7 $a UYF $2 bicssc
072 7 $a COM051000 $2 bisacsh
072 7 $a COM036000 $2 bisacsh
082 0 4 $a 005.1 $2 23
090 $a QA76.6 $b .U91 2016
111 2 $n (3rd : $d 1998 : $c Amsterdam, Netherlands) $3 194767
245 1 0 $a Unifying theories of programming $h [electronic resource] : $b 6th International Symposium, UTP 2016, Reykjavik, Iceland, June 4-5, 2016 : revised selected papers / $c edited by Jonathan P. Bowen, Huibiao Zhu.
246 3 $a UTP 2016
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2017.
300 $a ix, 217 p. : $b ill., digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 10134
505 0 $a Abstraction refinement -- Choice -- Termination -- Feasibility -- Locality -- Concurrency -- Communication.
520 $a This book constitutes the refereed proceedings of the 6th International Symposium on Unifying Theories of Programming, UTP 2016, held in Reykjavik, Iceland, in June 2016, in conjunction with the 12th International Conference on Integrated Formal Methods, iFM 2016. The 8 revised full papers presented were carefully reviewed and selected from 10 submissions. They deal with the fundamental problem of combination of formal notations and theories of programming that define in various different ways many common notions, such as abstraction refinement, choice, termination, feasibility, locality, concurrency, and communication. They also show that despite many differences, such theories may be unified in a way that greatly facilitates their study and comparison.
650 0 $a Computer programming $v Congresses. $3 384564
650 1 4 $a Computer Science. $3 212513
650 2 4 $a Logics and Meanings of Programs. $3 275357
650 2 4 $a Programming Languages, Compilers, Interpreters. $3 274102
650 2 4 $a Software Engineering. $3 274511
650 2 4 $a Mathematical Logic and Formal Languages. $3 275383
650 2 4 $a Computation by Abstract Devices. $3 273703
700 1 $a Bowen, Jonathan P. $3 468363
700 1 $a Zhu, Huibiao. $3 495484
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer eBooks
830 0 $a Lecture notes in computer science ; $v 4891. $3 383229
856 4 0 $u http://dx.doi.org/10.1007/978-3-319-52228-9
950 $a Computer Science (Springer-11645)