TU Darmstadt / ULB / TUbiblio

Weak Arithmetic Completeness of Object-Oriented First-Order Assertion Networks

Gouw, Stijn de ; de Boer, Frank S. ; Ahrendt, Wolfgang ; Bubel, Richard
Emde Boas, Peter van ; Groen, Frans C. A. ; Italiano, Giuseppe F. ; Nawrocki, Jerzy R. ; Sack, Harald (eds.) (2013):
Weak Arithmetic Completeness of Object-Oriented First-Order Assertion Networks.
In: Lecture Notes in Computer Science, 7741, pp. 207-219, Springer, SOFSEM 2013: Theory and Practice of Computer Science, 39th International Conference on Current Trends in Theory and Practice of Computer Science, \vpindler\rv Ml\'n, Czech Republic, January 26-31, 2013. Proceedings, DOI: 10.1007/978-3-642-35843-2₁₉,
[Conference or Workshop Item]

Item Type: Conference or Workshop Item
Erschienen: 2013
Editors: Emde Boas, Peter van ; Groen, Frans C. A. ; Italiano, Giuseppe F. ; Nawrocki, Jerzy R. ; Sack, Harald
Creators: Gouw, Stijn de ; de Boer, Frank S. ; Ahrendt, Wolfgang ; Bubel, Richard
Title: Weak Arithmetic Completeness of Object-Oriented First-Order Assertion Networks
Language: English
Series Name: Lecture Notes in Computer Science
Volume: 7741
Publisher: Springer
Divisions: 20 Department of Computer Science
20 Department of Computer Science > Software Engineering
Event Title: SOFSEM 2013: Theory and Practice of Computer Science, 39th International Conference on Current Trends in Theory and Practice of Computer Science, \vpindler\rv Ml\'n, Czech Republic, January 26-31, 2013. Proceedings
Date Deposited: 27 Apr 2018 10:52
DOI: 10.1007/978-3-642-35843-2₁₉
Official URL: https://doi.org/10.1007/978-3-642-35843-2_19
Export:
Suche nach Titel in: TUfind oder in Google
Send an inquiry Send an inquiry

Options (only for editors)
Show editorial Details Show editorial Details