×

zbMATH — the first resource for mathematics

Schneider-Kamp, Peter

Compute Distance To:
Author ID: schneider-kamp.peter Recent zbMATH articles by "Schneider-Kamp, Peter"
Published as: Schneider-Kamp, Peter
Documents Indexed: 49 Publications since 2003

Publications by Year

Citations contained in zbMATH Open

45 Publications have been cited 337 times in 157 Documents Cited by Year
Mechanizing and improving dependency pairs. Zbl 1113.68088
Giesl, Jürgen; Thiemann, René; Schneider-Kamp, Peter; Falke, Stephan
40
2006
The dependency pair framework: Combining techniques for automated termination proofs. Zbl 1108.68477
Giesl, Jürgen; Thiemann, René; Schneider-Kamp, Peter
37
2005
Proving and disproving termination of higher-order functions. Zbl 1171.68714
Giesl, Jürgen; Thiemann, René; Schneider-Kamp, Peter
27
2005
SAT solving for termination analysis with polynomial interpretations. Zbl 1214.68352
Fuhs, Carsten; Giesl, Jürgen; Middeldorp, Aart; Schneider-Kamp, Peter; Thiemann, René; Zankl, Harald
22
2007
Automated termination analysis for Haskell: from term rewriting to programming languages. Zbl 1151.68444
Giesl, Jürgen; Swiderski, Stephan; Schneider-Kamp, Peter; Thiemann, René
19
2006
Proving termination of programs automatically with AProVE. Zbl 1409.68256
Giesl, Jürgen; Brockschmidt, Marc; Emmes, Fabian; Frohn, Florian; Fuhs, Carsten; Otto, Carsten; Plücker, Martin; Schneider-Kamp, Peter; Ströder, Thomas; Swiderski, Stephanie; Thiemann, René
13
2014
Automated termination proofs for logic programs by term rewriting. Zbl 1351.68054
Schneider-Kamp, Peter; Giesl, Jürgen; Serebrenik, Alexander; Thiemann, René
11
2009
Improved modular termination proofs using dependency pairs. Zbl 1126.68582
Thiemann, René; Giesl, Jürgen; Schneider-Kamp, Peter
10
2004
Improving dependency pairs. Zbl 1273.68320
Giesl, Jürgen; Thiemann, René; Schneider-Kamp, Peter; Falke, Stephan
10
2003
Automated termination analysis for logic programs with cut. Zbl 1209.68098
Schneider-Kamp, Peter; Giesl, Jürgen; Ströder, Thomas; Serebrenik, Alexander; Thiemann, René
8
2010
Proving termination of integer term rewriting. Zbl 1242.68131
Fuhs, Carsten; Giesl, Jürgen; Plücker, Martin; Schneider-Kamp, Peter; Falke, Stephan
8
2009
Maximal termination. Zbl 1145.68446
Fuhs, Carsten; Giesl, Jürgen; Middeldorp, Aart; Schneider-Kamp, Peter; Thiemann, René; Zankl, Harald
8
2008
Automated termination analysis for logic programs by term rewriting. Zbl 1196.68036
Schneider-Kamp, Peter; Giesl, Jürgen; Serebrenik, Alexander; Thiemann, René
8
2007
Search techniques for rational polynomial orders. Zbl 1166.68354
Fuhs, Carsten; Navarro-Marset, Rafael; Otto, Carsten; Giesl, Jürgen; Lucas, Salvador; Schneider-Kamp, Peter
7
2008
Termination analysis of logic programs based on dependency graphs. Zbl 1179.68040
Nguyen, Manh Thang; Giesl, Jürgen; Schneider-Kamp, Peter; De Schreye, Danny
7
2008
Proving termination by bounded increase. Zbl 1213.68347
Giesl, Jürgen; Thiemann, René; Swiderski, Stephan; Schneider-Kamp, Peter
7
2007
Proving termination using recursive path orders and SAT solving. Zbl 1148.68393
Schneider-Kamp, Peter; Thiemann, René; Annov, Elena; Codish, Michael; Giesl, Jürgen
7
2007
Efficient certified RAT verification. Zbl 06778406
Cruz-Filipe, Luís; Heule, Marijn J. H.; Hunt Jr., Warren A.; Kaufmann, Matt; Schneider-Kamp, Peter
6
2017
Analyzing program termination and complexity automatically with AProVE. Zbl 1409.68255
Giesl, Jürgen; Aschermann, Cornelius; Brockschmidt, Marc; Emmes, Fabian; Frohn, Florian; Fuhs, Carsten; Hensel, Jera; Otto, Carsten; Plücker, Martin; Schneider-Kamp, Peter; Ströder, Thomas; Swiderski, Stephanie; Thiemann, René
6
2017
Sorting nine inputs requires twenty-five comparisons. Zbl 1333.68087
Codish, Michael; Cruz-Filipe, Luís; Frank, Michael; Schneider-Kamp, Peter
6
2016
Sorting networks: the end game. Zbl 1423.68443
Codish, Michael; Cruz-Filipe, Luís; Schneider-Kamp, Peter
6
2015
Polytool: polynomial interpretations as a basis for termination analysis of logic programs. Zbl 1222.68064
Nguyen, Manh Thang; De Schreye, Danny; Giesl, Jürgen; Schneider-Kamp, Peter
6
2011
Improving context-sensitive dependency pairs. Zbl 1182.68092
Alarcón, Beatriz; Emmes, Fabian; Fuhs, Carsten; Giesl, Jürgen; Gutiérrez, Raúl; Lucas, Salvador; Schneider-Kamp, Peter; Thiemann, René
6
2008
SAT solving for termination proofs with recursive path orders and dependency pairs. Zbl 1276.68140
Codish, Michael; Giesl, Jürgen; Schneider-Kamp, Peter; Thiemann, René
5
2012
Synthesizing shortest linear straight-line programs over \(\mathrm{GF}(2)\) using SAT. Zbl 1306.68156
Fuhs, Carsten; Schneider-Kamp, Peter
5
2010
Proving termination by dependency pairs and inductive theorem proving. Zbl 1243.68267
Fuhs, Carsten; Giesl, Jürgen; Parting, Michael; Schneider-Kamp, Peter; Swiderski, Stephan
4
2011
Applying sorting networks to synthesize optimized sorting libraries. Zbl 1362.68062
Codish, Michael; Cruz-Filipe, Luís; Nebel, Markus; Schneider-Kamp, Peter
3
2015
Formalizing size-optimal sorting networks: extracting a certified proof checker. Zbl 06481861
Cruz-Filipe, Luís; Schneider-Kamp, Peter
3
2015
Proving termination and memory safety for programs with pointer arithmetic. Zbl 1423.68110
Ströder, Thomas; Giesl, Jürgen; Brockschmidt, Marc; Frohn, Florian; Fuhs, Carsten; Hensel, Jera; Schneider-Kamp, Peter
3
2014
Optimal base encodings for pseudo-Boolean constraints. Zbl 1315.68227
Codish, Michael; Fekete, Yoav; Fuhs, Carsten; Schneider-Kamp, Peter
3
2011
The dependency triple framework for termination of logic programs. Zbl 1284.68119
Schneider-Kamp, Peter; Giesl, Jürgen; Nguyen, Manh Thang
3
2010
SAT solving for argument filterings. Zbl 1165.68484
Codish, Michael; Schneider-Kamp, Peter; Lagoon, Vitaly; Thiemann, René; Giesl, Jürgen
3
2006
Automatically proving termination and memory safety for programs with pointer arithmetic. Zbl 1409.68077
Ströder, Thomas; Giesl, Jürgen; Brockschmidt, Marc; Frohn, Florian; Fuhs, Carsten; Hensel, Jera; Schneider-Kamp, Peter; Aschermann, Cornelius
2
2017
Integrity constraints for general-purpose knowledge bases. Zbl 06582823
Cruz-Filipe, Luís; Nunes, Isabel; Schneider-Kamp, Peter
2
2016
Optimizing a certified proof checker for a large-scale computer-generated proof. Zbl 1417.68180
Cruz-Filipe, Luís; Schneider-Kamp, Peter
2
2015
A linear operational semantics for termination and complexity analysis of ISO prolog. Zbl 1377.68068
Ströder, Thomas; Emmes, Fabian; Schneider-Kamp, Peter; Giesl, Jürgen; Fuhs, Carsten
2
2012
Dependency triples for improving termination analysis of logic programs with cut. Zbl 1326.68063
Ströder, Thomas; Schneider-Kamp, Peter; Giesl, Jürgen
2
2011
Lazy abstraction for size-change termination. Zbl 1306.68022
Codish, Michael; Fuhs, Carsten; Giesl, Jürgen; Schneider-Kamp, Peter
2
2010
Deciding innermost loops. Zbl 1145.68457
Thiemann, René; Giesl, Jürgen; Schneider-Kamp, Peter
2
2008
Formally verifying the solution to the Boolean Pythagorean triples problem. Zbl 07100460
Cruz-Filipe, Luís; Marques-Silva, Joao; Schneider-Kamp, Peter
1
2019
Active integrity constraints for general-purpose knowledge bases. Zbl 06941237
Cruz-Filipe, Luís; Gaspar, Graça; Nunes, Isabel; Schneider-Kamp, Peter
1
2018
Formally proving the Boolean Pythagorean triples conjecture. Zbl 1403.68222
Cruz-Filipe, Luís; Schneider-Kamp, Peter
1
2017
Formally proving size optimality of sorting networks. Zbl 1425.68372
Cruz-Filipe, Luís; Larsen, Kim S.; Schneider-Kamp, Peter
1
2017
Optimal-depth sorting networks. Zbl 1353.68062
Bundala, Daniel; Codish, Michael; Cruz-Filipe, Luís; Schneider-Kamp, Peter; Závodný, Jakub
1
2017
Termination analysis by dependency pairs and inductive theorem proving. Zbl 1237.68181
Swiderski, Stephan; Parting, Michael; Giesl, Jürgen; Fuhs, Carsten; Schneider-Kamp, Peter
1
2009
Formally verifying the solution to the Boolean Pythagorean triples problem. Zbl 07100460
Cruz-Filipe, Luís; Marques-Silva, Joao; Schneider-Kamp, Peter
1
2019
Active integrity constraints for general-purpose knowledge bases. Zbl 06941237
Cruz-Filipe, Luís; Gaspar, Graça; Nunes, Isabel; Schneider-Kamp, Peter
1
2018
Efficient certified RAT verification. Zbl 06778406
Cruz-Filipe, Luís; Heule, Marijn J. H.; Hunt Jr., Warren A.; Kaufmann, Matt; Schneider-Kamp, Peter
6
2017
Analyzing program termination and complexity automatically with AProVE. Zbl 1409.68255
Giesl, Jürgen; Aschermann, Cornelius; Brockschmidt, Marc; Emmes, Fabian; Frohn, Florian; Fuhs, Carsten; Hensel, Jera; Otto, Carsten; Plücker, Martin; Schneider-Kamp, Peter; Ströder, Thomas; Swiderski, Stephanie; Thiemann, René
6
2017
Automatically proving termination and memory safety for programs with pointer arithmetic. Zbl 1409.68077
Ströder, Thomas; Giesl, Jürgen; Brockschmidt, Marc; Frohn, Florian; Fuhs, Carsten; Hensel, Jera; Schneider-Kamp, Peter; Aschermann, Cornelius
2
2017
Formally proving the Boolean Pythagorean triples conjecture. Zbl 1403.68222
Cruz-Filipe, Luís; Schneider-Kamp, Peter
1
2017
Formally proving size optimality of sorting networks. Zbl 1425.68372
Cruz-Filipe, Luís; Larsen, Kim S.; Schneider-Kamp, Peter
1
2017
Optimal-depth sorting networks. Zbl 1353.68062
Bundala, Daniel; Codish, Michael; Cruz-Filipe, Luís; Schneider-Kamp, Peter; Závodný, Jakub
1
2017
Sorting nine inputs requires twenty-five comparisons. Zbl 1333.68087
Codish, Michael; Cruz-Filipe, Luís; Frank, Michael; Schneider-Kamp, Peter
6
2016
Integrity constraints for general-purpose knowledge bases. Zbl 06582823
Cruz-Filipe, Luís; Nunes, Isabel; Schneider-Kamp, Peter
2
2016
Sorting networks: the end game. Zbl 1423.68443
Codish, Michael; Cruz-Filipe, Luís; Schneider-Kamp, Peter
6
2015
Applying sorting networks to synthesize optimized sorting libraries. Zbl 1362.68062
Codish, Michael; Cruz-Filipe, Luís; Nebel, Markus; Schneider-Kamp, Peter
3
2015
Formalizing size-optimal sorting networks: extracting a certified proof checker. Zbl 06481861
Cruz-Filipe, Luís; Schneider-Kamp, Peter
3
2015
Optimizing a certified proof checker for a large-scale computer-generated proof. Zbl 1417.68180
Cruz-Filipe, Luís; Schneider-Kamp, Peter
2
2015
Proving termination of programs automatically with AProVE. Zbl 1409.68256
Giesl, Jürgen; Brockschmidt, Marc; Emmes, Fabian; Frohn, Florian; Fuhs, Carsten; Otto, Carsten; Plücker, Martin; Schneider-Kamp, Peter; Ströder, Thomas; Swiderski, Stephanie; Thiemann, René
13
2014
Proving termination and memory safety for programs with pointer arithmetic. Zbl 1423.68110
Ströder, Thomas; Giesl, Jürgen; Brockschmidt, Marc; Frohn, Florian; Fuhs, Carsten; Hensel, Jera; Schneider-Kamp, Peter
3
2014
SAT solving for termination proofs with recursive path orders and dependency pairs. Zbl 1276.68140
Codish, Michael; Giesl, Jürgen; Schneider-Kamp, Peter; Thiemann, René
5
2012
A linear operational semantics for termination and complexity analysis of ISO prolog. Zbl 1377.68068
Ströder, Thomas; Emmes, Fabian; Schneider-Kamp, Peter; Giesl, Jürgen; Fuhs, Carsten
2
2012
Polytool: polynomial interpretations as a basis for termination analysis of logic programs. Zbl 1222.68064
Nguyen, Manh Thang; De Schreye, Danny; Giesl, Jürgen; Schneider-Kamp, Peter
6
2011
Proving termination by dependency pairs and inductive theorem proving. Zbl 1243.68267
Fuhs, Carsten; Giesl, Jürgen; Parting, Michael; Schneider-Kamp, Peter; Swiderski, Stephan
4
2011
Optimal base encodings for pseudo-Boolean constraints. Zbl 1315.68227
Codish, Michael; Fekete, Yoav; Fuhs, Carsten; Schneider-Kamp, Peter
3
2011
Dependency triples for improving termination analysis of logic programs with cut. Zbl 1326.68063
Ströder, Thomas; Schneider-Kamp, Peter; Giesl, Jürgen
2
2011
Automated termination analysis for logic programs with cut. Zbl 1209.68098
Schneider-Kamp, Peter; Giesl, Jürgen; Ströder, Thomas; Serebrenik, Alexander; Thiemann, René
8
2010
Synthesizing shortest linear straight-line programs over \(\mathrm{GF}(2)\) using SAT. Zbl 1306.68156
Fuhs, Carsten; Schneider-Kamp, Peter
5
2010
The dependency triple framework for termination of logic programs. Zbl 1284.68119
Schneider-Kamp, Peter; Giesl, Jürgen; Nguyen, Manh Thang
3
2010
Lazy abstraction for size-change termination. Zbl 1306.68022
Codish, Michael; Fuhs, Carsten; Giesl, Jürgen; Schneider-Kamp, Peter
2
2010
Automated termination proofs for logic programs by term rewriting. Zbl 1351.68054
Schneider-Kamp, Peter; Giesl, Jürgen; Serebrenik, Alexander; Thiemann, René
11
2009
Proving termination of integer term rewriting. Zbl 1242.68131
Fuhs, Carsten; Giesl, Jürgen; Plücker, Martin; Schneider-Kamp, Peter; Falke, Stephan
8
2009
Termination analysis by dependency pairs and inductive theorem proving. Zbl 1237.68181
Swiderski, Stephan; Parting, Michael; Giesl, Jürgen; Fuhs, Carsten; Schneider-Kamp, Peter
1
2009
Maximal termination. Zbl 1145.68446
Fuhs, Carsten; Giesl, Jürgen; Middeldorp, Aart; Schneider-Kamp, Peter; Thiemann, René; Zankl, Harald
8
2008
Search techniques for rational polynomial orders. Zbl 1166.68354
Fuhs, Carsten; Navarro-Marset, Rafael; Otto, Carsten; Giesl, Jürgen; Lucas, Salvador; Schneider-Kamp, Peter
7
2008
Termination analysis of logic programs based on dependency graphs. Zbl 1179.68040
Nguyen, Manh Thang; Giesl, Jürgen; Schneider-Kamp, Peter; De Schreye, Danny
7
2008
Improving context-sensitive dependency pairs. Zbl 1182.68092
Alarcón, Beatriz; Emmes, Fabian; Fuhs, Carsten; Giesl, Jürgen; Gutiérrez, Raúl; Lucas, Salvador; Schneider-Kamp, Peter; Thiemann, René
6
2008
Deciding innermost loops. Zbl 1145.68457
Thiemann, René; Giesl, Jürgen; Schneider-Kamp, Peter
2
2008
SAT solving for termination analysis with polynomial interpretations. Zbl 1214.68352
Fuhs, Carsten; Giesl, Jürgen; Middeldorp, Aart; Schneider-Kamp, Peter; Thiemann, René; Zankl, Harald
22
2007
Automated termination analysis for logic programs by term rewriting. Zbl 1196.68036
Schneider-Kamp, Peter; Giesl, Jürgen; Serebrenik, Alexander; Thiemann, René
8
2007
Proving termination by bounded increase. Zbl 1213.68347
Giesl, Jürgen; Thiemann, René; Swiderski, Stephan; Schneider-Kamp, Peter
7
2007
Proving termination using recursive path orders and SAT solving. Zbl 1148.68393
Schneider-Kamp, Peter; Thiemann, René; Annov, Elena; Codish, Michael; Giesl, Jürgen
7
2007
Mechanizing and improving dependency pairs. Zbl 1113.68088
Giesl, Jürgen; Thiemann, René; Schneider-Kamp, Peter; Falke, Stephan
40
2006
Automated termination analysis for Haskell: from term rewriting to programming languages. Zbl 1151.68444
Giesl, Jürgen; Swiderski, Stephan; Schneider-Kamp, Peter; Thiemann, René
19
2006
SAT solving for argument filterings. Zbl 1165.68484
Codish, Michael; Schneider-Kamp, Peter; Lagoon, Vitaly; Thiemann, René; Giesl, Jürgen
3
2006
The dependency pair framework: Combining techniques for automated termination proofs. Zbl 1108.68477
Giesl, Jürgen; Thiemann, René; Schneider-Kamp, Peter
37
2005
Proving and disproving termination of higher-order functions. Zbl 1171.68714
Giesl, Jürgen; Thiemann, René; Schneider-Kamp, Peter
27
2005
Improved modular termination proofs using dependency pairs. Zbl 1126.68582
Thiemann, René; Giesl, Jürgen; Schneider-Kamp, Peter
10
2004
Improving dependency pairs. Zbl 1273.68320
Giesl, Jürgen; Thiemann, René; Schneider-Kamp, Peter; Falke, Stephan
10
2003
all top 5

Cited by 194 Authors

20 Schneider-Kamp, Peter
19 Giesl, Jürgen
19 Lucas, Salvador
13 Middeldorp, Aart
12 Thiemann, René
10 Codish, Michael
10 Cruz-Filipe, Luís
9 Fuhs, Carsten
9 Vidal, Germán
8 Gutiérrez, Raúl
8 Nishida, Naoki
7 Zantema, Hans
6 Endrullis, Jörg
6 Frohn, Florian
6 Meseguer Guaita, José
6 Ströder, Thomas
6 Zankl, Harald
5 Hensel, Jera
5 Hirokawa, Nao
5 Iborra, José
5 Sternagel, Christian
4 Ábrahám, Erika
4 Alarcón, Beatriz
4 Brockschmidt, Marc
4 De Schreye, Danny
4 Kremer, Gereon
4 Winkler, Sarah
3 Aschermann, Cornelius
3 Borralleras, Cristina
3 Drabent, Włodzimierz
3 Ehlers, Thorsten
3 Emmes, Fabian
3 Falke, Stephan
3 Greco, Sergio
3 Kop, Cynthia
3 Payet, Étienne
3 Rodríguez-Carbonell, Enric
3 Rubio, Albert
3 Sakai, Masahiko
3 Trubitsyna, Irina
3 Yamada, Akihisa
2 Alpuente, María
2 Aoto, Takahito
2 Biere, Armin
2 Blanchette, Jasmin Christian
2 Blanqui, Frédéric
2 Calautti, Marco
2 Corzilius, Florian
2 Durán, Francisco
2 Escobar, Santiago
2 Fernández, Mirtha-Lina
2 Frank, Michael
2 Geuvers, Jan Herman
2 Gramlich, Bernhard
2 Hendriks, Dimitri
2 Heule, Marijn J. H.
2 Kiesl, Benjamin
2 Korp, Martin
2 Lammich, Peter
2 Marques-Silva, João P.
2 Mesnard, Fred
2 Molinaro, Cristian
2 Moser, Georg
2 Müller, Mike
2 Navarro-Marset, Rafael
2 Nebel, Markus E.
2 Noschinski, Lars
2 Oliveras, Albert
2 Otto, Carsten
2 Parting, Michael
2 Peralta, René C.
2 Plücker, Martin
2 Sabel, David
2 Schernhammer, Felix
2 Swiderski, Stephan
2 Urbain, Xavier
2 Voets, Dean
2 Waldmann, Johannes
1 Akleylek, Sedat
1 Alviano, Mario
1 Andersen, Nils Byrial
1 Arroyo, Gustavo
1 Avanzini, Martin
1 Ben-Amram, Amir M.
1 Bomanson, Jori
1 Boudol, Gérard
1 Boyar, Joan F.
1 Bright, Curtis
1 Bundala, Daniel
1 Çengellenmiş, Yasemin
1 Cheung, Kevin K. H.
1 Comini, Marco
1 Courtieu, Pierre
1 De Vrijer, Roel C.
1 Deng, Yuxin
1 Dodaro, Carmine
1 Dolev, Danny
1 Falaschi, Moreno
1 Fekete, Yoav
1 Felgenhauer, Bertram
...and 94 more Authors

Citations by Year