|
|
|
|
| LEADER |
03025nam a22006015i 4500 |
| 001 |
978-3-319-52228-9 |
| 003 |
DE-He213 |
| 005 |
20170110061742.0 |
| 007 |
cr nn 008mamaa |
| 008 |
170110s2017 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783319522289
|9 978-3-319-52228-9
|
| 024 |
7 |
|
|a 10.1007/978-3-319-52228-9
|2 doi
|
| 040 |
|
|
|d GrThAP
|
| 050 |
|
4 |
|a QA76.9.L63
|
| 050 |
|
4 |
|a QA76.5913
|
| 050 |
|
4 |
|a QA76.63
|
| 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.1015113
|2 23
|
| 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.
|
| 264 |
|
1 |
|a Cham :
|b Springer International Publishing :
|b Imprint: Springer,
|c 2017.
|
| 300 |
|
|
|a IX, 217 p. 36 illus.
|b online resource.
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 347 |
|
|
|a text file
|b PDF
|2 rda
|
| 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 science.
|
| 650 |
|
0 |
|a Software engineering.
|
| 650 |
|
0 |
|a Programming languages (Electronic computers).
|
| 650 |
|
0 |
|a Computers.
|
| 650 |
|
0 |
|a Computer logic.
|
| 650 |
|
0 |
|a Mathematical logic.
|
| 650 |
1 |
4 |
|a Computer Science.
|
| 650 |
2 |
4 |
|a Logics and Meanings of Programs.
|
| 650 |
2 |
4 |
|a Programming Languages, Compilers, Interpreters.
|
| 650 |
2 |
4 |
|a Software Engineering.
|
| 650 |
2 |
4 |
|a Mathematical Logic and Formal Languages.
|
| 650 |
2 |
4 |
|a Computation by Abstract Devices.
|
| 700 |
1 |
|
|a Bowen, Jonathan P.
|e editor.
|
| 700 |
1 |
|
|a Zhu, Huibiao.
|e editor.
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer eBooks
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783319522272
|
| 830 |
|
0 |
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 10134
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1007/978-3-319-52228-9
|z Full Text via HEAL-Link
|
| 912 |
|
|
|a ZDB-2-SCS
|
| 912 |
|
|
|a ZDB-2-LNC
|
| 950 |
|
|
|a Computer Science (Springer-11645)
|
