Christian Sternagel

Journal Articles

Papers in Proceedings

Thesis

Others

Drafts

Alphabetical List of Titles

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

Valid HTML 4.01 Strict