An inversion tool for conditional term rewriting systems - a case study of Ackermann inversion
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research
Documents
- Fulltext
Final published version, 588 KB, PDF document
We report on an inversion tool for a class of oriented conditional constructor term rewriting systems. Four well-behaved rule inverters ranging from trivial to full, partial and semi-inverters are included. Conditional term rewriting systems are theoretically well founded and can model functional and non-functional rewrite relations. We illustrate the inversion by experiments with full and partial inversions of the Ackermann function. The case study demonstrates, among others, that polyvariant inversion and input-output set propagation can reduce the search space of the generated inverse systems.
Original language | English |
---|---|
Title of host publication | Proceedings of the 9th International Workshop on Verification and Program Transformation |
Editors | Alexei Lisitsa, Andrei P. Nemytykh |
Number of pages | 9 |
Publisher | arxiv.org |
Publication date | 2021 |
Pages | 33-41 |
DOIs | |
Publication status | Published - 2021 |
Event | 9th International Workshop on Verification and Program Transformation - Luxembourg, Luxembourg Duration: 27 Mar 2021 → 28 Mar 2021 |
Conference
Conference | 9th International Workshop on Verification and Program Transformation |
---|---|
Land | Luxembourg |
By | Luxembourg |
Periode | 27/03/2021 → 28/03/2021 |
Series | Electronic Proceedings in Theoretical Computer Science, EPTCS |
---|---|
Volume | 341 |
ISSN | 2075-2180 |
Number of downloads are based on statistics from Google Scholar and www.ku.dk
No data available
ID: 287766763