Stephan Swiderski

According to our database, Stephan Swiderski authored at least 7 papers between 2006 and 2011.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2011

Automated termination proofs for haskell by term rewriting.

Jürgen Giesl, Matthias Raffelsieper, Peter Schneider-Kamp, Stephan Swiderski, René Thiemann

ACM Trans. Program. Lang. Syst., 2011

Proving Termination by Dependency Pairs and Inductive Theorem Proving.

Carsten Fuhs, Jürgen Giesl, Michael Parting, Peter Schneider-Kamp, Stephan Swiderski

J. Autom. Reason., 2011

2009

Inductive Theorem Proving meets Dependency Pairs.

Stephan Swiderski, Michael Parting, Jürgen Giesl, Carsten Fuhs, Peter Schneider-Kamp

Proceedings of the Interaction versus Automation: The two Faces of Deduction, 04.10., 2009

Termination Analysis by Dependency Pairs and Inductive Theorem Proving.

Stephan Swiderski, Michael Parting, Jürgen Giesl, Carsten Fuhs, Peter Schneider-Kamp

Proceedings of the Automated Deduction, 2009

2007

Termination of Programs using Term Rewriting and SAT Solving.

Jürgen Giesl, Peter Schneider-Kamp, René Thiemann, Stephan Swiderski, Manh Thang Nguyen, Danny De Schreye, Alexander Serebrenik

Proceedings of the Deduction and Decision Procedures, 30.09. - 05.10.2007, 2007

Proving Termination by Bounded Increase.

Jürgen Giesl, René Thiemann, Stephan Swiderski, Peter Schneider-Kamp

Proceedings of the Automated Deduction, 2007

2006

Automated Termination Analysis for Haskell: From Term Rewriting to Programming Languages.

Jürgen Giesl, Stephan Swiderski, Peter Schneider-Kamp, René Thiemann

Proceedings of the Term Rewriting and Applications, 17th International Conference, 2006