The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Stephan Swiderski: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Jürgen Giesl, Stephan Swiderski, Peter Schneider-Kamp, René Thiemann
    Automated Termination Analysis for Haskell: From Term Rewriting to Programming Languages. [Citation Graph (0, 0)][DBLP]
    RTA, 2006, pp:297-312 [Conf]
  2. Jürgen Giesl, René Thiemann, Stephan Swiderski, Peter Schneider-Kamp
    Proving Termination by Bounded Increase. [Citation Graph (0, 0)][DBLP]
    CADE, 2007, pp:443-459 [Conf]

  3. Termination Analysis by Dependency Pairs and Inductive Theorem Proving. [Citation Graph (, )][DBLP]


  4. Termination of Programs using Term Rewriting and SAT Solving. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.002secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002