214 results on '"René Thiemann"'
Search Results
52. Linear Inequalities.
53. LIPIcs, Volume 268, ITP 2023, Complete Volume
54. Front Matter, Table of Contents, Preface, Conference Organization
55. Reachability Analysis with State-Compatible Automata.
56. Formalizing Monotone Algebras for Certification of Termination and Complexity Proofs.
57. Proving Termination of Programs Automatically with AProVE.
58. Certification of Nontermination Proofs Using Strategies and Nonlooping Derivations.
59. Formalizing Bounded Increase.
60. Formalizing Knuth-Bendix Orders and Knuth-Bendix Completion.
61. Certification of Nontermination Proofs.
62. On the Formalization of Termination Techniques based on Multiset Orderings.
63. Termination of Isabelle Functions via Termination of Rewriting.
64. Modular and Certified Semantic Labeling and Unlabeling.
65. Generalized and Formalized Uncurrying.
66. An Incremental Simplex Algorithm with Unsatisfiable Core Generation.
67. A verified factorization algorithm for integer polynomials with polynomial complexity.
68. A verified LLL algorithm.
69. First-Order Terms.
70. Certified Subterm Criterion and Certified Usable Rules.
71. Signature Extensions Preserve Termination - An Alternative Proof via Dependency Pairs.
72. Logical and Semantic Frameworks with Applications.
73. From Outermost Termination to Innermost Termination.
74. Loops under Strategies.
75. Certification of Termination Proofs Using CeTA.
76. Maximal Termination.
77. Deciding Innermost Loops.
78. Improving Context-Sensitive Dependency Pairs.
79. Proving Termination by Bounded Increase.
80. SAT Solving for Termination Analysis with Polynomial Interpretations.
81. Proving Termination Using Recursive Path Orders and SAT Solving.
82. Automated Termination Analysis for Haskell: From Term Rewriting to Programming Languages.
83. Automatic Termination Proofs in the Dependency Pair Framework.
84. SAT Solving for Argument Filterings.
85. Automated Termination Analysis for Logic Programs by Term Rewriting.
86. Proving and Disproving Termination of Higher-Order Functions.
87. Automated Termination Proofs with AProVE.
88. Improved Modular Termination Proofs Using Dependency Pairs.
89. The Dependency Pair Framework: Combining Techniques for Automated Termination Proofs.
90. A Framework for Developing Stand-Alone Certifiers.
91. Size-Change Termination for Term Rewriting.
92. Improving Dependency Pairs.
93. Stochastic Matrices and the Perron-Frobenius Theorem.
94. Subresultants.
95. SAT Solving for Termination Proofs with Recursive Path Orders and Dependency Pairs.
96. Automated termination proofs for haskell by term rewriting.
97. Automated termination analysis for logic programs with cut.
98. Automated termination proofs for logic programs by term rewriting.
99. Is our self based on reward? Self-relatedness recruits neural activity in the reward system.
100. Adding constants to string rewriting.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.