• Campusvej 55

    5230 Odense M

    Danmark

20032021
Hvis du har foretaget ændringer i Pure, vil de snart blive vist her.

Publikationer 2003 2019

2003

Improving dependency Pairs

Giesl, J., Thiemann, R., Schneider-Kamp, P. & Falke, S., 1. jan. 2003, Logic for Programming, Artificial Intelligence, and Reasoning. Voronkov, A. & Vardi, M. Y. (red.). Springer VS, s. 167-182 16 s. (Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science), Bind 2850).

Publikation: Bidrag til bog/antologi/rapport/konference-proceedingKonferencebidrag i proceedingsForskningpeer review

2004

Automated termination proofs with AProVE

Giesl, J., Thiemann, R., Schneider-Kamp, P. & Falke, S., 1. dec. 2004, I : Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3091, s. 210-220 11 s.

Publikation: Bidrag til tidsskriftTidsskriftartikelForskningpeer review

Graphical user interfaces
Termination
Graphical User Interface
Simplification
Efficient Algorithms

Improved modular termination proofs using dependency pairs

Thiemann, R., Giesl, J. & Schneider-Kamp, P., 9. dec. 2004, I : Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science). 3097, s. 75-90 16 s.

Publikation: Bidrag til tidsskriftKonferenceartikelForskningpeer review

Experiments
2005

Proving and disproving termination of higher-order functions

Giesl, J., Thiemann, R. & Schneider-Kamp, P., 1. dec. 2005, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). s. 216-231 16 s. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Bind 3717 LNAI).

Publikation: Bidrag til bog/antologi/rapport/konference-proceedingKonferencebidrag i proceedingsForskningpeer review

The dependency pair framework: Combining techniques for automated termination proofs

Giesl, J., Thiemann, R. & Schneider-Kamp, P., 1. dec. 2005, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). s. 301-331 31 s. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Bind 3452 LNAI).

Publikation: Bidrag til bog/antologi/rapport/konference-proceedingKonferencebidrag i proceedingsForskningpeer review

2006

AProVE 1.2: Automatic termination proofs in the dependency pair framework

Giesl, J., Schneider-Kamp, P. & Thiemann, R., 1. jan. 2006, Automated Reasoning - Third International Joint Conference, IJCAR 2006, Proceedings. Springer VS, s. 281-286 6 s. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Bind 4130 LNAI).

Publikation: Bidrag til bog/antologi/rapport/konference-proceedingKonferencebidrag i proceedingsForskningpeer review

Automated termination analysis for haskell: From term rewriting to programming languages

Giesl, J., Swiderski, S., Schneider-Kamp, P. & Thiemann, R., 1. jan. 2006, Term Rewriting and Applications - 17th International Conference, RTA 2006, Proceedings. Springer VS, s. 297-312 16 s. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Bind 4098 LNCS).

Publikation: Bidrag til bog/antologi/rapport/konference-proceedingKonferencebidrag i proceedingsForskningpeer review

Computer programming languages

Mechanizing and improving dependency pairs

Giesl, J., Thiemann, R., Schneider-Kamp, P. & Falke, S., 1. okt. 2006, I : Journal of Automated Reasoning. 37, 3, s. 155-203 49 s.

Publikation: Bidrag til tidsskriftTidsskriftartikelForskningpeer review

SAT solving for argument filterings

Codish, M., Schneider-Kamp, P., Lagoon, V., Thiemann, R. & Giesl, J., 1. jan. 2006, Logic for Programming, Artificial Intelligence, and Reasoning - 13th International Conference, LPAR 2006, Proceedings. Springer VS, s. 30-44 15 s. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Bind 4246 LNAI).

Publikation: Bidrag til bog/antologi/rapport/konference-proceedingKonferencebidrag i proceedingsForskningpeer review

Experiments
2007

Automated termination analysis for logic programs by term rewriting

Schneider-Kamp, P., Giesl, J., Serebrenik, A. & Thiemann, R., 28. aug. 2007, Logic-Based Program Synthesis and Transformation - 16th International Symposium, LOPSTR 2006 Revised Selected Papers. s. 177-193 17 s. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Bind 4407 LNCS).

Publikation: Bidrag til bog/antologi/rapport/konference-proceedingKonferencebidrag i proceedingsForskningpeer review

Logic programming
Acoustic waves

Proving termination by bounded increase

Giesl, J., Thiemann, R., Swiderski, S. & Schneider-Kamp, P., 15. okt. 2007, Automated Deduction - CADE-21 - 21st International Conference on Automated Deduction, Proceedings. s. 443-459 17 s. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Bind 4603 LNAI).

Publikation: Bidrag til bog/antologi/rapport/konference-proceedingKonferencebidrag i proceedingsForskningpeer review

Proving termination using recursive path orders and SAT solving

Schneider-Kamp, P., Thiemann, R., Annov, E., Codish, M. & Giesl, J., 1. dec. 2007, Frontiers of Combining Systems - 6th International Symposium, FroCoS 2007, Proceedings. s. 267-282 16 s. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Bind 4720 LNAI).

Publikation: Bidrag til bog/antologi/rapport/konference-proceedingKonferencebidrag i proceedingsForskningpeer review

Experiments

SAT solving for termination analysis with polynomial interpretations

Fuhs, C., Giesl, J., Middeldorp, A., Schneider-Kamp, P., Thiemann, R. & Zankl, H., 1. dec. 2007, Theory and Applications of Satisfiability Testing - SAT 2007 - 10th International Conference, Proceedings. s. 340-354 15 s. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Bind 4501 LNCS).

Publikation: Bidrag til bog/antologi/rapport/konference-proceedingKonferencebidrag i proceedingsForskningpeer review

Polynomials
2008

Adding constants to string rewriting

Thiemann, R., Zantema, H., Giesl, J. & Schneider-Kamp, P., 1. feb. 2008, I : Applicable Algebra in Engineering, Communications and Computing. 19, 1, s. 27-38 12 s.

Publikation: Bidrag til tidsskriftTidsskriftartikelForskningpeer review

Unary
Rewriting
Strings
Termination
Term Rewriting

Deciding innermost loops

Thiemann, R., Giesl, J. & Schneider-Kamp, P., 13. aug. 2008, Rewriting Techniques and Applications - 19th International Conference, RTA 2008, Proceedings. s. 366-380 15 s. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Bind 5117 LNCS).

Publikation: Bidrag til bog/antologi/rapport/konference-proceedingKonferencebidrag i proceedingsForskningpeer review

Improving context-sensitive dependency Pairs

Alarcón, B., Emmes, F., Fuhs, C., Giesl, J., Gutiérrez, R., Lucas, S., Schneider-Kamp, P. & Thiemann, R., 31. dec. 2008, Logic for Programming, Artificial Intelligence, and Reasoning - 15th International Conference, LPAR 2008, Proceedings. s. 636-651 16 s. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Bind 5330 LNAI).

Publikation: Bidrag til bog/antologi/rapport/konference-proceedingKonferencebidrag i proceedingsForskningpeer review

Maximal termination

Fuhs, C., Giesl, J., Middeldorp, A., Schneider-Kamp, P., Thiemann, R. & Zankl, H., 13. aug. 2008, Rewriting Techniques and Applications - 19th International Conference, RTA 2008, Proceedings. s. 110-125 16 s. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Bind 5117 LNCS).

Publikation: Bidrag til bog/antologi/rapport/konference-proceedingKonferencebidrag i proceedingsForskningpeer review

Polynomials

Search techniques for rational polynomial orders

Fuhs, C., Navarro-Marset, R., Otto, C., Giesl, J., Lucas, S. & Schneider-Kamp, P., 10. sep. 2008, Intelligent Computer Mathematics - 9th International Conference, AISC 2008 - 15th Symposium, Calculemus 2008 - 7th International Conference, MKM 2008, Proceedings. s. 109-124 16 s. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Bind 5144 LNAI).

Publikation: Bidrag til bog/antologi/rapport/konference-proceedingKonferencebidrag i proceedingsForskningpeer review

Polynomial
Interpretation
Termination
Evaluate
Term

Termination analysis of logic programs based on dependency graphs

Nguyen, M. T., Giesl, J., Schneider-Kamp, P. & De Schreye, D., 1. dec. 2008, Logic-Based Program Synthesis and Transformation - 17th International Symposium, LOPSTR 2007, Revised Selected Papers. s. 8-22 15 s. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Bind 4915 LNCS).

Publikation: Bidrag til bog/antologi/rapport/konference-proceedingKonferencebidrag i proceedingsForskningpeer review

Logic programming
Polynomials
Decomposition
2009

Automated Termination Proofs for Logic Programs by Term Rewriting

Schneider-Kamp, P., Giesl, J., Serebrenik, A. & Thiemann, R., 2009, I : ACM Transactions on Computational Logic. 11, 1, s. Article 2 52 s.

Publikation: Bidrag til tidsskriftTidsskriftartikelForskningpeer review

Term Rewriting
Logic programming
Logic Programs
Termination
Acoustic waves

Proving Termination of Integer Term Rewriting

Fuhs, C., Giesl, J., Plücker, M., Schneider-Kamp, P. & Falke, S., 2009, Proceedings of the 20th International Conference on Rewriting Techniques and Applications (RTA '09). Springer, 15 s.

Publikation: Bidrag til bog/antologi/rapport/konference-proceedingKonferencebidrag i proceedingsForskningpeer review

Termination Analysis by Dependency Pair and Inductive Theorem Proving

Swiderski, S., Parting, M., Giesl, J., Fuhs, C. & Schneider-Kamp, P., 2009, Proceedings of the 22nd International Conference on Automated Deduction (CADE '09). Schmidt, R. A. (red.). Springer, s. 322-338

Publikation: Bidrag til bog/antologi/rapport/konference-proceedingKonferencebidrag i proceedingsForskningpeer review

Theorem proving

The Dependency Triple Framework for Termination of Logic Programs

Schneider-Kamp, P., Giesl, J. & Nguzen, M. T., 2009, Proceedings of the 19th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR '09). Springer, s. 37-51

Publikation: Bidrag til bog/antologi/rapport/konference-proceedingKonferencebidrag i proceedingsForskningpeer review

2010

Automated Termination Analysis for Logic Programs with Cut

Schneider-Kamp, P., Giesl, J., Ströder, T., Serebrenik, A. & Thiemann, R., 2010, I : Theory and Practice of Logic Programming. 10, 4-6, s. 365 381 s.

Publikation: Bidrag til tidsskriftTidsskriftartikelForskningpeer review

Logic Programs
Termination
Processing
Preprocessing
Prolog

Lazy Abstractions for Size-Change Termination

Codish, M., Fuhs, C., Giesl, J. & Schneider-Kamp, P., 2010, International Conference on Logic for Programming Artificial Intelligence and Reasoning. Fermüller, C. G. & Voronkov, A. (red.). Springer, s. 217-232 (Lecture Notes in Computer Science, Bind 6397).

Publikation: Bidrag til bog/antologi/rapport/konference-proceedingKonferencebidrag i proceedingsForskningpeer review

Experiments

Loops under Strategies ... Continued

Thiemann, R., Sternagel, C., Giesl, J. & Schneider-Kamp, P., 2010, Proceedings of the Proceedings of the 1st International Workshop on Strategies in Rewriting, Proving, and Programming (IWS '10). Electronic Proceedings in Theoretical Computer Science, Bind 44.

Publikation: Bidrag til bog/antologi/rapport/konference-proceedingKonferencebidrag i proceedingsForskningpeer review

Optimal Base Encodings for Pseudo-Boolean Constraints

Codish, M., Fekete, Y., Fuhs, C. & Schneider-Kamp, P., 2010, Proceedings of the 17th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS '11). Springer, Bind 6605. 23 s.

Publikation: Bidrag til bog/antologi/rapport/konference-proceedingKonferencebidrag i proceedingsForskningpeer review

Static Terrmination Analysis for Prolog Using Term Rewriting and SAT Solving

Schneider-Kamp, P., 2010, I : Kuenstliche Intelligenz. 24, 1, s. 79-81

Publikation: Bidrag til tidsskriftTidsskriftartikelForskningpeer review

earning a doctorate
logic
ranking

Synthesizing shortest linear straight-line programs over GF(2) using SAT

Fuhs, C. & Schneider-Kamp, P., 2. aug. 2010, Theory and Applications of Satisfiability Testing - 13th International Conference, SAT 2010, Proceedings. s. 71-84 14 s. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Bind 6175 LNCS).

Publikation: Bidrag til bog/antologi/rapport/konference-proceedingKonferencebidrag i proceedingsForskningpeer review

Cryptography
Networks (circuits)

Synthesizing Shortest Straight-Line Programs over GF(2) using SAT

Schneider-Kamp, P. & Fuhs, C., 2010, Proceedings of the 13th International Conference on Theory and Applications of Satisfiability Testing (SAT '10). s. 71-84

Publikation: Bidrag til bog/antologi/rapport/konference-proceedingKonferencebidrag i proceedingsForskningpeer review

2011

Automated Termination Proofs for Haskell by Term Rewriting

Giesl, J., Raffelsieper, M., Schneider-Kamp, P., Swiderski, S. & Thiemann, R., 2011, I : A C M Transactions on Programming Languages and Systems. 33, 2, s. Article 7 39 s.

Publikation: Bidrag til tidsskriftTidsskriftartikelForskningpeer review

Computer programming languages

Dependency Triples for Improving Termination Analysis of Logic Programs with Cut

Ströder, T., Schneider-Kamp, P. & Giesl, J., 2011, Proceedings of the 20th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR '10). Springer, s. 184-199 (Lecture Notes in Computer Science, Bind 6564).

Publikation: Bidrag til bog/antologi/rapport/konference-proceedingKonferencebidrag i proceedingsForskningpeer review

Experiments

Foreword

Hanus, M. & Schneider-Kamp, P., 2. sep. 2011, I : PPDP'11 - Proceedings of the 2011 Symposium on Principles and Practices of Declarative Programming.

Publikation: Bidrag til tidsskriftLederForskningpeer review

Polytool: Polynomial Interpretations as a Basis for Termination Analysis of Logic Programs

Nguyen, M. T., De Schreye, D., Giesl, J. & Schneider-Kamp, P., 2011, I : Theory and Practice of Logic Programming. 11, s. 33-63

Publikation: Bidrag til tidsskriftTidsskriftartikelForskningpeer review

Logic Programs
Termination
Polynomials
Polynomial
Paradigm

Proving Termination by Dependency Pairs and Inductive Theorem Proving

Fuhs, C., Giesl, J., Schneider-Kamp, P. & Parting, M., 2011, I : Journal of Automated Reasoning. 47, 2, s. 133-160

Publikation: Bidrag til tidsskriftTidsskriftartikelForskningpeer review

Theorem proving
2012

A Linear Operational Semantics for Termination and Complexity Analysis of ISO Prolog

Ströder, T., Emmes, F., Schneider-Kamp, P., Giesl, J. & Fuhs, C., 2012, Proceedings of the 14th International Symposium on Principles and Practice of Declarative Programming (PPDP '12). Association for Computing Machinery, s. 237-252 (Lecture Notes in Computer Science, Bind 7225).

Publikation: Bidrag til bog/antologi/rapport/konference-proceedingKonferencebidrag i proceedingsForskningpeer review

Semantics
Logic programming
Substitution reactions

SAT Solving for Termination Proofs with Recursive Path Orders and Dependency Pairs

Codish, M., Giesl, J., Schneider-Kamp, P. & Thiemann, R., 2012, I : Journal of Automated Reasoning. 49, 1, s. 53-93

Publikation: Bidrag til tidsskriftTidsskriftartikelForskningpeer review

Experiments

Symbolic Evaluation Graphs and Term Rewriting - A General Methodology for Analyzing Logic Programs

Giesl, J., Ströder, T., Schneider-Kamp, P., Emmes, F. & Fuhs, C., 2012, Proceedings of the 14th International Symposium on Principles and Practice of Declarative Programming (PPDP '12). Association for Computing Machinery, 12 s.

Publikation: Bidrag til bog/antologi/rapport/konference-proceedingKonferencebidrag i proceedingsForskningpeer review

2013

Symbolic Evaluation Graphs and Term Rewriting — A General Methodology for Analyzing Logic Programs

Giesl, J., Ströder, T., Schneider-Kamp, P., Emmes, F. & Fuhs, C., 2013, Logic-Based Program Synthesis and Transformation. Albert, E. (red.). Springer, Bind 7844. 1 s. (Lecture Notes in Computer Science, Bind 7844).

Publikation: Bidrag til bog/antologi/rapport/konference-proceedingKonferencebidrag i proceedingsForskningpeer review

2014

Group Communication Patterns for High Performance Computing in Scala

Hargreaves, F. P., Merkle, D. & Schneider-Kamp, P., 2014, Proceedings of the 3rd ACM SIGPLAN Workshop on Functional High-Performance Computing. Association for Computing Machinery, s. 75-85

Publikation: Bidrag til bog/antologi/rapport/konference-proceedingKonferencebidrag i proceedingsForskningpeer review

Proving Termination and Memory Safety for Programs with Pointer Arithmetic

Ströder, T., Giesl, J., Brockschmidt, M., Frohn, F., Fuhs, C., Hensel, J. & Schneider-Kamp, P., 2014, Automated Reasoning: Proceedings of the 7th International Joint Conference on Automated Reasoning (IJCAR '14). Demri, S., Kapur, D. & Weidenbach, C. (red.). Springer, s. 208-223 16 s. (Lecture Notes in Computer Science, Bind 8562).

Publikation: Bidrag til bog/antologi/rapport/konference-proceedingKonferencebidrag i proceedingsForskningpeer review

Proving termination and memory safety for programs with pointer arithmetic

Ströder, T., Giesl, J., Brockschmidt, M., Frohn, F., Fuhs, C., Hensel, J. & Schneider-Kamp, P., 2014

Publikation: Bog/antologi/afhandling/rapportBogForskningpeer review

Proving Termination of Programs Automatically with AProVE

Giesl, J., Brockschmidt, M., Emmes, F., Frohn, F., Fuhs, C., Otto, C., Plücker, M., Schneider-Kamp, P., Ströder, T., Swiderski, S. & Thiemann, R., 2014, Automated Reasoning: Proceedings of the 7th International Joint Conference on Automated Reasoning (IJCAR '14). Demri, S., Kapur, D. & Weidenbach, C. (red.). Springer, s. 184-191 8 s. (Lecture Notes in Computer Science, Bind 8562).

Publikation: Bidrag til bog/antologi/rapport/konference-proceedingKonferencebidrag i proceedingsForskningpeer review

Proving termination of programs automatically with AProVE

Giesl, J., Brockschmidt, M., Emmes, F., Frohn, F., Fuhs, C., Otto, C., Plücker, M., Schneider-Kamp, P., Ströder, T., Swiderski, S. & Thiemann, R., 2014

Publikation: Bog/antologi/afhandling/rapportBogForskningpeer review

The Quest for Optimal Sorting Networks: Efficient Generation of Two-Layer Prefixes

Codish, M., Cruz-Filipe, L. & Schneider-Kamp, P., 2014, Proceedings of the 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing. IEEE, s. 359-366

Publikation: Bidrag til bog/antologi/rapport/konference-proceedingKonferencebidrag i proceedingsForskningpeer review

Twenty-Five Comparators is Optimal when Sorting Nine Inputs (and Twenty-Nine for Ten)

Codish, M., Frank, M., Cruz-Filipe, L. & Schneider-Kamp, P., 2014, Proceedings of the 26th IEEE International Conference on Tools with Artificial Intelligence. IEEE, s. 186-193

Publikation: Bidrag til bog/antologi/rapport/konference-proceedingKonferencebidrag i proceedingsForskningpeer review

2015

Applying Sorting Networks to Synthesize Optimized Sorting Libraries

Codish, M., Cruz-Filipe, L., Nebel, M. & Schneider-Kamp, P., dec. 2015, Logic-Based Program Synthesis and Transformation: 25th International Symposium, LOPSTR 2015, Siena, Italy, July 13-15, 2015. Revised Selected Papers. Falaschi, M. (red.). Springer, s. 127-142 (Lecture Notes in Computer Science, Bind 9527).

Publikation: Bidrag til bog/antologi/rapport/konference-proceedingKonferencebidrag i proceedingsForskningpeer review

Sorting
Program processors

Formalizing Size-Optimal Sorting Networks: Extracting a Certified Proof Checker

Cruz-Filipe, L. & Schneider-Kamp, P., 2015, Interactive Theorem Proving: 6th International Conference, ITP 2015, Nanjing, China, August 24-27, 2015, Proceedings. Urban, C. & Zhang, X. (red.). Springer, s. 154-169 (Lecture Notes in Computer Science, Bind 9236).

Publikation: Bidrag til bog/antologi/rapport/konference-proceedingKonferencebidrag i proceedingsForskningpeer review

Optimizing a Certified Proof Checker for a Large-Scale Computer-Generated Proof

Cruz-Filipe, L. & Schneider-Kamp, P., 2015, Intelligent Computer Mathematics: Proceedings of the 8th Conference on Intelligent Computer Mathematics (CICM 2015). Kerber, M., Carette, J., Kaliszyk, C., Rabe, F. & Sorge, V. (red.). Springer, s. 55-70 (Lecture Notes in Computer Science, Bind 9150).

Publikation: Bidrag til bog/antologi/rapport/konference-proceedingKonferencebidrag i proceedingsForskningpeer review

repAIrC: A Tool for Ensuring Data Consistency by Means of Active Integrity Constraints

Cruz-Filipe, L., Franz, M., Hakhverdyan, A., Ludovico, M., Nunes, I. & Schneider-Kamp, P., 12. nov. 2015, Proceedings of the 7th International Joint Conference on Knowledge Discovery, Knowledge Engineering and Knowledge Management (IC3K2015). Fred, A., Dietz, J., Aveiro, D., Liu, K. & Filipe, J. (red.). SCITEPRESS Digital Library, Bind 3. s. 17-26

Publikation: Bidrag til bog/antologi/rapport/konference-proceedingKonferencebidrag i proceedingsForskningpeer review