Unifying Theories of Programming
Springer International Publishing (Verlag)
978-3-319-52227-2 (ISBN)
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.
Abstraction refinement.- Choice.- Termination.- Feasibility.- Locality.-Concurrency.- Communication.
| Erscheinungsdatum | 25.01.2017 |
|---|---|
| Reihe/Serie | Lecture Notes in Computer Science | Theoretical Computer Science and General Issues |
| Zusatzinfo | IX, 217 p. 36 illus. |
| Verlagsort | Cham |
| Sprache | englisch |
| Maße | 155 x 235 mm |
| Themenwelt | Mathematik / Informatik ► Informatik ► Software Entwicklung |
| Informatik ► Theorie / Studium ► Compilerbau | |
| Schlagworte | Applications • Computer architecture and logic design • Computer programming / software engineering • Computer Science • conference proceedings • Denotational Semantics • Formal Languages • HCSP • Hybrid Systems • Informatics • Informatik • Interpreters • laws of programming • Logics and meanings of programs • Mathematical Logic • meanings of programs • Programming language • reactive processes • Refinement • Research • semantic languages • semantic models • SIMULINK • Software engineering • therory engineering • trace algebra • unifying theories • UTP • verification |
| ISBN-10 | 3-319-52227-2 / 3319522272 |
| ISBN-13 | 978-3-319-52227-2 / 9783319522272 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
