Result Number | Material Type | Add to My Shelf Action | Record Details and Options |
---|---|---|---|
1 |
Material Type: Ata de Congresso
|
Size-Change Termination for Term RewritingThiemann, René ; Giesl, Jürgen Nieuwenhuis, RobertLecture notes in computer science, 2003, p.264-278 [Periódico revisado por pares]Berlin, Heidelberg: Springer Berlin HeidelbergTexto completo disponível |
|
2 |
Material Type: Ata de Congresso
|
Context-Moving Transformations for Function VerificationGiesl, Jürgen Bossi, AnnalisaLecture notes in computer science, 2000, p.293-312 [Periódico revisado por pares]Berlin, Heidelberg: Springer Berlin HeidelbergTexto completo disponível |
|
3 |
Material Type: Ata de Congresso
|
Deciding Inductive Validity of EquationsGiesl, Jürgen ; Kapur, Deepak Baader, FranzAutomated Deduction – CADE-19, 2003, p.17-31 [Periódico revisado por pares]Berlin, Heidelberg: Springer Berlin HeidelbergTexto completo disponível |
|
4 |
Material Type: Ata de Congresso
|
Improving Dependency PairsGiesl, Jürgen ; Thiemann, René ; Schneider-Kamp, Peter ; Falke, Stephan Vardi, Moshe Y. ; Voronkov, AndreiLecture notes in computer science, 2003, p.167-182 [Periódico revisado por pares]Berlin, Heidelberg: Springer Berlin HeidelbergTexto completo disponível |
|
5 |
Material Type: Capítulo de Livro
|
Improved Modular Termination Proofs Using Dependency PairsThiemann, René ; Giesl, Jürgen ; Schneider-Kamp, Peter Basin, David ; Rusinowitch, MichaëlAutomated Reasoning, 2004, p.75-90 [Periódico revisado por pares]Berlin, Heidelberg: Springer Berlin HeidelbergTexto completo disponível |
|
6 |
Material Type: Ata de Congresso
|
Termination analysis by inductive evaluationBrauburger, Jürgen ; Giesl, Jürgen Kirchner, Claude ; Kirchner, HélèneAutomated Deduction — CADE-15, 2006, p.254-269 [Periódico revisado por pares]Berlin, Heidelberg: Springer Berlin HeidelbergTexto completo disponível |
|
7 |
Material Type: Artigo
|
Termination of term rewriting using dependency pairs: Trees in Algebra and ProgrammingARTS, T ; GIESL, JTheoretical computer science, 2000, Vol.236 (1-2), p.133-178 [Periódico revisado por pares]Amsterdam: ElsevierTexto completo disponível |
|
8 |
Material Type: Ata de Congresso
|
Eliminating Dummy EliminationGiesl, Jürgen ; Middeldorp, Aart McAllester, DavidAutomated Deduction - CADE-17, 2000, p.309-323 [Periódico revisado por pares]Berlin, Heidelberg: Springer Berlin HeidelbergTexto completo disponível |
|
9 |
Material Type: Ata de Congresso
|
Modularity of termination using dependency pairsArts, Thomas ; Giesl, Jürgen Nipkow, TobiasLecture notes in computer science, 1998, p.226-240 [Periódico revisado por pares]Berlin, Heidelberg: Springer Berlin HeidelbergTexto completo disponível |
|
10 |
Material Type: Ata de Congresso
|
Applying rewriting techniques to the verification of erlang processesARTS, T ; GIESL, JLecture notes in computer science, 1999, p.96-110 [Periódico revisado por pares]Berlin: SpringerTexto completo disponível |