The following pages link to Peter Schneider-Kamp (Q340574):
Displayed 47 items.
- Optimal-depth sorting networks (Q340576) (← links)
- Proving termination by dependency pairs and inductive theorem proving (Q438537) (← links)
- Mechanizing and improving dependency pairs (Q877836) (← links)
- Sorting nine inputs requires twenty-five comparisons (Q899586) (← links)
- Adding constants to string rewriting (Q945008) (← links)
- How to get more out of your oracles (Q1687729) (← links)
- Formally proving size optimality of sorting networks (Q1694569) (← links)
- Active integrity constraints for general-purpose knowledge bases (Q1783734) (← links)
- Formally verifying the solution to the Boolean Pythagorean triples problem (Q2323449) (← links)
- Analyzing program termination and complexity automatically with \textsf{AProVE} (Q2362493) (← links)
- Automatically proving termination and memory safety for programs with pointer arithmetic (Q2362494) (← links)
- SAT solving for termination proofs with recursive path orders and dependency pairs (Q2392415) (← links)
- Efficient certified RAT verification (Q2405252) (← links)
- Sorting networks: to the end and back again (Q2424684) (← links)
- Sorting Networks: The End Game (Q2799216) (← links)
- Integrity Constraints for General-Purpose Knowledge Bases (Q2807083) (← links)
- Formalizing Size-Optimal Sorting Networks: Extracting a Certified Proof Checker (Q2945629) (← links)
- Automated termination proofs for logic programs by term rewriting (Q2946588) (← links)
- Optimal Base Encodings for Pseudo-Boolean Constraints (Q3000648) (← links)
- Dependency Triples for Improving Termination Analysis of Logic Programs with Cut (Q3003493) (← links)
- <tt>Polytool</tt>: Polynomial interpretations as a basis for termination analysis of logic programs (Q3087808) (← links)
- Proving Termination of Programs Automatically with AProVE (Q3192189) (← links)
- Proving Termination and Memory Safety for Programs with Pointer Arithmetic (Q3192191) (← links)
- (Q3408137) (← links)
- Optimizing a Certified Proof Checker for a Large-Scale Computer-Generated Proof (Q3453106) (← links)
- Maximal Termination (Q3522012) (← links)
- Deciding Innermost Loops (Q3522030) (← links)
- Proving Termination Using Recursive Path Orders and SAT Solving (Q3525016) (← links)
- Automated Termination Analysis for Haskell: From Term Rewriting to Programming Languages (Q3527303) (← links)
- The Dependency Triple Framework for Termination of Logic Programs (Q3558284) (← links)
- Automated termination analysis for logic programs with cut (Q3585154) (← links)
- Automated Termination Analysis for Logic Programs by Term Rewriting (Q3591084) (← links)
- Proving Termination by Bounded Increase (Q3608788) (← links)
- SAT Solving for Termination Analysis with Polynomial Interpretations (Q3612476) (← links)
- Proving Termination of Integer Term Rewriting (Q3636817) (← links)
- Formally Proving the Boolean Pythagorean Triples Conjecture (Q4645756) (← links)
- A Linear Operational Semantics for Termination and Complexity Analysis of ISO Prolog (Q4909327) (← links)
- Synthesizing Shortest Linear Straight-Line Programs over GF(2) Using SAT (Q4930580) (← links)
- Lazy Abstraction for Size-Change Termination (Q4933307) (← links)
- Termination Analysis by Dependency Pairs and Inductive Theorem Proving (Q5191111) (← links)
- Automated Reasoning (Q5307050) (← links)
- SAT Solving for Argument Filterings (Q5387882) (← links)
- Frontiers of Combining Systems (Q5491901) (← links)
- Termination Analysis of Logic Programs Based on Dependency Graphs (Q5504590) (← links)
- Search Techniques for Rational Polynomial Orders (Q5505493) (← links)
- Improving Context-Sensitive Dependency Pairs (Q5505586) (← links)
- Logic for Programming, Artificial Intelligence, and Reasoning (Q5705932) (← links)