Jan-Georg Smaus - researchr profile publications

researchr

You are not signed in
Sign in
Sign up

Publications with a 'Jan-Georg Smaus' as author, editor, or advisor:

Characterisations of Termination in Logic ProgrammingDino Pedreschi, Salvatore Ruggieri, Jan-Georg Smaus. LOPSTR 2004: 376-431 [doi]
Termination of Logic Programs with block Declarations Running in Several ModesJan-Georg Smaus, Patricia M. Hill, Andy King. plilp 1998: 73-88 [doi]
Abstracting an Operational Semantics to Finite AutomataNadezhda Baklanova, Wilmer Ricciotti, Jan-Georg Smaus, Martin Strecker. icteri 2015: 354-365 [doi]
Büchi Automata Optimisations Formalised in Isabelle/HOLAlexander Schimpf, Jan-Georg Smaus. icla 2015: 158-169 [doi]
Termination of simply moded logic programs with dynamic schedulingAnnalisa Bossi, Sandro Etalle, Sabina Rossi, Jan-Georg Smaus. tocl, 5(3):470-507, 2004. [doi]
Verification-Integrated Falsification of non-Deterministic Hybrid SystemsStefan Ratschan, Jan-Georg Smaus. adhs 2006: 371-376 [doi]
Automated Invariant Generation for the Verification of Real-Time SystemsBahareh Badban, Stefan Leue, Jan-Georg Smaus. cade 2012: 44-58 [doi]
A Fully Verified Executable LTL Model CheckerJavier Esparza, Peter Lammich, René Neumann, Tobias Nipkow, Alexander Schimpf, Jan-Georg Smaus. afp, 2014, 2014. [doi]
Finding Errors of Hybrid Systems by Optimising an Abstraction-Based Quality EstimateStefan Ratschan, Jan-Georg Smaus. tap 2009: 153-168 [doi]
(no title)Jan-Georg Smaus, Patricia M. Hill, Andy King. tplp, 1(4):447-486, 2001.
Les programmes bien typés ont tout bonPierre Deransart, Jan-Georg Smaus. jfplc 2000: 49-66
Using Predicate Abstraction to Generate Heuristic Functions in UPPAALJörg Hoffmann, Jan-Georg Smaus, Andrey Rybalchenko, Sebastian Kupferschmid, Andreas Podelski. mochart 2007: 51-66 [doi]
Subject Reduction of Logic Programs as Proof-Theoretic PropertyPierre Deransart, Jan-Georg Smaus. jflp, 2002, 2002. [doi]
Reports of the AAAI 2010 Conference WorkshopsDavid W. Aha, Mark S. Boddy, Vadim Bulitko, Artur S. d Avila Garcez, Prashant Doshi, Stefan Edelkamp, Christopher W. Geib, Piotr J. Gmytrasiewicz, Robert P. Goldman, Pascal Hitzler, Charles L. Isbell, Darsana P. Josyula, Leslie Pack Kaelbling, Kristian Kersting, Maithilee Kunda, Luís C. Lamb, Bhaskara Marthi, Keith McGreggor, Vivi Nastase, Gregory Provan, Anita Raja, Ashwin Ram, Mark O. Riedl, Stuart J. Russell, Ashish Sabharwal, Jan-Georg Smaus, Gita Sukthankar, Karl Tuyls, Ron van der Meyden, Alon Y. Halevy, Lilyana Mihalkova, Sriraam Natarajan. aim, 31(4):95-108, 2010. [doi]
Quotienting ::::Share:::: for Dependency AnalysisAndy King, Jan-Georg Smaus, Patricia M. Hill. ESOP 1999: 59-73 [doi]
Modes and types in logic programmingJan-Georg Smaus. PhD thesis, University of Kent, UK, 1999. [doi]
Relaxation Refinement: A New Method to Generate Heuristic FunctionsJan-Georg Smaus, Jörg Hoffmann. mochart 2009: 147-165 [doi]
Termination of Logic Programs Using Various Dynamic Selection RulesJan-Georg Smaus. ICLP 2004: 43-57 [doi]
Model Checking and Artificial Intelligence - 6th International Workshop, MoChArt 2010, Atlanta, GA, USA, July 11, 2010, Revised Selected and Invited PapersRon van der Meyden, Jan-Georg Smaus, editors, Volume 6572 of Lecture Notes in Computer Science, Springer, 2011. [doi]
A Fully Verified Executable LTL Model CheckerJavier Esparza, Peter Lammich, René Neumann, Tobias Nipkow, Alexander Schimpf, Jan-Georg Smaus. cav 2013: 463-478 [doi]
A Pretty Complete Combinatorial Algorithm for the Threshold Synthesis ProblemChristian Schilling, Jan-Georg Smaus, Fabian Wenzelmann. iwoca 2013: 458-462 [doi]
Termination of Logic Programs for Various Dynamic Selection RulesJan-Georg Smaus. ICLP 2003: 511-512 [doi]
Classes of terminating logic programsDino Pedreschi, Salvatore Ruggieri, Jan-Georg Smaus. tplp, 2(3):369-418, 2002.
On Boolean Functions Encodable as a Single Linear Pseudo-Boolean ConstraintJan-Georg Smaus. cpaior 2007: 288-302 [doi]
Preventing Instantiation Errors and Loops for Logic Programs with Multiple Modes Using block DeclarationsJan-Georg Smaus, Patricia M. Hill, Andy King. LOPSTR 1990: 289-307 [doi]
Well-Typed Logic Programs Are not WrongPierre Deransart, Jan-Georg Smaus. FLOPS 2001: 280-295 [doi]
Semantics and Termination of Simply-Moded Logic Programs with Dynamic SchedulingAnnalisa Bossi, Sandro Etalle, Sabina Rossi, Jan-Georg Smaus. ESOP 2001: 402-416 [doi]
Using Modes to Ensure Subject Reduction for Typed Logic Programs with SubtypingJan-Georg Smaus, François Fages, Pierre Deransart. fsttcs 2000: 214-226 [doi]
Analysis of Polymorphically Typed Logic Programs Using ACI-UnificationJan-Georg Smaus. lpar 2001: 282-298 [doi]
Domain Construction for Mode Analysis of Typed Logic ProgramsJan-Georg Smaus, Patricia M. Hill, Andy King. ICLP 1997: 418
The Head Condition and Polymorphic RecursionJan-Georg Smaus. FLOPS 2002: 259-274 [doi]
MultiMedia Instruction in Safe and Secure SystemsBernd 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. WADT 2003: 82-117 [doi]
Is There an Optimal Generic Semantics for First-Order Equations?Jan-Georg Smaus. ICLP 2003: 438-450 [doi]
Workshop on Verification of Logic Programs 1999, in connection with the International Conference on Logic Programming, ICLP 1999, Las Cruces, New Mexico, USA, December 1, 1999Sandro Etalle, Jan-Georg Smaus, editors, Volume 30 of Electronic Notes in Theoretical Computer Science, Elsevier, 1999. [doi]
Preface - Workshop on Verification of Logic ProgramsSandro Etalle, Jan-Georg Smaus. TCS, 30(1):125, 1999. [doi]
Implementations of two algorithms for the threshold synthesis problemJan-Georg Smaus, Christian Schilling, Fabian Wenzelmann. isaim 2012: [doi]
Abstracting an Operational Semantics to Finite AutomataNadezhda Baklanova, Wilmer Ricciotti, Jan-Georg Smaus, Martin Strecker. icteri 2016: 109-123 [doi]
Construction of BÃ¼chi Automata for LTL Model Checking Verified in Isabelle/HOLAlexander Schimpf, Stephan Merz, Jan-Georg Smaus. tphol 2009: 424-439 [doi]
Mode Analysis Domains for Typed Logic ProgramsJan-Georg Smaus, Patricia M. Hill, Andy King. LOPSTR 2000: 82-101
Proving Termination of Input-Consuming Logic ProgramsJan-Georg Smaus. ICLP 1999: 335-349

runs on WebDSL