Unifying Theories of Programming 6th International Symposium, UTP 2016, Reykjavik, Iceland, June 4-5, 2016, Revised Selected Papers /
Unifying Theories of Programming 6th International Symposium, UTP 2016, Reykjavik, Iceland, June 4-5, 2016, Revised Selected Papers / [electronic resource] :
edited by Jonathan P. Bowen, Huibiao Zhu.
- 1st ed. 2017.
- IX, 217 p. 36 illus. online resource.
- Theoretical Computer Science and General Issues, 10134 2512-2029 ; .
- Theoretical Computer Science and General Issues, 10134 .
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. .
9783319522289
10.1007/978-3-319-52228-9 doi
Computer science.
Compilers (Computer programs).
Software engineering.
Machine theory.
Computer Science Logic and Foundations of Programming.
Compilers and Interpreters.
Software Engineering.
Formal Languages and Automata Theory.
Theory of Computation.
QA75.5-76.95
004.0151
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. .
9783319522289
10.1007/978-3-319-52228-9 doi
Computer science.
Compilers (Computer programs).
Software engineering.
Machine theory.
Computer Science Logic and Foundations of Programming.
Compilers and Interpreters.
Software Engineering.
Formal Languages and Automata Theory.
Theory of Computation.
QA75.5-76.95
004.0151