A Aralex Aachen research explorer

March 02, 2013 article

Analyzing Innermost Runtime Complexity of Term Rewriting by Dependency Pairs

Journal of Automated Reasoning

DOI: 10.1007/s10817-013-9277-6 OpenAlex

Authors 0

Author list not loaded yet.

Cited by 5 stored of 49

Dependency Pairs for Expected Innermost Runtime Complexity and Strong Almost-Sure Termination of Probabilistic Term Rewriting
2025 International Symposium on Principles and Practice of Declarative Programming (PPDP) conference-paper Computer Science Logic, programming, and type systems Open access

1

citations
Control-Flow Refinement for Complexity Analysis of Probabilistic Programs in KoAT (Short Paper)
2024 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems Open access

6

citations
Improving Automatic Complexity Analysis of Integer Programs
2022 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems

10

citations
Inferring Expected Runtimes of Probabilistic Integer Programs Using Expected Sizes
2021 other Computer Science Logic, programming, and type systems

2

citations
Inferring Expected Runtimes of Probabilistic Integer Programs Using Expected Sizes
2021 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems Open access

20

citations

5 results

References 0