dblp.uni-trier.dewww.uni-trier.de

Jan-Georg Smaus Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

*2009
33EEStefan Ratschan, Jan-Georg Smaus: Finding Errors of Hybrid Systems by Optimising an Abstraction-Based Quality Estimate. TAP 2009: 153-168
32EEAlexander Schimpf, Stephan Merz, Jan-Georg Smaus: Construction of Büchi Automata for LTL Model Checking Verified in Isabelle/HOL. TPHOLs 2009: 424-439
2008
31EEJan-Georg Smaus, Jörg Hoffmann: Relaxation Refinement: A New Method to Generate Heuristic Functions. MoChArt 2008: 147-165
2007
30EEJan-Georg Smaus: On Boolean Functions Encodable as a Single Linear Pseudo-Boolean Constraint. CPAIOR 2007: 288-302
2006
29EEJörg Hoffmann, Jan-Georg Smaus, Andrey Rybalchenko, Sebastian Kupferschmid, Andreas Podelski: Using Predicate Abstraction to Generate Heuristic Functions in UPPAAL. MoChArt 2006: 51-66
2004
28EEJan-Georg Smaus: Termination of Logic Programs Using Various Dynamic Selection Rules. ICLP 2004: 43-57
27EEDino Pedreschi, Salvatore Ruggieri, Jan-Georg Smaus: Characterisations of Termination in Logic Programming. Program Development in Computational Logic 2004: 376-431
26EEAnnalisa Bossi, Sandro Etalle, Sabina Rossi, Jan-Georg Smaus: Termination of simply moded logic programs with dynamic scheduling. ACM Trans. Comput. Log. 5(3): 470-507 (2004)
2003
25EEJan-Georg Smaus: Is There an Optimal Generic Semantics for First-Order Equations?. ICLP 2003: 438-450
24EEJan-Georg Smaus: Termination of Logic Programs for Various Dynamic Selection Rules. ICLP 2003: 511-512
2002
23EEJan-Georg Smaus: The Head Condition and Polymorphic Recursion. FLOPS 2002: 259-274
22EEBernd 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. WADT 2002: 82-117
21EEPierre Deransart, Jan-Georg Smaus: Subject Reduction of Logic Programs as Proof-Theoretic Property. Journal of Functional and Logic Programming 2002: (2002)
20 Dino Pedreschi, Salvatore Ruggieri, Jan-Georg Smaus: Classes of terminating logic programs. TPLP 2(3): 369-418 (2002)
2001
19EEAnnalisa Bossi, Sandro Etalle, Sabina Rossi, Jan-Georg Smaus: Semantics and Termination of Simply-Moded Logic Programs with Dynamic Scheduling. ESOP 2001: 402-416
18EEPierre Deransart, Jan-Georg Smaus: Well-Typed Logic Programs Are not Wrong. FLOPS 2001: 280-295
17EEJan-Georg Smaus: Analysis of Polymorphically Typed Logic Programs Using ACI-Unification. LPAR 2001: 282-298
16EEAnnalisa Bossi, Sandro Etalle, Sabina Rossi, Jan-Georg Smaus: Semantics and Termination of Simply-Moded Logic Programs with Dynamic Scheduling CoRR cs.LO/0101022: (2001)
15EEJan-Georg Smaus: Analysis of Polymorphically Typed Logic Programs Using ACI-Unification CoRR cs.LO/0105007: (2001)
14EEDino Pedreschi, Salvatore Ruggieri, Jan-Georg Smaus: Classes of Terminating Logic Programs CoRR cs.LO/0106050: (2001)
13 Jan-Georg Smaus, Patricia M. Hill, Andy King: Verifying Termination and Error-Freedom of Logic Programs with block Declarations. TPLP 1(4): 447-486 (2001)
2000
12EEJan-Georg Smaus, François Fages, Pierre Deransart: Using Modes to Ensure Subject Reduction for Typed Logic Programs with Subtyping. FSTTCS 2000: 214-226
11 Pierre Deransart, Jan-Georg Smaus: Les programmes bien typés ont tout bon. JFPLC 2000: 49-66
10EEJan-Georg Smaus, Patricia M. Hill, Andy King: Verifying Termination and Error-Freedom of Logic Programs with block Declarations CoRR cs.LO/0006033: (2000)
9EEJan-Georg Smaus, François Fages, Pierre Deransart: Using Modes to Ensure Subject Reduction for Typed Logic Programs with Subtyping CoRR cs.LO/0010029: (2000)
8EEPierre Deransart, Jan-Georg Smaus: Well-Typed Logic Programs Are not Wrong CoRR cs.LO/0012015: (2000)
1999
7EEAndy King, Jan-Georg Smaus, Patricia M. Hill: Quotienting Share for Dependency Analysis. ESOP 1999: 59-73
6 Jan-Georg Smaus: Proving Termination of Input-Consuming Logic Programs. ICLP 1999: 335-349
5 Jan-Georg Smaus, Patricia M. Hill, Andy King: Mode Analysis Domains for Typed Logic Programs. LOPSTR 1999: 82-101
4EESandro Etalle, Jan-Georg Smaus: Preface - Workshop on Verification of Logic Programs. Electr. Notes Theor. Comput. Sci. 30(1): (1999)
1998
3EEJan-Georg Smaus, Patricia M. Hill, Andy King: Preventing Instantiation Errors and Loops for Logic Programs with Multiple Modes Using block Declarations. LOPSTR 1998: 289-307
2EEJan-Georg Smaus, Patricia M. Hill, Andy King: Termination of Logic Programs with block Declarations Running in Several Modes. PLILP/ALP 1998: 73-88
1997
1 Jan-Georg Smaus, Patricia M. Hill, Andy King: Domain Construction for Mode Analysis of Typed Logic Programs. ICLP 1997: 418

Coauthor Index

1Annalisa Bossi [16] [19] [26]
2Pierre Deransart [8] [9] [11] [12] [18] [21]
3Sandro Etalle [4] [16] [19] [26]
4François Fages [9] [12]
5Patricia M. Hill [1] [2] [3] [5] [7] [10] [13]
6Jörg Hoffmann [29] [31]
7Dieter Hutter [22]
8Andy King [1] [2] [3] [5] [7] [10] [13]
9Bernd Krieg-Brückner [22]
10Sebastian Kupferschmid [29]
11Arne Lindow [22]
12Christoph Lüth [22]
13Achim Mahnke [22]
14Philipp Meier [22]
15Erica Melis [22]
16Stephan Merz [32]
17Dino Pedreschi [14] [20] [27]
18Andreas Podelski [29]
19Arnd Poetzsch-Heffter [22]
20Stefan Ratschan [33]
21Markus Roggenbach [22]
22Sabina Rossi [16] [19] [26]
23Salvatore Ruggieri [14] [20] [27]
24George Russell [22]
25Andrey Rybalchenko [29]
26Alexander Schimpf [32]
27Martin Wirsing [22]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)