Cornelius Aschermann
From MaRDI portal
Person:2362489
Available identifiers
zbMath Open aschermann.corneliusMaRDI QIDQ2362489
List of research outcomes
 | This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon! |
| Publication | Date of Publication | Type |
|---|---|---|
| Lower bounds for runtime complexity of term rewriting | 2017-08-15 | Paper |
| Inferring Lower Bounds for Runtime Complexity | 2017-07-12 | Paper |
| Analyzing program termination and complexity automatically with \textsf{AProVE} | 2017-07-10 | Paper |
| Automatically proving termination and memory safety for programs with pointer arithmetic | 2017-07-10 | Paper |
Research outcomes over time
This page was built for person: Cornelius Aschermann
