TU Darmstadt / ULB / TUbiblio

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

de Gouw, Stijn and de Boer, Frank S. and Ahrendt, Wolfgang and Bubel, Richard
van Emde Boas, Peter and Groen, Frans C. A. and Italiano, Giuseppe F. and Nawrocki, Jerzy R. and Sack, Harald (eds.) (2013):
Weak Arithmetic Completeness of Object-Oriented First-Order Assertion Networks.
Springer, In: 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, In: Lecture Notes in Computer Science, 7741, DOI: 10.1007/978-3-642-35843-2₁₉,
[Online-Edition: https://doi.org/10.1007/978-3-642-35843-2_19],
[Conference or Workshop Item]

Item Type: Conference or Workshop Item
Erschienen: 2013
Editors: van Emde Boas, Peter and Groen, Frans C. A. and Italiano, Giuseppe F. and Nawrocki, Jerzy R. and Sack, Harald
Creators: de Gouw, Stijn and de Boer, Frank S. and Ahrendt, Wolfgang and Bubel, Richard
Title: Weak Arithmetic Completeness of Object-Oriented First-Order Assertion Networks
Language: German
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:

Optionen (nur für Redakteure)

View Item View Item