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

Search the dblp DataBase

Title:
Author:
Jan-Georg Smaus: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Annalisa Bossi, Sandro Etalle, Sabina Rossi, Jan-Georg Smaus
    Semantics and Termination of Simply-Moded Logic Programs with Dynamic Scheduling. [Citation Graph (0, 0)][DBLP]
    ESOP, 2001, pp:402-416 [Conf]
  2. Andy King, Jan-Georg Smaus, Patricia M. Hill
    Quotienting Share for Dependency Analysis. [Citation Graph (0, 0)][DBLP]
    ESOP, 1999, pp:59-73 [Conf]
  3. Pierre Deransart, Jan-Georg Smaus
    Well-Typed Logic Programs Are not Wrong. [Citation Graph (0, 0)][DBLP]
    FLOPS, 2001, pp:280-295 [Conf]
  4. Jan-Georg Smaus
    The Head Condition and Polymorphic Recursion. [Citation Graph (0, 0)][DBLP]
    FLOPS, 2002, pp:259-274 [Conf]
  5. Jan-Georg Smaus, François Fages, Pierre Deransart
    Using Modes to Ensure Subject Reduction for Typed Logic Programs with Subtyping. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2000, pp:214-226 [Conf]
  6. Jan-Georg Smaus
    Is There an Optimal Generic Semantics for First-Order Equations?. [Citation Graph (0, 0)][DBLP]
    ICLP, 2003, pp:438-450 [Conf]
  7. Jan-Georg Smaus
    Termination of Logic Programs for Various Dynamic Selection Rules. [Citation Graph (0, 0)][DBLP]
    ICLP, 2003, pp:511-512 [Conf]
  8. Jan-Georg Smaus
    Termination of Logic Programs Using Various Dynamic Selection Rules. [Citation Graph (0, 0)][DBLP]
    ICLP, 2004, pp:43-57 [Conf]
  9. Jan-Georg Smaus
    Proving Termination of Input-Consuming Logic Programs. [Citation Graph (0, 0)][DBLP]
    ICLP, 1999, pp:335-349 [Conf]
  10. Jan-Georg Smaus, Patricia M. Hill, Andy King
    Domain Construction for Mode Analysis of Typed Logic Programs. [Citation Graph (0, 0)][DBLP]
    ICLP, 1997, pp:418- [Conf]
  11. Pierre Deransart, Jan-Georg Smaus
    Les programmes bien typés ont tout bon. [Citation Graph (0, 0)][DBLP]
    JFPLC, 2000, pp:49-66 [Conf]
  12. Dino Pedreschi, Salvatore Ruggieri, Jan-Georg Smaus
    Characterisations of Termination in Logic Programming. [Citation Graph (0, 0)][DBLP]
    Program Development in Computational Logic, 2004, pp:376-431 [Conf]
  13. Jan-Georg Smaus, Patricia M. Hill, Andy King
    Preventing Instantiation Errors and Loops for Logic Programs with Multiple Modes Using block Declarations. [Citation Graph (0, 0)][DBLP]
    LOPSTR, 1998, pp:289-307 [Conf]
  14. Jan-Georg Smaus, Patricia M. Hill, Andy King
    Mode Analysis Domains for Typed Logic Programs. [Citation Graph (0, 0)][DBLP]
    LOPSTR, 1999, pp:82-101 [Conf]
  15. Jan-Georg Smaus
    Analysis of Polymorphically Typed Logic Programs Using ACI-Unification. [Citation Graph (0, 0)][DBLP]
    LPAR, 2001, pp:282-298 [Conf]
  16. Jan-Georg Smaus, Patricia M. Hill, Andy King
    Termination of Logic Programs with block Declarations Running in Several Modes. [Citation Graph (0, 0)][DBLP]
    PLILP/ALP, 1998, pp:73-88 [Conf]
  17. Bernd Krieg-Brückner, Dieter Hutter, Arne Lindow, Christoph Lüth, Achim Mahnke, Erica Melis, Philipp Meier, Arnd Poetzsch-Heffter, Markus Roggenbach, George Russell, Jan-Georg Smaus, Martin Wirsing
    MultiMedia Instruction in Safe and Secure Systems. [Citation Graph (0, 0)][DBLP]
    WADT, 2002, pp:82-117 [Conf]
  18. Jan-Georg Smaus, Patricia M. Hill, Andy King
    Verifying Termination and Error-Freedom of Logic Programs with block Declarations [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  19. Jan-Georg Smaus, François Fages, Pierre Deransart
    Using Modes to Ensure Subject Reduction for Typed Logic Programs with Subtyping [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  20. Pierre Deransart, Jan-Georg Smaus
    Well-Typed Logic Programs Are not Wrong [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  21. Annalisa Bossi, Sandro Etalle, Sabina Rossi, Jan-Georg Smaus
    Semantics and Termination of Simply-Moded Logic Programs with Dynamic Scheduling [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  22. Jan-Georg Smaus
    Analysis of Polymorphically Typed Logic Programs Using ACI-Unification [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  23. Dino Pedreschi, Salvatore Ruggieri, Jan-Georg Smaus
    Classes of Terminating Logic Programs [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  24. Pierre Deransart, Jan-Georg Smaus
    Subject Reduction of Logic Programs as Proof-Theoretic Property. [Citation Graph (0, 0)][DBLP]
    Journal of Functional and Logic Programming, 2002, v:2002, n:, pp:- [Journal]
  25. Sandro Etalle, Jan-Georg Smaus
    Preface - Workshop on Verification of Logic Programs. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1999, v:30, n:1, pp:- [Journal]
  26. Annalisa Bossi, Sandro Etalle, Sabina Rossi, Jan-Georg Smaus
    Termination of simply moded logic programs with dynamic scheduling. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Comput. Log., 2004, v:5, n:3, pp:470-507 [Journal]
  27. Dino Pedreschi, Salvatore Ruggieri, Jan-Georg Smaus
    Classes of terminating logic programs. [Citation Graph (0, 0)][DBLP]
    TPLP, 2002, v:2, n:3, pp:369-418 [Journal]
  28. Jan-Georg Smaus, Patricia M. Hill, Andy King
    Verifying Termination and Error-Freedom of Logic Programs with block Declarations. [Citation Graph (0, 0)][DBLP]
    TPLP, 2001, v:1, n:4, pp:447-486 [Journal]
  29. Jan-Georg Smaus
    On Boolean Functions Encodable as a Single Linear Pseudo-Boolean Constraint. [Citation Graph (0, 0)][DBLP]
    CPAIOR, 2007, pp:288-302 [Conf]
  30. Jörg Hoffmann, Jan-Georg Smaus, Andrey Rybalchenko, Sebastian Kupferschmid, Andreas Podelski
    Using Predicate Abstraction to Generate Heuristic Functions in UPPAAL. [Citation Graph (0, 0)][DBLP]
    MoChArt, 2006, pp:51-66 [Conf]

  31. Construction of Büchi Automata for LTL Model Checking Verified in Isabelle/HOL. [Citation Graph (, )][DBLP]


  32. Finding Errors of Hybrid Systems by Optimising an Abstraction-Based Quality Estimate. [Citation Graph (, )][DBLP]


  33. Relaxation Refinement: A New Method to Generate Heuristic Functions. [Citation Graph (, )][DBLP]


  34. Automated Predicate Abstraction for Real-Time Models [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.006secs
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