Mostrar el registro sencillo del ítem
dc.contributor.author | Vidal, Germán | es_ES |
dc.date.accessioned | 2022-01-03T08:46:38Z | |
dc.date.available | 2022-01-03T08:46:38Z | |
dc.date.issued | 2020-07-10 | es_ES |
dc.identifier.isbn | 978-3-030-52481-4 | es_ES |
dc.identifier.uri | http://hdl.handle.net/10251/179209 | |
dc.description.abstract | [EN] In this work, we say that a computation is reversible if one can find a procedure to undo the steps of a standard (or forward) computation in a deterministic way. While logic programs are often invertible (e.g., one can use the same predicate for adding and for subtracting natural numbers), computations are not reversible in the above sense. In this paper, we present a so-called Landauer embedding for SLD resolution, the operational principle of logic programs, so that it becomes reversible. A proof-of-concept implementation of a reversible debugger for Prolog that follows the ideas in this paper has been developed and is publicly available. | es_ES |
dc.description.sponsorship | This work is partially supported by the EU (FEDER) and the Spanish MCI/AEI under grants TIN2016-76843-C4-1-R/PID2019-104735RB-C41, by the Generalitat Valenciana under grant Prometeo/2019/098 (DeepTrust), and by the COST Action IC1405 on Reversible Computation - extending horizons of computing. | es_ES |
dc.language | Inglés | es_ES |
dc.publisher | Springer | es_ES |
dc.relation.ispartof | Reversible Computation | es_ES |
dc.relation.ispartofseries | Lecture Notes in Computer Science;12227 | es_ES |
dc.rights | Reserva de todos los derechos | es_ES |
dc.subject.classification | LENGUAJES Y SISTEMAS INFORMATICOS | es_ES |
dc.title | Reversible Computations in Logic Programming | es_ES |
dc.type | Comunicación en congreso | es_ES |
dc.type | Capítulo de libro | es_ES |
dc.identifier.doi | 10.1007/978-3-030-52482-1_15 | es_ES |
dc.relation.projectID | info:eu-repo/grantAgreement/AEI/Plan Estatal de Investigación Científica y Técnica y de Innovación 2017-2020/PID2019-104735RB-C41/ES/SAFER-UPV: ANALISIS Y VALIDACION DE SOFTWARE Y RECURSOS WEB/ | es_ES |
dc.relation.projectID | info:eu-repo/grantAgreement///COST action IC1405//Reversible computation - extending horizons of computing/ | es_ES |
dc.relation.projectID | info:eu-repo/grantAgreement/AEI//TIN2016-76843-C4-1-R//METODOS RIGUROSOS PARA EL INTERNET DEL FUTURO/ | es_ES |
dc.relation.projectID | info:eu-repo/grantAgreement///PROMETEO%2F2019%2F098//DEEPTRUST/ | es_ES |
dc.rights.accessRights | Abierto | es_ES |
dc.contributor.affiliation | Universitat Politècnica de València. Departamento de Sistemas Informáticos y Computación - Departament de Sistemes Informàtics i Computació | es_ES |
dc.description.bibliographicCitation | Vidal, G. (2020). Reversible Computations in Logic Programming. Springer. 246-254. https://doi.org/10.1007/978-3-030-52482-1_15 | es_ES |
dc.description.accrualMethod | S | es_ES |
dc.relation.conferencename | 12th Conference on Reversible Computation (RC 2020) | es_ES |
dc.relation.conferencedate | Julio 09-10,2020 | es_ES |
dc.relation.conferenceplace | Oslo, Norway | es_ES |
dc.relation.publisherversion | https://doi.org/10.1007/978-3-030-52482-1_15 | es_ES |
dc.description.upvformatpinicio | 246 | es_ES |
dc.description.upvformatpfin | 254 | es_ES |
dc.type.version | info:eu-repo/semantics/publishedVersion | es_ES |
dc.relation.pasarela | S\427894 | es_ES |
dc.contributor.funder | European Regional Development Fund | es_ES |
dc.description.references | Apt, K.: From Logic Programming to Prolog. Prentice Hall, Upper Saddle River (1997) | es_ES |
dc.description.references | Ducassé, M.: Opium: an extendable trace analyzer for prolog. J. Log. Program. 39(1–3), 177–223 (1999). https://doi.org/10.1016/S0743-1066(98)10036-5 | es_ES |
dc.description.references | Landauer, R.: Irreversibility and heat generation in the computing process. IBM J. Res. Dev. 5, 183–191 (1961) | es_ES |
dc.description.references | Lanese, I., Palacios, A., Vidal, G.: Causal-consistent replay debugging for message passing programs. In: Pérez, J.A., Yoshida, N. (eds.) FORTE 2019. LNCS, vol. 11535, pp. 167–184. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-21759-4_10 | es_ES |
dc.description.references | Lloyd, J.: Foundations of Logic Programming, 2nd edn. Springer, Berlin (1987). https://doi.org/10.1007/978-3-642-83189-8 | es_ES |
dc.description.references | O’Callahan, R., Jones, C., Froyd, N., Huey, K., Noll, A., Partush, N.: Engineering record and replay for deployability: Extended technical report (2017). CoRR abs/1705.05937, http://arxiv.org/abs/1705.05937 | es_ES |
dc.description.references | Ströder, T., Emmes, F., Schneider-Kamp, P., Giesl, J., Fuhs, C.: A linear operational semantics for termination and complexity analysis of ISO prolog. In: Vidal, G. (ed.) LOPSTR 2011. LNCS, vol. 7225, pp. 237–252. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-32211-2_16 | es_ES |
dc.description.references | Undo Software: Increasing software development productivity with reversible debugging (2014). https://undo.io/media/uploads/files/Undo_ReversibleDebugging_Whitepaper.pdf | es_ES |