20032021

Research output per year

If you made any changes in Pure these will be visible here soon.

Research Output

Filter
Journal article
2019

Formally Verifying the Solution to the Boolean Pythagorean Triples Problem

Cruz-Filipe, L., Marques-Silva, J. & Schneider-Kamp, P., Oct 2019, In : Journal of Automated Reasoning. 63, 3, p. 695-722 28 p.

Research output: Contribution to journalJournal articleResearchpeer-review

Sorting networks: To the end and back again

Codish, M., Cruz-Filipe, L., Ehlers, T., Müller, M. & Schneider-Kamp, P., Sep 2019, In : Journal of Computer and System Sciences. 104, p. 184-201 18 p.

Research output: Contribution to journalJournal articleResearchpeer-review

File
133 Downloads (Pure)
2018

Active integrity constraints for general-purpose knowledge bases

Cruz-Filipe, L., Gaspar, G., Nunes, I. & Schneider-Kamp, P., 2018, In : Annals of Mathematics and Artificial Intelligence. 83, 3-4, p. 213-246

Research output: Contribution to journalJournal articleResearchpeer-review

2017

Analyzing Program Termination and Complexity Automatically with AProVE

Giesl, J., Aschermann, C., Brockschmidt, M., Emmes, F., Frohn, F., Fuhs, C., Hensel, J., Otto, C., Plücker, M., Schneider-Kamp, P., Ströder, T., Swiderski, S. & Thiemann, R., 2017, In : Journal of Automated Reasoning. 58, 1, p. 3-31

Research output: Contribution to journalJournal articleResearchpeer-review

Open Access
File
152 Downloads (Pure)

Automatically 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. & Aschermann, C., 2017, In : Journal of Automated Reasoning. 58, 1, p. 33-65

Research output: Contribution to journalJournal articleResearchpeer-review

Open Access
File
115 Downloads (Pure)

Formally Proving Size Optimality of Sorting Networks

Cruz-Filipe, L., Larsen, K. S. & Schneider-Kamp, P., 2017, In : Journal of Automated Reasoning. 59, 4, p. 425-454

Research output: Contribution to journalJournal articleResearchpeer-review

Optimal-depth sorting networks

Bundala, D., Codish, M., Cruz-Filipe, L., Schneider-Kamp, P. & Závodný, J., 2017, In : Journal of Computer and System Sciences. 84, p. 185-204

Research output: Contribution to journalJournal articleResearchpeer-review

File
143 Downloads (Pure)

Optimizing Sorting Algorithms by Using Sorting Networks

Codish, M., Cruz-Filipe, L., Nebel, M. & Schneider-Kamp, P., 2017, In : Formal Aspects of Computing. 29, 3, p. 559-579

Research output: Contribution to journalJournal articleResearchpeer-review

2016

Sorting nine inputs requires twenty-five comparisons

Codish, M., Cruz-Filipe, L., Frank, M. & Schneider-Kamp, P., 2016, In : Journal of Computer and System Sciences. 82, 3, p. 551-563

Research output: Contribution to journalJournal articleResearchpeer-review

2012

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

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

Research output: Contribution to journalJournal articleResearchpeer-review

2011

Automated Termination Proofs for Haskell by Term Rewriting

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

Research output: Contribution to journalJournal articleResearchpeer-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, In : Theory and Practice of Logic Programming. 11, p. 33-63

Research output: Contribution to journalJournal articleResearchpeer-review

Proving Termination by Dependency Pairs and Inductive Theorem Proving

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

Research output: Contribution to journalJournal articleResearchpeer-review

2010

Automated Termination Analysis for Logic Programs with Cut

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

Research output: Contribution to journalJournal articleResearchpeer-review

Static Terrmination Analysis for Prolog Using Term Rewriting and SAT Solving

Schneider-Kamp, P., 2010, In : Kuenstliche Intelligenz. 24, 1, p. 79-81

Research output: Contribution to journalJournal articleResearchpeer-review

2009

Automated Termination Proofs for Logic Programs by Term Rewriting

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

Research output: Contribution to journalJournal articleResearchpeer-review

2008

Adding constants to string rewriting

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

Research output: Contribution to journalJournal articleResearchpeer-review

2006

Mechanizing and improving dependency pairs

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

Research output: Contribution to journalJournal articleResearchpeer-review

2004

Automated termination proofs with AProVE

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

Research output: Contribution to journalJournal articleResearchpeer-review