Travelled to:1 × Belgium
1 × France
1 × India
1 × Russia
1 × Switzerland
1 × The Netherlands
1 × USA
1 × United Kingdom
2 × Japan
3 × Italy
Collaborated with:∅ A.King P.M.Hill S.Ratschan P.Deransart D.Pedreschi S.Ruggieri A.Bossi S.Etalle S.Rossi J.Esparza P.Lammich R.Neumann T.Nipkow A.Schimpf
Talks about:program (10) logic (10) termin (6) mode (5) analysi (3) dynam (3) type (3) various (2) semant (2) select (2)
Person: Jan-Georg Smaus
DBLP: Smaus:Jan=Georg
Contributed to:
2013
2009
2004
20042003
2002
20012001199919991999
199819981997Wrote 15 papers:
- CAV-2013-EsparzaLNNSS #execution #ltl #model checking
- A Fully Verified Executable LTL Model Checker (JE, PL, RN, TN, AS, JGS), pp. 463–478.
- TAP-2009-RatschanS #fault #hybrid #optimisation #quality
- Finding Errors of Hybrid Systems by Optimising an Abstraction-Based Quality Estimate (SR, JGS), pp. 153–168.
- ICLP-2004-Smaus #logic programming #source code #termination #using
- Termination of Logic Programs Using Various Dynamic Selection Rules (JGS), pp. 43–57.
- PDCL-2004-PedreschiRS #logic programming #termination
- Characterisations of Termination in Logic Programming (DP, SR, JGS), pp. 376–431.
- ICLP-2003-Smaus #equation #first-order #question #semantics
- Is There an Optimal Generic Semantics for First-Order Equations? (JGS), pp. 438–450.
- ICLP-2003-Smaus03a #logic programming #source code #termination
- Termination of Logic Programs for Various Dynamic Selection Rules (JGS), pp. 511–512.
- FLOPS-2002-Smaus #polymorphism #recursion
- The Head Condition and Polymorphic Recursion (JGS), pp. 259–274.
- ESOP-2001-BossiERS #logic programming #scheduling #semantics #source code #termination
- Semantics and Termination of Simply-Moded Logic Programs with Dynamic Scheduling (AB, SE, SR, JGS), pp. 402–416.
- FLOPS-2001-DeransartS #logic programming #source code
- Well-Typed Logic Programs Are not Wrong (PD, JGS), pp. 280–295.
- ESOP-1999-KingSH #analysis #dependence
- Quotienting Share for Dependency Analysis (AK, JGS, PMH), pp. 59–73.
- ICLP-1999-Smaus #logic programming #proving #source code #termination
- Proving Termination of Input-Consuming Logic Programs (JGS), pp. 335–349.
- LOPSTR-1999-SmausHK #analysis #logic programming #source code
- Mode Analysis Domains for Typed Logic Programs (JGS, PMH, AK), pp. 82–101.
- ALP-PLILP-1998-SmausHK #logic programming #source code #termination
- Termination of Logic Programs with block Declarations Running in Several Modes (JGS, PMH, AK), pp. 73–88.
- LOPSTR-1998-SmausHK #fault #logic programming #multi #source code #using
- Preventing Instantiation Errors and Loops for Logic Programs with Multiple Modes Using block Declarations (JGS, PMH, AK), pp. 289–307.
- ICLP-1997-SmausHK #analysis #logic programming #source code
- Domain Construction for Mode Analysis of Typed Logic Programs (JGS, PMH, AK), p. 418.