Travelled to:1 × Canada
1 × Germany
1 × USA
Collaborated with:J.Giesl P.Schneider-Kamp R.Thiemann M.Parting C.Fuhs
Talks about:termin (3) analysi (2) prove (2) theorem (1) program (1) languag (1) increas (1) rewrit (1) induct (1) haskel (1)
Person: Stephan Swiderski
DBLP: Swiderski:Stephan
Contributed to:
20092007
2006Wrote 3 papers:
- 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.
- CADE-2007-GieslTSS #bound #proving #termination
- Proving Termination by Bounded Increase (JG, RT, SS, PSK), pp. 443–459.
- 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.