Data-driven runtime complexity analysis

DOI10.1007/978-3-032-04167-8_13MaRDI QIDQ6852311zbMATH OpenFDO

Authors Samuel Frontull, Manuel Meitinger, Ggraph-embeddedeorg Moser

Publication date 26 February 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/978-3-032-04167-8_13

zbMATH Keywords

automationcomplexity analysismachine learningterm rewriting

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Logic in artificial intelligence (68T27) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Cites work

• A new recursion-theoretic characterization of the polytime functions
• Amortised resource analysis and typed polynomial interpretations
• Analysing the complexity of functional programs: higher-order meets first-order
• Analyzing innermost runtime complexity of term rewriting by dependency pairs
• Analyzing program termination and complexity automatically with \textsf{AProVE}
• ATLAS: automated amortised complexity analysis of self-adjusting data structures
• Automated Complexity Analysis Based on the Dependency Pair Method
• Complexity of acyclic term graph rewriting
• Control-flow refinement for complexity analysis of probabilistic programs in \textsf{KoAT} (short paper)
• Foundations of machine learning
• scientific article; zbMATH DE number 3658896 (Why is no real title available?)
• scientific article; zbMATH DE number 1889386 (Why is no real title available?)
• Lower bounds for runtime complexity of term rewriting
• Machine learning. A probabilistic perspective
• Multivariate amortised resource analysis for term rewrite systems
• Pattern recognition and machine learning.
• Runtime complexity analysis of logically constrained rewriting
• Term Rewriting and All That
• Termination of term rewriting using dependency pairs
• Termination proofs and the length of derivations
• The integration of functions into logic programming: From theory to practice
• Tools and algorithms for the construction and analysis of systems. 22nd international conference, TACAS 2016, held as part of the European joint conferences on theory and practice of software, ETAPS 2016, Eindhoven, The Netherlands, April 2--8, 2016. Proc
• Towards automatic resource bound analysis for OCaml
• Two decades of automatic amortized resource analysis
• Type-based analysis of logarithmic amortised complexity
• Understanding machine learning. From theory to algorithms

This page was built for publication: Data-driven runtime complexity analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6852311)