Peter Schneider-Kamp
TitleCited byYear
AProVE 1.2: Automatic termination proofs in the dependency pair framework
J Giesl, P Schneider-Kamp, R Thiemann
International Joint Conference on Automated Reasoning, 281-286, 2006
3172006
Mechanizing and improving dependency pairs
J Giesl, R Thiemann, P Schneider-Kamp, S Falke
Journal of Automated Reasoning 37 (3), 155-203, 2006
2312006
Automated Termination Proofs with AProVE
J Giesl, R Thiemann, P Schneider-Kamp, S Falke
International Conference on Rewriting Techniques and Applications, 210-220, 2004
1902004
The dependency pair framework: Combining techniques for automated termination proofs
J Giesl, R Thiemann, P Schneider-Kamp
International Conference on Logic for Programming Artificial Intelligence …, 2005
1742005
SAT solving for termination analysis with polynomial interpretations
C Fuhs, J Giesl, A Middeldorp, P Schneider-Kamp, R Thiemann, H Zankl
International Conference on Theory and Applications of Satisfiability …, 2007
1552007
Proving and disproving termination of higher-order functions
J Giesl, R Thiemann, P Schneider-Kamp
International Workshop on Frontiers of Combining Systems, 216-231, 2005
1402005
Automated termination analysis for Haskell: From term rewriting to programming languages
J Giesl, S Swiderski, P Schneider-Kamp, R Thiemann
International Conference on Rewriting Techniques and Applications, 297-312, 2006
922006
Proving termination of programs automatically with AProVE
J Giesl, M Brockschmidt, F Emmes, F Frohn, C Fuhs, C Otto, M Plücker, ...
International Joint Conference on Automated Reasoning, 184-191, 2014
882014
Automated termination proofs for Haskell by term rewriting
J Giesl, M Raffelsieper, P Schneider-Kamp, S Swiderski, R Thiemann
ACM Transactions on Programming Languages and Systems (TOPLAS) 33 (2), 7, 2011
802011
Analyzing program termination and complexity automatically with AProVE
J Giesl, C Aschermann, M Brockschmidt, F Emmes, F Frohn, C Fuhs, ...
Journal of Automated Reasoning 58 (1), 3-31, 2017
672017
Proving termination of integer term rewriting
C Fuhs, J Giesl, M Plücker, P Schneider-Kamp, S Falke
International Conference on Rewriting Techniques and Applications, 32-47, 2009
612009
Automated termination proofs for logic programs by term rewriting
P Schneider-Kamp, J Giesl, A Serebrenik, R Thiemann
ACM Transactions on Computational Logic (TOCL) 11 (1), 2, 2009
572009
Termination analysis of logic programs based on dependency graphs
MT Nguyen, J Giesl, P Schneider-Kamp, D De Schreye
International Symposium on Logic-based Program Synthesis and Transformation …, 2007
512007
Improving dependency pairs
J Giesl, R Thiemann, P Schneider-Kamp, S Falke
International Conference on Logic for Programming Artificial Intelligence …, 2003
502003
Polynomial interpretations as a basis for termination analysis of logic programs
MT Nguyen, D De Schreye
International Conference on Logic Programming, 311-325, 2005
46*2005
Automated termination analysis for logic programs by term rewriting
P Schneider-Kamp, J Giesl, A Serebrenik, R Thiemann
International Symposium on Logic-based Program Synthesis and Transformation …, 2006
452006
Improved modular termination proofs using dependency pairs
R Thiemann, J Giesl, P Schneider-Kamp
International Joint Conference on Automated Reasoning, 75-90, 2004
452004
Twenty-five comparators is optimal when sorting nine inputs (and twenty-nine for ten)
M Codish, L Cruz-Filipe, M Frank, P Schneider-Kamp
2014 IEEE 26th International Conference on Tools with Artificial …, 2014
432014
Maximal termination
C Fuhs, J Giesl, A Middeldorp, P Schneider-Kamp, R Thiemann, H Zankl
International Conference on Rewriting Techniques and Applications, 110-125, 2008
422008
Proving termination using recursive path orders and SAT solving
P Schneider-Kamp, R Thiemann, E Annov, M Codish, J Giesl
International Symposium on Frontiers of Combining Systems, 267-282, 2007
412007
The system can't perform the operation now. Try again later.
Articles 1–20