Peter Schneider-Kamp

Available identifiers

zbMath Open schneider-kamp.peterMaRDI QIDQ340574

List of research outcomes

Publication	Date of Publication	Type
Formally verifying the solution to the Boolean Pythagorean triples problem	2019-09-02	Paper
Sorting networks: to the end and back again	2019-06-25	Paper
Formally Proving the Boolean Pythagorean Triples Conjecture	2019-01-10	Paper
Active integrity constraints for general-purpose knowledge bases	2018-09-21	Paper
Formally proving size optimality of sorting networks	2018-02-02	Paper
How to get more out of your oracles	2018-01-04	Paper
Efficient certified RAT verification	2017-09-22	Paper
Analyzing program termination and complexity automatically with \textsf{AProVE}	2017-07-10	Paper
Automatically proving termination and memory safety for programs with pointer arithmetic	2017-07-10	Paper
Optimal-depth sorting networks	2016-11-14	Paper
Integrity Constraints for General-Purpose Knowledge Bases	2016-05-19	Paper
Sorting Networks: The End Game	2016-04-08	Paper
Sorting nine inputs requires twenty-five comparisons	2015-12-30	Paper
Optimizing a Certified Proof Checker for a Large-Scale Computer-Generated Proof	2015-11-20	Paper
Automated termination proofs for logic programs by term rewriting	2015-09-17	Paper
Formalizing Size-Optimal Sorting Networks: Extracting a Certified Proof Checker	2015-09-14	Paper
Proving Termination of Programs Automatically with AProVE	2014-09-26	Paper
Proving Termination and Memory Safety for Programs with Pointer Arithmetic	2014-09-26	Paper
SAT solving for termination proofs with recursive path orders and dependency pairs	2013-08-01	Paper
A Linear Operational Semantics for Termination and Complexity Analysis of ISO Prolog	2013-03-13	Paper
Proving termination by dependency pairs and inductive theorem proving	2012-07-31	Paper
Polytool: Polynomial interpretations as a basis for termination analysis of logic programs	2011-08-17	Paper
Dependency Triples for Improving Termination Analysis of Logic Programs with Cut	2011-05-27	Paper
Optimal Base Encodings for Pseudo-Boolean Constraints	2011-05-19	Paper
Lazy Abstraction for Size-Change Termination	2010-10-12	Paper
Synthesizing Shortest Linear Straight-Line Programs over GF(2) Using SAT	2010-09-29	Paper
Automated termination analysis for logic programs with cut	2010-08-19	Paper
The Dependency Triple Framework for Termination of Logic Programs	2010-05-04	Paper
https://portal.mardi4nfdi.de/entity/Q3408137	2010-02-24	Paper
Termination Analysis by Dependency Pairs and Inductive Theorem Proving	2009-07-28	Paper
Proving Termination of Integer Term Rewriting	2009-06-30	Paper
SAT Solving for Termination Analysis with Polynomial Interpretations	2009-03-10	Paper
Proving Termination by Bounded Increase	2009-03-06	Paper
Search Techniques for Rational Polynomial Orders	2009-01-27	Paper
Improving Context-Sensitive Dependency Pairs	2009-01-27	Paper
Termination Analysis of Logic Programs Based on Dependency Graphs	2009-01-22	Paper
Automated Termination Analysis for Haskell: From Term Rewriting to Programming Languages	2008-09-25	Paper
Proving Termination Using Recursive Path Orders and SAT Solving	2008-09-16	Paper
Adding constants to string rewriting	2008-09-10	Paper
Maximal Termination	2008-08-28	Paper
Deciding Innermost Loops	2008-08-28	Paper
SAT Solving for Argument Filterings	2008-05-27	Paper
Automated Reasoning	2007-09-25	Paper
Automated Termination Analysis for Logic Programs by Term Rewriting	2007-09-10	Paper
Mechanizing and improving dependency pairs	2007-05-03	Paper
Frontiers of Combining Systems	2006-10-10	Paper
Logic for Programming, Artificial Intelligence, and Reasoning	2005-11-10	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Peter Schneider-Kamp