Peter Schneider-Kamp

E-Mail

petersk@imada.sdu.dk

Home page

http://imada.sdu.dk/~petersk/

Telephone

+45 6550 2327

Position

Associate Professor

Office

IMADA, Ø13-602b-2 (map)

Address

Dept. of Mathematics & Computer Science
University of Southern Denmark
Campusvej 55
DK-5230 Odense M
Denmark

Teaching

Current Courses

Past Courses

Research

Automated Software Verification

Reducing Search Problems to SAT

Professional Activities

Current Activities & Memberships

Past Activities

Selected Publications

PhD Thesis

Journals

Conferences

  • J. Giesl, T. Ströder, P. Schneider-Kamp, F. Emmes, and C. Fuhs
    Symbolic Evaluation Graphs and Term Rewriting - A General Methodology for Analyzing Logic Programs
    In Proceedings of the 14th International Symposium on Principles and Practice of Declarative Programming (PPDP '12), Leuven, Belgium, pages 1-12, 2012. ©ACM Press.
    Extended version appeared as Technical Report AIB-2012-12, RWTH Aachen, Germany.
  • T. Ströder, F. Emmes, P. Schneider-Kamp, J. Giesl, and C. Fuhs
    A Linear Operational Semantics for Termination and Complexity Analysis of ISO Prolog
    In Proceedings of the 21st International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR '11), Odense, Denmark, Lecture Notes in Computer Science. To appear. ©Springer-Verlag
    Extended version appeared as Technical Report AIB-2011-08, RWTH Aachen, Germany.
  • M. Codish, Y. Fekete, C. Fuhs, and P. Schneider-Kamp
    Optimal Base Encodings for Pseudo-Boolean Constraints
    In Proceedings of the 17th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS '11), Saarbrücken, Germany, Lecture Notes in Computer Science 6605, 189-204, 2011. © Springer-Verlag
  • R. Thiemann, C. Sternagel, J. Giesl, and P. Schneider-Kamp
    Loops under Strategies ... Continued
    In Proceedings of the 1st International Workshop on Strategies in Rewriting, Proving, and Programming (IWS '10), Edinburgh, UK, Electronic Proceedings in Theoretical Computer Science 44, 51-65, 2010.
  • M. Codish, C. Fuhs, J. Giesl, and P. Schneider-Kamp
    Lazy Abstraction for Size-Change Termination
    In Proceedings of the 17th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR-17), Yogyakarta, Indonesia, Lecture Notes in Computer Science (ARCoSS) 6397, 217-232, 2010. © Springer-Verlag
  • T. Ströder, P. Schneider-Kamp, and J. Giesl
    Dependency Triples for Improving Termination Analysis of Logic Programs with Cut
    In Proceedings of the 20th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR '10), Lecture Notes in Computer Science 6564, 184-199, 2011. © Springer-Verlag
  • C. Fuhs and P. Schneider-Kamp
    Synthesizing Shortest Straight-Line Programs over GF(2) using SAT
    In Proceedings of the 13th International Conference on Theory and Applications of Satisfiability Testing (SAT '10), Edinburgh, UK, Lecture Notes in Computer Science 6175, pages 71 - 84, 2010. © Springer-Verlag
  • P. Schneider-Kamp, J. Giesl, and M. T. Nguyen
    The Dependency Triple Framework for Termination of Logic Programs
    In Proceedings of the 19th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR '09), Coimbra, Portugal, Lecture Notes in Computer Science 6037, 37-51, 2010. ©Springer-Verlag
  • S. Swiderski, M. Parting, J. Giesl, C. Fuhs, and P. Schneider-Kamp
    Termination Analysis by Dependency Pairs and Inductive Theorem Proving
    In Proceedings of the 22nd International Conference on Automated Deduction (CADE '09), Montreal, Canada, Lecture Notes in Artificial Intelligence 5663, 322-338, 2009. ©Springer-Verlag
  • C. Fuhs, J. Giesl, M. Plücker, P. Schneider-Kamp, and S. Falke
    Proving Termination of Integer Term Rewriting
    In Proceedings of the 20th International Conference on Rewriting Techniques and Applications (RTA '09), Brasilia, Brazil, Lecture Notes in Computer Science 5595, 32-47, 2009. ©Springer-Verlag
  • B. Alarcon, F. Emmes, C. Fuhs, J. Giesl, R. Gutierrez, S. Lucas, P. Schneider-Kamp, and R. Thiemann
    Improving Context-Sensitive Dependency Pairs
    In Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR '08), Doha, Qatar, Lecture Notes in Artificial Intelligence 5330, pages 636 - 651, 2008. © Springer-Verlag
    Extended version appeared as Technical Report AIB-2008-13, RWTH Aachen, Germany.
  • C. Fuhs, R. Navarro, C. Otto, J. Giesl, S. Lucas, and P. Schneider-Kamp
    Search Techniques for Rational Polynomial Orders
    In Proceedings of the 9th International Conference on Artificial Intelligence and Symbolic Computation (AISC '08), Birmingham, UK, Lecture Notes in Artificial Intelligence 5144, pages 109-124, 2008. ©Springer-Verlag
  • C. Fuhs, J. Giesl, A. Middeldorp, P. Schneider-Kamp, R. Thiemann, and H. Zankl
    Maximal Termination
    In Proceedings of the 19th International Conference on Rewriting Techniques and Applications (RTA '08), Hagenberg, Austria, Lecture Notes in Computer Science 5117, pages 110-125, 2008. ©Springer-Verlag
    Extended version appeared as Technical Report AIB-2008-03, RWTH Aachen, Germany.
  • R. Thiemann, J. Giesl, P. Schneider-Kamp
    Deciding Innermost Loops
    In Proceedings of the 19th International Conference on Rewriting Techniques and Applications (RTA '08), Hagenberg, Austria, Lecture Notes in Computer Science 5117, pages 366-380, 2008. ©Springer-Verlag
  • M. T. Nguyen, J. Giesl, P. Schneider-Kamp, and D. De Schreye
    Termination Analysis of Logic Programs based on Dependency Graphs
    In Proceedings of the 17th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR '07), Kongens Lyngby, Denmark, Lecture Notes in Computer Science 4915, pages 8-22, 2008. ©Springer-Verlag
  • P. Schneider-Kamp, R. Thiemann, E. Annov, M. Codish, and J. Giesl
    Proving Termination using Recursive Path Orders and SAT Solving
    In Proceedings of the 6th International Symposium on Frontiers of Combining Systems (FroCoS '07), Liverpool, UK, Lecture Notes in Artificial Intelligence 4720, pages 267-282, 2007. ©Springer-Verlag
  • J. Giesl, R. Thiemann, S. Swiderski, and P. Schneider-Kamp
    Proving Termination by Bounded Increase
    In Proceedings of the 21st International Conference on Automated Deduction (CADE '07), Bremen, Germany, Lecture Note in Artificial Intelligence 4603, pages 443-459, 2007. ©Springer-Verlag
    Extended version appeared as Technical Report AIB-2007-03, RWTH Aachen, Germany.
  • C. Fuhs, J. Giesl, A. Middeldorp, P. Schneider-Kamp, R. Thiemann, and H. Zankl
    SAT Solving for Termination Analysis with Polynomial Interpretations
    In Proceedings of the 10th International Conference on Theory and Applications of Satisfiability Testing (SAT '07), Lisbon, Portugal, Lecture Notes in Computer Science 4501, pages 340-354, 2007. ©Springer-Verlag
  • M. Codish, P. Schneider-Kamp, V. Lagoon, R. Thiemann, and J. Giesl
    SAT Solving for Argument Filterings
    In Proceedings of the 13th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR '06), Phnom Penh, Cambodia, Lecture Notes in Artificial Intelligence 4246, pages 30-44, 2006. © Springer-Verlag
  • J. Giesl, S. Swiderski, P. Schneider-Kamp, and R. Thiemann
    Automated Termination Analysis for Haskell: From Term Rewriting to Programming Languages
    In Proceedings of the 17th International Conference on Rewriting Techniques and Applications (RTA-06), Seattle, USA, Lecture Notes in Computer Science 4098, pages 297-312, 2006. ©Springer-Verlag
  • P. Schneider-Kamp, J. Giesl, A. Serebrenik, and R. Thiemann
    Automated Termination Analysis for Logic Programs by Term Rewriting
    In Proceedings of the 16th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR '06), Venice, Italy, Lecture Notes in Computer Science 4407, pages 177-193, 2007. ©Springer-Verlag
  • J. Giesl, P. Schneider-Kamp, and R. Thiemann
    AProVE 1.2: Automatic Termination Proofs in the Dependency Pair Framework
    In Proceedings of the 3rd International Joint Conference on Automated Reasoning (IJCAR '06), Seattle, USA, Lecture Notes in Artificial Intelligence 4130, pages 281-286, 2006. ©Springer-Verlag
  • J. Giesl, R. Thiemann, and P. Schneider-Kamp
    Proving and Disproving Termination of Higher-Order Functions
    In Proceedings of the 5th International Workshop on Frontiers of Combining Systems (FroCoS '05), Vienna, Austria, Lecture Notes in Artificial Intelligence 3717, pages 216-231, 2005. © Springer-Verlag
  • J. Giesl, R. Thiemann, and P. Schneider-Kamp
    The Dependency Pair Framework: Combining Techniques for Automated Termination Proofs
    In Proceedings of the 11th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR '04), Montevideo, Uruguay, Lecture Notes in Artificial Intelligence 3452, pages 301-331, 2005. © Springer-Verlag
  • R. Thiemann, J. Giesl, and P. Schneider-Kamp
    Improved Modular Termination Proofs Using Dependency Pairs
    In Proceedings of the 2nd International Joint Conference on Automated Reasoning (IJCAR '04), Cork, Ireland, Lecture Notes in Artificial Intelligence 3097, pages 75-90, 2004. © Springer-Verlag
  • J. Giesl, R. Thiemann, P. Schneider-Kamp, and S. Falke
    Automated Termination Proofs with AProVE
    In Proceedings of the 15th International Conference on Rewriting Techniques and Applications (RTA '04), Aachen, Germany, Lecture Notes in Computer Science 3091, pages 210-220, 2004. © Springer-Verlag
  • J. Giesl, R. Thiemann, P. Schneider-Kamp, and S. Falke
    Improving Dependency Pairs
    In Proceedings of the 10th International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR '03), Almaty, Kazakhstan, Lecture Notes in Artificial Intelligence 2850, pages 167-182, 2003. ©Springer-Verlag
    Extended version available as Technical Report AIB-2003-04, RWTH Aachen, Germany.

Design by 1234.info | Modified by Peter Schneider-Kamp | CSS 2.0