Jan-Georg Smaus

According to our database1, Jan-Georg Smaus authored at least 38 papers between 1997 and 2017.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2017
An Existence Theorem of Nash Equilibrium in Coq and Isabelle.
Proceedings of the Proceedings Eighth International Symposium on Games, 2017

2015
Abstracting an Operational Semantics to Finite Automata.
Proceedings of the 11th International Conference on ICT in Education, 2015

Büchi Automata Optimisations Formalised in Isabelle/HOL.
Proceedings of the Logic and Its Applications - 6th Indian Conference, 2015

2013
A Pretty Complete Combinatorial Algorithm for the Threshold Synthesis Problem.
Proceedings of the Combinatorial Algorithms - 24th International Workshop, 2013

A Fully Verified Executable LTL Model Checker.
Proceedings of the Computer Aided Verification - 25th International Conference, 2013

2012
Implementations of two algorithms for the threshold synthesis problem.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2012

2010
Reports of the AAAI 2010 Conference Workshops.
AI Magazine, 2010

Automated Invariant Generation for the Verification of Real-Time Systems.
Proceedings of the Second International Workshop on Invariant Generation, 2010

2009
Automated Predicate Abstraction for Real-Time Models
Proceedings of the Proceedings International Workshop on Verification of Infinite-State Systems, 2009

Construction of Büchi Automata for LTL Model Checking Verified in Isabelle/HOL.
Proceedings of the Theorem Proving in Higher Order Logics, 22nd International Conference, 2009

Finding Errors of Hybrid Systems by Optimising an Abstraction-Based Quality Estimate.
Proceedings of the Tests and Proofs, Third International Conference, 2009

2008
Relaxation Refinement: A New Method to Generate Heuristic Functions.
Proceedings of the Model Checking and Artificial Intelligence, 5th International Workshop, 2008

2007
On Boolean Functions Encodable as a Single Linear Pseudo-Boolean Constraint.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2007

2006
Using Predicate Abstraction to Generate Heuristic Functions in UPPAAL.
Proceedings of the Model Checking and Artificial Intelligence, 4th Workshop, 2006

Verification-Integrated Falsification of non-Deterministic Hybrid Systems.
Proceedings of the 2nd IFAC Conference on Analysis and Design of Hybrid Systems, 2006

2004
Termination of simply moded logic programs with dynamic scheduling.
ACM Trans. Comput. Log., 2004

Characterisations of Termination in Logic Programming.
Proceedings of the Program Development in Computational Logic: A Decade of Research Advances in Logic-Based Program Development, 2004

Termination of Logic Programs Using Various Dynamic Selection Rules.
Proceedings of the Logic Programming, 20th International Conference, 2004

2003
Termination of Logic Programs for Various Dynamic Selection Rules.
Proceedings of the Logic Programming, 19th International Conference, 2003

Is There an Optimal Generic Semantics for First-Order Equations?.
Proceedings of the Logic Programming, 19th International Conference, 2003

2002
Classes of terminating logic programs.
TPLP, 2002

Subject Reduction of Logic Programs as Proof-Theoretic Property.
Journal of Functional and Logic Programming, 2002

MultiMedia Instruction in Safe and Secure Systems.
Proceedings of the Recent Trends in Algebraic Development Techniques, 2002

The Head Condition and Polymorphic Recursion.
Proceedings of the Functional and Logic Programming, 6th International Symposium, 2002

2001
Verifying Termination and Error-Freedom of Logic Programs with block Declarations.
TPLP, 2001

Analysis of Polymorphically Typed Logic Programs Using ACI-Unification.
Proceedings of the Logic for Programming, 2001

Well-Typed Logic Programs Are not Wrong.
Proceedings of the Functional and Logic Programming, 5th International Symposium, 2001

Semantics and Termination of Simply-Moded Logic Programs with Dynamic Scheduling.
Proceedings of the Programming Languages and Systems, 2001

2000
Les programmes bien typés ont tout bon.
Proceedings of the Programmation en logique avec contraintes, 2000

Using Modes to Ensure Subject Reduction for Typed Logic Programs with Subtyping.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 2000

1999
Modes and types in logic programming.
PhD thesis, 1999

Preface - Workshop on Verification of Logic Programs.
Electr. Notes Theor. Comput. Sci., 1999

Mode Analysis Domains for Typed Logic Programs.
Proceedings of the Logic Programming Synthesis and Transformation, 1999

Proving Termination of Input-Consuming Logic Programs.
Proceedings of the Logic Programming: The 1999 International Conference, Las Cruces, New Mexico, USA, November 29, 1999

Quotienting Share for Dependency Analysis.
Proceedings of the Programming Languages and Systems, 1999

1998
Termination of Logic Programs with block Declarations Running in Several Modes.
Proceedings of the Principles of Declarative Programming, 10th International Symposium, 1998

Preventing Instantiation Errors and Loops for Logic Programs with Multiple Modes Using block Declarations.
Proceedings of the Logic Programming Synthesis and Transformation, 1998

1997
Domain Construction for Mode Analysis of Typed Logic Programs.
Proceedings of the Logic Programming, 1997


  Loading...