TU Darmstadt / ULB / TUbiblio

Automatically proving termination where simplification orderings fail

Arts, Thomas and Giesl, J. (1997):
Automatically proving termination where simplification orderings fail.
1214In: International Joint Conference on Theory and Practice of Software Development <7, 1997, Lille, France>: Proceedings. - Berlin (u.a.): Springer, 1997. S. 261-272, Berlin, Heidelberg (u.a.), Springer, [Conference or Workshop Item]

Item Type: Conference or Workshop Item
Erschienen: 1997
Creators: Arts, Thomas and Giesl, J.
Title: Automatically proving termination where simplification orderings fail
Language: German
Series Name: International Joint Conference on Theory and Practice of Software Development <7, 1997, Lille, France>: Proceedings. - Berlin (u.a.): Springer, 1997. S. 261-272
Volume: 1214
Place of Publication: Berlin, Heidelberg (u.a.)
Publisher: Springer
Divisions: 20 Department of Computer Science
Date Deposited: 19 Nov 2008 16:23
License: [undefiniert]
Export:
Suche nach Titel in: TUfind oder in Google
Send an inquiry Send an inquiry

Options (only for editors)

View Item View Item