Author of the publication

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Search Techniques for Rational Polynomial Orders.

C. Fuhs, R. Navarro-Marset, C. Otto, J. Giesl, S. Lucas, and P. Schneider-Kamp. AISC/MKM/Calculemus, volume 5144 of Lecture Notes in Computer Science, page 109-124. Springer, (2008)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

M. Otto

Normalverbraucher Otto

Univ. -Prof. Dr. Carsten Scherer University of Stuttgart

Univ. -Prof. Dr. Otto Eggenberger University of Stuttgart

Dr. Carsten Unger University of Stuttgart

Other publications of authors with the same name

Automated Termination Proofs for Java Programs with Cyclic Data.M. Brockschmidt, R. Musiol, C. Otto, and J. Giesl. CAV, volume 7358 of Lecture Notes in Computer Science, page 105-122. Springer, (2012)Search Techniques for Rational Polynomial Orders.C. Fuhs, R. Navarro-Marset, C. Otto, J. Giesl, S. Lucas, and P. Schneider-Kamp. AISC/MKM/Calculemus, volume 5144 of Lecture Notes in Computer Science, page 109-124. Springer, (2008)Termination Graphs for Java Bytecode.M. Brockschmidt, C. Otto, C. von Essen, and J. Giesl. Verification, Induction, Termination Analysis, volume 6463 of Lecture Notes in Computer Science, page 17-37. Springer, (2010)Das Waffenregister der Vereinten Nationen. Ziele und Probleme internationaler RüstungssteuerungC. Otto. Deutscher Universitätsverlag, Wiesbaden, (1997)Automated Termination Analysis of Java Bytecode by Term Rewriting.C. Otto, M. Brockschmidt, C. von Essen, and J. Giesl. RTA, volume 6 of LIPIcs, page 259-276. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2010)Proving Termination of Programs Automatically with AProVE.J. Giesl, M. Brockschmidt, F. Emmes, F. Frohn, C. Fuhs, C. Otto, M. Plücker, P. Schneider-Kamp, T. Ströder, S. Swiderski and 1 other author(s). IJCAR, volume 8562 of Lecture Notes in Computer Science, page 184-191. Springer, (2014)Automated Detection of Non-termination and NullPointerExceptions for Java Bytecode.M. Brockschmidt, T. Ströder, C. Otto, and J. Giesl. FoVeOOS, volume 7421 of Lecture Notes in Computer Science, page 123-141. Springer, (2011)Modular Termination Proofs of Recursive Java Bytecode Programs by Term Rewriting.M. Brockschmidt, C. Otto, and J. Giesl. RTA, volume 10 of LIPIcs, page 155-170. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2011)Analyzing Program Termination and Complexity Automatically with AProVE.J. Giesl, C. Aschermann, M. Brockschmidt, F. Emmes, F. Frohn, C. Fuhs, J. Hensel, C. Otto, M. Plücker, P. Schneider-Kamp and 3 other author(s). J. Autom. Reasoning, 58 (1): 3-31 (2017)