Travelled to:1 × Brazil
1 × Canada
1 × France
1 × Ireland
1 × Italy
1 × United Kingdom
2 × Belgium
2 × Denmark
2 × Portugal
2 × USA
3 × Austria
3 × Germany
Collaborated with:J.Giesl R.Thiemann C.Fuhs T.Ströder S.Swiderski F.Emmes M.Codish M.T.Nguyen L.Cruz-Filipe A.Serebrenik S.Falke A.Middeldorp H.Zankl M.Plücker Y.Fekete D.D.Schreye M.Brockschmidt F.Frohn M.Parting M.J.H.Heule W.A.H.Jr. M.Kaufmann J.Hensel C.Otto S.Swiderski
Talks about:termin (17) program (11) analysi (8) logic (7) depend (6) rewrit (5) prove (5) term (5) autom (4) proof (3)
Person: Peter Schneider-Kamp
DBLP: Schneider-Kamp:Peter
Facilitated 1 volumes:
EdContributed to:
2015
2014
201220122011
2011
20102010
2010
20092009
20092008200720072007200620062006200420042017Wrote 24 papers:
- LATA-2015-CodishCS #game studies #network #sorting
- Sorting Networks: The End Game (MC, LCF, PSK), pp. 664–675.
- IJCAR-2014-GieslBEFFOPSSST #automation #proving #source code #termination
- Proving Termination of Programs Automatically with AProVE (JG, MB, FE, FF, CF, CO, MP, PSK, TS, SS, RT), pp. 184–191.
- IJCAR-2014-StroderGBFFHS #memory management #pointer #proving #safety #source code #termination
- Proving Termination and Memory Safety for Programs with Pointer Arithmetic (TS, JG, MB, FF, CF, JH, PSK), pp. 208–223.
- LOPSTR-2012-GieslSSEF #evaluation #graph #logic programming #source code #symbolic computation #term rewriting
- Symbolic Evaluation Graphs and Term Rewriting — A General Methodology for Analyzing Logic Programs (JG, TS, PSK, FE, CF), p. 1.
- PPDP-2012-GieslSSEF #evaluation #graph #logic programming #source code #symbolic computation #term rewriting
- Symbolic evaluation graphs and term rewriting: a general methodology for analyzing logic programs (JG, TS, PSK, FE, CF), pp. 1–12.
- LOPSTR-2011-StroderESGF #analysis #complexity #linear #prolog #semantics #termination
- A Linear Operational Semantics for Termination and Complexity Analysis of ISO Prolog (TS, FE, PSK, JG, CF), pp. 237–252.
- TACAS-2011-CodishFFS #constraints #encoding #pseudo
- Optimal Base Encodings for Pseudo-Boolean Constraints (MC, YF, CF, PSK), pp. 189–204.
- ICLP-J-2010-Schneider-KampGSST #analysis #automation #logic programming #source code #termination
- Automated termination analysis for logic programs with cut (PSK, JG, TS, AS, RT), pp. 365–381.
- LOPSTR-2010-StroderSG #analysis #dependence #logic programming #source code #termination
- Dependency Triples for Improving Termination Analysis of Logic Programs with Cut (TS, PSK, JG), pp. 184–199.
- SAT-2010-FuhsS #linear #satisfiability #source code #using
- Synthesizing Shortest Linear Straight-Line Programs over GF(2) Using SAT (CF, PSK), pp. 71–84.
- CADE-2009-SwiderskiPGFS #analysis #dependence #induction #proving #termination #theorem proving
- Termination Analysis by Dependency Pairs and Inductive Theorem Proving (SS, MP, JG, CF, PSK), pp. 322–338.
- LOPSTR-2009-Schneider-KampGN #dependence #framework #logic programming #source code #termination
- The Dependency Triple Framework for Termination of Logic Programs (PSK, JG, MTN), pp. 37–51.
- RTA-2009-FuhsGPSF #integer #proving #term rewriting #termination
- Proving Termination of Integer Term Rewriting (CF, JG, MP, PSK, SF), pp. 32–47.
- RTA-2008-FuhsGMSTZ #termination
- Maximal Termination (CF, JG, AM, PSK, RT, HZ), pp. 110–125.
- RTA-2008-ThiemannGS
- Deciding Innermost Loops (RT, JG, PSK), pp. 366–380.
- CADE-2007-GieslTSS #bound #proving #termination
- Proving Termination by Bounded Increase (JG, RT, SS, PSK), pp. 443–459.
- LOPSTR-2007-NguyenGSS #analysis #dependence #graph #logic programming #source code #termination
- Termination Analysis of Logic Programs Based on Dependency Graphs (MTN, JG, PSK, DDS), pp. 8–22.
- SAT-2007-FuhsGMSTZ #analysis #polynomial #satisfiability #termination
- SAT Solving for Termination Analysis with Polynomial Interpretations (CF, JG, AM, PSK, RT, HZ), pp. 340–354.
- IJCAR-2006-GieslST #automation #dependence #framework #proving #termination
- Automatic Termination Proofs in the Dependency Pair Framework (JG, PSK, RT), pp. 281–286.
- LOPSTR-2006-Schneider-KampGST #analysis #automation #logic programming #source code #term rewriting #termination
- Automated Termination Analysis for Logic Programs by Term Rewriting (PSK, JG, AS, RT), pp. 177–193.
- RTA-2006-GieslSST #analysis #automation #haskell #programming language #term rewriting #termination
- Automated Termination Analysis for Haskell: From Term Rewriting to Programming Languages (JG, SS, PSK, RT), pp. 297–312.
- IJCAR-2004-ThiemannGS #composition #dependence #proving #termination #using
- Improved Modular Termination Proofs Using Dependency Pairs (RT, JG, PSK), pp. 75–90.
- RTA-2004-GieslTSF #automation #proving #termination
- Automated Termination Proofs with AProVE (JG, RT, PSK, SF), pp. 210–220.
- CADE-2017-Cruz-FilipeHHKS #performance #verification
- Efficient Certified RAT Verification (LCF, MJHH, WAHJ, MK, PSK), pp. 220–236.