Result Number | Material Type | Add to My Shelf Action | Record Details and Options |
---|---|---|---|
1 |
Material Type: Ata de Congresso
|
![]() |
Lower Runtime Bounds for Integer ProgramsFrohn, F. ; Naaf, M. ; Hensel, J. ; Brockschmidt, M. ; Giesl, J.Automated Reasoning, p.550-567 [Periódico revisado por pares]Cham: Springer International PublishingTexto completo disponível |
2 |
Material Type: Ata de Congresso
|
![]() |
Size-Change Termination for Term RewritingThiemann, René ; Giesl, JürgenLecture notes in computer science, 2003, p.264-278 [Periódico revisado por pares]Berlin, Heidelberg: Springer Berlin HeidelbergTexto completo disponível |
3 |
Material Type: Ata de Congresso
|
![]() |
Context-Moving Transformations for Function VerificationGiesl, JürgenLecture notes in computer science, 2000, p.293-312 [Periódico revisado por pares]Berlin, Heidelberg: Springer Berlin HeidelbergTexto completo disponível |
4 |
Material Type: Ata de Congresso
|
![]() |
Deciding Inductive Validity of EquationsGiesl, Jürgen ; Kapur, DeepakAutomated Deduction – CADE-19, 2003, p.17-31 [Periódico revisado por pares]Berlin, Heidelberg: Springer Berlin HeidelbergTexto completo disponível |
5 |
Material Type: Ata de Congresso
|
![]() |
Improving Dependency PairsGiesl, Jürgen ; Thiemann, René ; Schneider-Kamp, Peter ; Falke, StephanLecture notes in computer science, 2003, p.167-182 [Periódico revisado por pares]Berlin, Heidelberg: Springer Berlin HeidelbergTexto completo disponível |
6 |
Material Type: Capítulo de Livro
|
![]() |
Improved Modular Termination Proofs Using Dependency PairsThiemann, René ; Giesl, Jürgen ; Schneider-Kamp, PeterAutomated Reasoning, 2004, p.75-90 [Periódico revisado por pares]Berlin, Heidelberg: Springer Berlin HeidelbergTexto completo disponível |
7 |
Material Type: Ata de Congresso
|
![]() |
Termination analysis by inductive evaluationBrauburger, Jürgen ; Giesl, JürgenAutomated Deduction — CADE-15, 2006, p.254-269 [Periódico revisado por pares]Berlin, Heidelberg: Springer Berlin HeidelbergTexto completo disponível |
8 |
Material Type: Capítulo de Livro
|
![]() |
Innermost Termination of Context-Sensitive RewritingGiesl, Jürgen ; Middeldorp, AartDevelopments in Language Theory, p.231-244 [Periódico revisado por pares]Berlin, Heidelberg: Springer Berlin HeidelbergTexto completo disponível |
9 |
Material Type: Ata de Congresso
|
![]() |
Eliminating Dummy EliminationGiesl, Jürgen ; Middeldorp, AartAutomated Deduction - CADE-17, 2000, p.309-323 [Periódico revisado por pares]Berlin, Heidelberg: Springer Berlin HeidelbergTexto completo disponível |
10 |
Material Type: Ata de Congresso
|
![]() |
Modularity of termination using dependency pairsArts, Thomas ; Giesl, JürgenLecture notes in computer science, 1998, p.226-240 [Periódico revisado por pares]Berlin, Heidelberg: Springer Berlin HeidelbergTexto completo disponível |