PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Schneider-Kamp, Peter"

Author of the publication

copydeleteadd this publication to your clipboard
Proving Termination of Programs Automatically with AProVE.

, , , , , , , , , , and . IJCAR, volume 8562 of Lecture Notes in Computer Science, page 184-191. Springer, (2014)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Prof. iR Ph. D. Johan Kamp University of Stuttgart

Elke Peter University of Stuttgart

Alexander Peter University of Stuttgart

Bernd Peters University of Stuttgart

Sarah Peter University of Stuttgart

 

Other publications of authors with the same name

Polytool: polynomial interpretations as a basis for termination analysis of Logic programs, , , and . CoRR, (2009)Static termination analysis for prolog using term rewriting and SAT solving.. RWTH Aachen University, (2008)Sorting Networks: the End Game., , and . CoRR, (2014)repAIrC: A Tool for Ensuring Data Consistency by Means of Active Integrity Constraints., , , , , and . CoRR, (2015)Automated termination proofs for logic programs by term rewriting., , , and . ACM Trans. Comput. Log., 11 (1): 2:1-2:52 (2009)Sorting nine inputs requires twenty-five comparisons., , , and . J. Comput. Syst. Sci., 82 (3): 551-563 (2016)SAT Solving for Termination Analysis with Polynomial Interpretations., , , , , and . SAT, volume 4501 of Lecture Notes in Computer Science, page 340-354. Springer, (2007)Formalizing Size-Optimal Sorting Networks: Extracting a Certified Proof Checker., and . ITP, volume 9236 of Lecture Notes in Computer Science, page 154-169. Springer, (2015)Proving Termination of Integer Term Rewriting., , , , and . RTA, volume 5595 of Lecture Notes in Computer Science, page 32-47. Springer, (2009)Maximal Termination., , , , , and . RTA, volume 5117 of Lecture Notes in Computer Science, page 110-125. Springer, (2008)