( en | de | ru )

 

Disambiguation of "Giesl, Jürgen"

Author of the publication

copydeleteadd this publication to your clipboard
Improved Modular Termination Proofs Using Dependency Pairs.

, , and . IJCAR, volume 3097 of Lecture Notes in Computer Science, page 75-90. Springer, (2004)

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.

Jürgen Giesl

Jürgen Giesl

Jürgen Giesl

Bruno Giesl

Peter Giesl

 

Other publications of authors with the same name

Modularity of Termination Using Dependency pairs., and . RTA, volume 1379 of Lecture Notes in Computer Science, page 226-240. Springer, (1998)Third Special Issue on Techniques for Automated Termination Proofs., and . J. Autom. Reason., 37 (3): 153-154 (2006)Induction Proofs with Partial Functions.. J. Autom. Reason., 26 (1): 1-49 (2001)Termination of term rewriting using dependency pairs., and . Theor. Comput. Sci., 236 (1-2): 133-178 (2000)Termination Graphs for Java Bytecode., , , and . Verification, Induction, Termination Analysis, volume 6463 of Lecture Notes in Computer Science, page 17-37. Springer, (2010)Termination of Term Rewriting Using Dependency Pairs, and . Comput. Sci, page 133--178. (1998)Termination Analysis for Functional Programs using Term Orderings. SAS, volume 983 of Lecture Notes in Computer Science, page 154-171. Springer, (1995)Decidable Classes of Inductive Theorems., and . IJCAR, volume 2083 of Lecture Notes in Computer Science, page 469-484. Springer, (2001)Applying Rewriting Techniques to the Verification of Erlang Processes., and . CSL, volume 1683 of Lecture Notes in Computer Science, page 96-110. Springer, (1999)AProVE: Termination and Memory Safety of C Programs - (Competition Contribution)., , , , and . TACAS, volume 9035 of Lecture Notes in Computer Science, page 417-419. Springer, (2015)