Christian Sternagel

Journal Articles

Papers in Proceedings




Alphabetical List of Titles

  1. A Characterization of Quasi-Decreasingness
  2. A Framework for Developing Stand-Alone Certifiers
  3. A Haskell Library for Term Rewriting
  4. A Locale for Minimal Bad Sequences
  5. A New and Formalized Proof of Abstract Completion
  6. A Relative Dependency Pair Framework
  7. A Short Mechanized Proof of the Church-Rosser Theorem by the Z-property for the λβ-calculus in Nominal Isabelle
  8. AC Dependency Pairs Revisited
  9. Abstract Rewriting
  10. Automatic Certification of Termination Proofs
  11. CeTA - A Tool for Certified Termination Analysis
  12. Certification Monads
  13. Certification extends Termination Techniques
  14. Certification of Complexity Proofs using CeTA
  15. Certification of Nontermination Proofs
  16. Certification of Termination Proofs using CeTA
  17. Certified HLints with Isabelle/HOLCF-Prelude
  18. Certified Kruskal's Tree Theorem
  19. Certified Kruskal's Tree Theorem
  20. Certified Non-Confluence with ConCon 1.5
  21. Certified Subterm Criterion and Certified Usable Rules
  22. Certifying Confluence of Almost Orthogonal CTRSs via Exact Tree Automata Completion
  23. Certifying Confluence of Quasi-Decreasing Strongly Deterministic Conditional Term Rewrite Systems
  24. CoCo 2015 Participant: CeTA 2.21
  25. CoCo 2016 Participant: CeTA 2.28
  26. CoCo 2017 Participant: CeTA 2.31
  27. Deriving Comparators and Show Functions in Isabelle/HOL
  28. Deriving class instances for datatypes
  29. Efficient Mergesort
  30. Executable Matrix Operations on Matrices of Arbitrary Dimensions
  31. Executable Multivariate Polynomials
  32. Executable Transitive Closures of Finite Relations
  33. Finding and Certifying Loops
  34. First-Order Terms
  35. Formalized Confluence of Quasi-Decreasing, Strongly Deterministic Conditional TRSs
  36. Formalized Ground Completion
  37. Formalizing Knuth-Bendix Orders and Knuth-Bendix Completion
  38. Formalizing Monotone Algebras for Certification of Termination and Complexity Proofs
  39. Foundational (Co)datatypes and (Co)recursion for Higher-Order Logic
  40. Generalized and Formalized Uncurrying
  41. Getting Started with Isabelle/jEdit
  42. HOLCF-Prelude
  43. Haskell's Show Class in Isabelle/HOL
  44. Homogeneous Linear Diophantine Equations
  45. Imperative Insertion Sort
  46. Infinite Runs in Abstract Completion
  47. Level-Confluence of 3-CTRSs in Isabelle/HOL
  48. Loops under Strategies
  49. Loops under Strategies ... Continued
  50. Loops under Strategies ... Continued
  51. Modular and Certified Semantic Labeling and Unlabeling
  52. Normalization Equivalence of Rewrite Systems
  53. Open Induction
  54. Proof Pearl - A Mechanized Proof of GHC's Mergesort
  55. Recording Completion for Finding and Certifying Proofs in Equational Logic
  56. Root-Labeling
  57. Signature Extensions Preserve Termination - An Alternative Proof via Dependency Pairs
  58. TTT2 @ TermComp'2016
  59. Termination of Isabelle Functions via Termination of Rewriting
  60. The Certification Problem Format
  61. The Generalized Subterm Criterion in TTT2
  62. The Z Property
  63. Transforming SAT into Termination of Rewriting
  64. Tyrolean Termination Tool 2
  65. Well-Quasi-Orders
  66. Xml

Valid HTML 4.01 Strict