TU Darmstadt / ULB / TUbiblio

Browse by Person

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: No Grouping | Item Type | Date | Language
Number of items: 15.

Giesl, Jürgen and Hähnle, Reiner (2011):
Preface: Special Issue of Selected Extended Papers of IJCAR 2010.
In: J. Autom. Reasoning, 47 (4), pp. 337-339. DOI: 10.1007/s10817-011-9240-3,
[Article]

Giesl, Jürgen and Hähnle, Reiner (eds.) (2010):
Automated Reasoning, 5th International Joint Conference, IJCAR 2010, Edinburgh, UK, July 16-19, 2010. Proceedings.
In: Lecture Notes in Computer Science, 6173, Springer, ISBN 978-3-642-14202-4,
DOI: 10.1007/978-3-642-14203-1,
[Book]

Ball, Thomas and Giesl, Jürgen and Hähnle, Reiner and Nipkow, Tobias Ball, Thomas and Giesl, Jürgen and Hähnle, Reiner and Nipkow, Tobias (eds.) (2009):
09411 Abstracts Collection - Interaction versus Automation: The two Faces of Deduction.
In: Dagstuhl Seminar Proceedings, 09411, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, Interaction versus Automation: The two Faces of Deduction, 04.10. - 09.10.2009, [Conference or Workshop Item]

Ball, Thomas and Giesl, Jürgen and Hähnle, Reiner and Nipkow, Tobias (eds.) (2009):
Interaction versus Automation: The two Faces of Deduction, 04.10. - 09.10.2009.
In: Dagstuhl Seminar Proceedings, 09411, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, [Book]

Giesl, Jürgen and Middeldorp, A. (2000):
Eliminating dummy elimination.
In: CADE-17: International Conference on Automated Deduction <17, 2000, Pittsburgh, PA>: Proceedings. - Berlin (u.a.): Springer, 2000 = Lecture notes in artifical intelligence; 1831. S. 309-323, Berlin (u.a.), Springer, [Conference or Workshop Item]

Giesl, Jürgen (1999):
Context-moving transformations for function verification.
In: LOPSTR'99: International workshop on Logic-based Program Synthesis and Transformation <9, 1999, Venice>: Proceedings. - Berlin (u.a.): Springer, 2000 = Lecture notes in computer science; 1817. S. 293-312, Berlin (u.a.), Springer, [Conference or Workshop Item]

Giesl, Jürgen (1999):
Mechanized verification of imperative and functional programs.
Darmstadt, Technische Univ. Darmstadt, [Habilitation]

Giesl, Jürgen and Middeldorp, A. (1999):
Transforming context-sensitive rewrite systems.
In: RTA'99: Rewriting techniques and applications: 10th International Conference ; 1999 Trento, Italy ; Proceedings. Hrsg.: P. Narendran. - Berlin (u.a.): Springer, 1999. S. 271-285 (Lecture notes in computer science; 1631), Berlin (u.a.), Springer, [Conference or Workshop Item]

Giesl, Jürgen and Walther, Christoph and Brauburger, J. Bibel, Wolfgang (ed.) (1998):
Termination Analysis for Functional Programs.
10, In: Automated deduction: a basis for applications. Bd. 3, pp. 135-164, Dordrecht, Kluwer Acad. Publ, DOI: 10.1007/978-94-017-0437-3,
[Book Section]

Giesl, Jürgen (1997):
Termination of nested and mutually recursive algorithms.
In: Journal of automated reasoning. 19 (1997), S. 1-29, [Article]

Giesl, Jürgen (1996):
Proving partial correctness of partial functions.
In: Workshop on Mechanization of Partial Functions held in conjunction with: International Conference on Automated Deduction <13, 1996, New Brunswick., NJ>: Proceedings. S. 33-38, [Conference or Workshop Item]

Giesl, Jürgen (1995):
Automated termination proofs with measure functions.
In: German Annual Conference on Artificial Intelligence <19, 1995, Bielefeld>: Proceedings. - Berlin, Heidelberg (u.a.):Springer, 1995. S. 149-160, 981, Heidelberg (u.a.), Springer, [Conference or Workshop Item]

Giesl, Jürgen (1995):
Automatisierung von Terminierungsbeweisen für rekursiv definierte Algorithmen.
96, St. Augustin: Infix, 1995. 306 S., St. Augustin, Infix, TU Darmstadt,
[Ph.D. Thesis]

Giesl, Jürgen (1995):
Generating polynomial orderings for termination proofs.
In: International Conference on Rewriting Techniques and Applications <6, 1995, Kaiserlautern>: Proceedings. - Berlin, Heidelberg (u.a.): Springer, 1995. S. 426-431, 914, Heidelberg (u.a.), Springer, [Conference or Workshop Item]

Giesl, Jürgen (1995):
Termination analysis for functional programs using term orderings.
In: International static analysis symposium <2, 1995, Glasgow>: Proceedings. - Berlin, Heidelberg (u.a.):Springer, 1995. S. 154-171, 983, Heidelberg (u.a.), Springer, [Conference or Workshop Item]

This list was generated on Tue Apr 20 00:21:11 2021 CEST.