Reverse Universal Resolving Algorithm and inverse driving

Research output: Contribution to journal › Conference article › Research › peer-review

Standard

Reverse Universal Resolving Algorithm and inverse driving. / Pécseli, Thomas.

In: Journal of Logic and Algebraic Programming, Vol. 81, No. 3, 2012, p. 314-330.

Research output: Contribution to journal › Conference article › Research › peer-review

Harvard

Pécseli, T 2012, 'Reverse Universal Resolving Algorithm and inverse driving', Journal of Logic and Algebraic Programming, vol. 81, no. 3, pp. 314-330. https://doi.org/10.1016/j.jlap.2011.12.002

APA

Pécseli, T. (2012). Reverse Universal Resolving Algorithm and inverse driving. Journal of Logic and Algebraic Programming, 81(3), 314-330. https://doi.org/10.1016/j.jlap.2011.12.002

Vancouver

Pécseli T. Reverse Universal Resolving Algorithm and inverse driving. Journal of Logic and Algebraic Programming. 2012;81(3):314-330. https://doi.org/10.1016/j.jlap.2011.12.002

Author

Pécseli, Thomas. / Reverse Universal Resolving Algorithm and inverse driving. In: Journal of Logic and Algebraic Programming. 2012 ; Vol. 81, No. 3. pp. 314-330.

Bibtex

@inproceedings{697a2477bf5b43bd90e60d81ca79c375,
title = "Reverse Universal Resolving Algorithm and inverse driving",
abstract = "Inverse interpretation is a semantics based, non-standard interpretation of programs. Given a program and a value, an inverse interpreter finds all or one of the inputs, that would yield the given value as output with normal forward evaluation. The Reverse Universal Resolving Algorithm is a new variant of the Universal Resolving Algorithm for inverse interpretation. The new variant outperforms the original algorithm in several cases, e.g., when unpacking a list using inverse interpretation of a pack program. It uses inverse driving as its main technique, which has not been described in detail before. Inverse driving may find application with, e.g., supercompilation, thus suggesting a new kind of program inverter.",
keywords = "Driving, Flowchart programming, Inverse driving, Inverse interpretation, Reverse URA, Supercompilation",
author = "Thomas P{\'e}cseli",
year = "2012",
doi = "10.1016/j.jlap.2011.12.002",
language = "English",
volume = "81",
pages = "314--330",
journal = "Journal of Logic and Algebraic Programming",
issn = "2352-2208",
publisher = "Elsevier",
number = "3",
note = "null ; Conference date: 10-11-2010 Through 12-11-2010",

}

RIS

TY - GEN

T1 - Reverse Universal Resolving Algorithm and inverse driving

AU - Pécseli, Thomas

N1 - Conference code: 22

PY - 2012

Y1 - 2012

N2 - Inverse interpretation is a semantics based, non-standard interpretation of programs. Given a program and a value, an inverse interpreter finds all or one of the inputs, that would yield the given value as output with normal forward evaluation. The Reverse Universal Resolving Algorithm is a new variant of the Universal Resolving Algorithm for inverse interpretation. The new variant outperforms the original algorithm in several cases, e.g., when unpacking a list using inverse interpretation of a pack program. It uses inverse driving as its main technique, which has not been described in detail before. Inverse driving may find application with, e.g., supercompilation, thus suggesting a new kind of program inverter.

AB - Inverse interpretation is a semantics based, non-standard interpretation of programs. Given a program and a value, an inverse interpreter finds all or one of the inputs, that would yield the given value as output with normal forward evaluation. The Reverse Universal Resolving Algorithm is a new variant of the Universal Resolving Algorithm for inverse interpretation. The new variant outperforms the original algorithm in several cases, e.g., when unpacking a list using inverse interpretation of a pack program. It uses inverse driving as its main technique, which has not been described in detail before. Inverse driving may find application with, e.g., supercompilation, thus suggesting a new kind of program inverter.

KW - Driving

KW - Flowchart programming

KW - Inverse driving

KW - Inverse interpretation

KW - Reverse URA

KW - Supercompilation

UR - http://www.scopus.com/inward/record.url?scp=84858081015&partnerID=8YFLogxK

U2 - 10.1016/j.jlap.2011.12.002

DO - 10.1016/j.jlap.2011.12.002

M3 - Conference article

AN - SCOPUS:84858081015

VL - 81

SP - 314

EP - 330

JO - Journal of Logic and Algebraic Programming

JF - Journal of Logic and Algebraic Programming

SN - 2352-2208

IS - 3

Y2 - 10 November 2010 through 12 November 2010

ER -

ID: 172847992