Fabian Meyer ▲ Sign in to save

• KoAT: Automatic Complexity and Termination Analysis of Integer Programs

  2026 arXiv (Cornell University) preprint Computer Science Logic, programming, and type systems Open access

  0

  citations
• KoAT: Automatic Complexity and Termination Analysis of Integer Programs

  2026 arXiv (Cornell University) preprint Computer Science Logic, programming, and type systems Open access

  0

  citations
• Targeting Completeness: Automated Complexity Analysis of Integer Programs

  2026 Journal of Automated Reasoning article Computer Science Logic, programming, and type systems Open access

  4

  citations
• KoAT: Automatic Complexity and Termination Analysis of Integer Programs

  2026 Zenodo (CERN European Organization for Nuclear Research) software Computer Science Logic, programming, and type systems Open access

  1

  citations
• KoAT: Automatic Complexity and Termination Analysis of Integer Programs

  2026 Zenodo (CERN European Organization for Nuclear Research) software Computer Science Logic, programming, and type systems Open access

  0

  citations
• KoAT: Automatic Complexity and Termination Analysis of Integer Programs

  2026 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems Open access

  0

  citations
• Deciding Termination of Simple Randomized Loops

  2025 Leibniz international proceedings in informatics article Computer Science Logic, programming, and type systems Open access

  0

  citations
• Control-Flow Refinement for Complexity Analysis of Probabilistic Programs in KoAT

  2024 arXiv (Cornell University) preprint 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
• Automatic Complexity Analysis of Integer Programs via Triangular Weakly Non-Linear Loops

  2022 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems Open access

  7

  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

13 results