Christian Sternagel


Journal Articles

Book Chapters

Papers in Proceedings




Alphabetical List of Titles

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

Valid XHTML 1.0!