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: 12.

Aderhold, Markus Giesl, J. and Hähnle, R. (eds.) (2010):
Automated Synthesis of Induction Axioms for Programs with Second-Order Recursion.
In: LNAI 6173, In: 5th International Joint Conference on Automated Reasoning (IJCAR-5), Springer, pp. 263--277, [Conference or Workshop Item]

Duffy, David A. and Giesl, J. (2000):
Closure induction in a Z-like language.
In: ZB2000: International Conference of Z and B Users <2000, York>: Proceedings. - Berlin (u.a.): Springer, 2000 = Lecture notes in computer science; 1878. S. 471-490, Berlin (u.a.), Springer, [Conference or Workshop Item]

Ohsaki, Hitoshi and Middeldorp, A. and Giesl, J. (2000):
Equational termination by semantic labelling.
In: CSL'00: Annual Conference of the European Association for Computer Science Logic <2000, Fischbachau/München>: Proceedings. - Berlin (u.a.): Springer, 2000 = Lecture notes in computer science; 1862. S. 457-471, Berlin (u.a.), Springer, [Conference or Workshop Item]

Arts, Thomas and Giesl, J. (2000):
Termination of term rewriting using dependency pairs.
In: Theoretical computer science, 236pp. 133-178, [Article]

Arts, Thomas and Giesl, J. (1999):
Applying rewriting techniques to the verification of Erlang processes.
In: CSL'99: Annual Conference of the European Association for Computer Science Logic <1999, Madrid>; Proceedings. S. 96-110. - Berlin (u.a.): Springer, 1999 (Lecture notes in computer science; 1683), Berlin (u.a.), Springer, [Conference or Workshop Item]

Brauburger, Jürgen and Giesl, J. (1999):
Approximating the domains of functional and imperative programs.
In: Science of computer programming, 35pp. 113-136, [Article]

Arts, Thomas and Giesl, J. (1998):
Modularity of termination using dependency pairs.
1379In: RTA'98: International Conference on Rewriting Techniques and Applications <9, 1998, Tsukuba, Japan>: Proceedings. - Berlin (u.a.): Springer, 1998. S. 226-240, Berlin (u.a.), Springer, [Conference or Workshop Item]

Brauburger, Jürgen and Giesl, J. (1998):
Termination analysis by inductive evaluation.
1421In: CADE'98: International Conference on Automated Deduction <15, 1998, Lindau>: Proceedings. Hrsg.: C. Kirchner (u.a.) - Berlin (u.a.): Springer, 1998. S. 254-269, Berlin (u.a.), Springer, [Conference or Workshop Item]

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]

Arts, Thomas and Giesl, J. (1997):
Proving innermost normalisation automatically.
1232In: International Conference on Rewriting Techniques and Applications <8, 1997, Sitges, Spain>: Proceedings. - Berlin (u.a.): Springer, 1997. S. 157-171, Berlin, Heidelberg (u.a.), Springer, [Conference or Workshop Item]

Brauburger, Jürgen and Giesl, J. (1996):
Termination analysis for partial functions.
1145In: International Static Analysis Symposium SAS'96 <3, 1996, Aachen, Germany>: Proceedings. - Berlin (u.a.): Springer, 1996. S. 113-127, Berlin (u.a.), Springer, [Conference or Workshop Item]

Arts, Thomas and Giesl, J. (1996):
Termination of constructor systems.
1103In: International Conference on Rewriting Techniques and Applications RTA'96 <7, 1996, New Brunswick, NJ>: Proceedings. - Berlin (u.a.): Springer, 1996. S. 63-77, Berlin (u.a.), Springer, [Conference or Workshop Item]

This list was generated on Sat Aug 8 02:18:01 2020 CEST.