Completeness of Context-Sensitive Rewriting

Restrictions of rewriting may turn normal forms of some terms unreachable, leading to incomplete computations. Context-sensitive rewriting (csr) is the restriction of rewriting that only permits reductions on arguments selected by a replacement map μ, which associates a subset μ(f ) of argument indi...

Full description

Bibliographic Details
Author: Lucas Alba, Salvador|||0000-0001-9923-2108
Format: article
Publication Date:2015
Country:España
Institution:Universitat Politècnica de València (UPV)
Repository:RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Language:English
OAI Identifier:oai:riunet.upv.es:10251/64906
Online Access:https://riunet.upv.es/handle/10251/64906
Access Level:Open access
Keyword:Algebraic semantics
Context-sensitive rewriting
Formal reasoning
Programming languages
LENGUAJES Y SISTEMAS INFORMATICOS
id ES_aac9dcce77d537a8894fe4b59285eede
oai_identifier_str oai:riunet.upv.es:10251/64906
network_acronym_str ES
network_name_str España
repository_id_str
spelling Completeness of Context-Sensitive RewritingLucas Alba, Salvador|||0000-0001-9923-2108Algebraic semanticsContext-sensitive rewritingFormal reasoningProgramming languagesLENGUAJES Y SISTEMAS INFORMATICOSRestrictions of rewriting may turn normal forms of some terms unreachable, leading to incomplete computations. Context-sensitive rewriting (csr) is the restriction of rewriting that only permits reductions on arguments selected by a replacement map μ, which associates a subset μ(f ) of argument indices with each function symbol f . Hendrix and Meseguer defined an algebraic semantics for Term Rewriting Systems (TRSs) executing csr that can be used to reason about programs written in programming languages like CafeOBJ and Maude, where such replacement restrictions can be specified in programs. Semantic completeness of csr was also defined. In this paper we show that canonical replacement maps, which play a prominent role in simulating rewriting computations with csr, are necessary for completeness in important classes of TRSs. © 2014 Elsevier B.V. All rights reserved.Supported by NSF CNS 13-19109, MINECO project TIN2010-21062-C02-02, GV (Generalitat Valenciana) Grants BEST/2014/026 and PROMETEO/2011/052.ElsevierDepartamento de Sistemas Informáticos y ComputaciónEscuela Técnica Superior de Ingeniería InformáticaInstituto Universitario Valenciano de Investigación en Inteligencia ArtificialMinisterio de Ciencia e InnovaciónGeneralitat ValencianaRepositorio Institucional de la Universitat Politècnica de València Riunet20152015-02-01journal articlehttp://purl.org/coar/resource_type/c_6501VoRhttp://purl.org/coar/version/c_970fb48d4fbd8a85info:eu-repo/semantics/articleapplication/pdfapplication/pdfhttps://riunet.upv.es/handle/10251/64906reponame:RiuNet. Repositorio Institucional de la Universitat Politécnica de Valénciainstname:Universitat Politècnica de València (UPV)InglésengGeneralitat Valenciana https://doi.org/10.13039/501100003359 PROMETEO%2F2011%2F052 LOGICEXTREME: TECNOLOGIA LOGICA Y SOFTWARE SEGURONational Science Foundation, China https://doi.org/10.13039/100000001 1319109 TWC: Small: Collaborative: Extensible Symbolic Analysis Modulo SMT: Combining the Powers of Rewriting, Narrowing, and SMT Solving in MaudeMinisterio de Ciencia e Innovación http://dx.doi.org/10.13039/501100004837 TIN2010-21062-C02-02 SWEETLOGICS-UPVGeneralitat Valenciana https://doi.org/10.13039/501100003359 BEST%2F2014%2F026open accesshttp://purl.org/coar/access_right/c_abf2Reserva de todos los derechoshttp://rightsstatements.org/vocab/InC/1.0/info:eu-repo/semantics/openAccessoai:riunet.upv.es:10251/649062026-06-13T07:49:27Z
dc.title.none.fl_str_mv Completeness of Context-Sensitive Rewriting
title Completeness of Context-Sensitive Rewriting
spellingShingle Completeness of Context-Sensitive Rewriting
Lucas Alba, Salvador|||0000-0001-9923-2108
Algebraic semantics
Context-sensitive rewriting
Formal reasoning
Programming languages
LENGUAJES Y SISTEMAS INFORMATICOS
title_short Completeness of Context-Sensitive Rewriting
title_full Completeness of Context-Sensitive Rewriting
title_fullStr Completeness of Context-Sensitive Rewriting
title_full_unstemmed Completeness of Context-Sensitive Rewriting
title_sort Completeness of Context-Sensitive Rewriting
dc.creator.none.fl_str_mv Lucas Alba, Salvador|||0000-0001-9923-2108
author Lucas Alba, Salvador|||0000-0001-9923-2108
author_facet Lucas Alba, Salvador|||0000-0001-9923-2108
author_role author
dc.contributor.none.fl_str_mv Departamento de Sistemas Informáticos y Computación
Escuela Técnica Superior de Ingeniería Informática
Instituto Universitario Valenciano de Investigación en Inteligencia Artificial
Ministerio de Ciencia e Innovación
Generalitat Valenciana
Repositorio Institucional de la Universitat Politècnica de València Riunet
dc.subject.none.fl_str_mv Algebraic semantics
Context-sensitive rewriting
Formal reasoning
Programming languages
LENGUAJES Y SISTEMAS INFORMATICOS
topic Algebraic semantics
Context-sensitive rewriting
Formal reasoning
Programming languages
LENGUAJES Y SISTEMAS INFORMATICOS
description Restrictions of rewriting may turn normal forms of some terms unreachable, leading to incomplete computations. Context-sensitive rewriting (csr) is the restriction of rewriting that only permits reductions on arguments selected by a replacement map μ, which associates a subset μ(f ) of argument indices with each function symbol f . Hendrix and Meseguer defined an algebraic semantics for Term Rewriting Systems (TRSs) executing csr that can be used to reason about programs written in programming languages like CafeOBJ and Maude, where such replacement restrictions can be specified in programs. Semantic completeness of csr was also defined. In this paper we show that canonical replacement maps, which play a prominent role in simulating rewriting computations with csr, are necessary for completeness in important classes of TRSs. © 2014 Elsevier B.V. All rights reserved.
publishDate 2015
dc.date.none.fl_str_mv 2015
2015-02-01
dc.type.none.fl_str_mv journal article
http://purl.org/coar/resource_type/c_6501
VoR
http://purl.org/coar/version/c_970fb48d4fbd8a85
dc.type.openaire.fl_str_mv info:eu-repo/semantics/article
format article
dc.identifier.none.fl_str_mv https://riunet.upv.es/handle/10251/64906
url https://riunet.upv.es/handle/10251/64906
dc.language.none.fl_str_mv Inglés
eng
language_invalid_str_mv Inglés
language eng
dc.relation.none.fl_str_mv Generalitat Valenciana https://doi.org/10.13039/501100003359 PROMETEO%2F2011%2F052 LOGICEXTREME: TECNOLOGIA LOGICA Y SOFTWARE SEGURO
National Science Foundation, China https://doi.org/10.13039/100000001 1319109 TWC: Small: Collaborative: Extensible Symbolic Analysis Modulo SMT: Combining the Powers of Rewriting, Narrowing, and SMT Solving in Maude
Ministerio de Ciencia e Innovación http://dx.doi.org/10.13039/501100004837 TIN2010-21062-C02-02 SWEETLOGICS-UPV
Generalitat Valenciana https://doi.org/10.13039/501100003359 BEST%2F2014%2F026
dc.rights.none.fl_str_mv open access
http://purl.org/coar/access_right/c_abf2
Reserva de todos los derechos
http://rightsstatements.org/vocab/InC/1.0/
dc.rights.openaire.fl_str_mv info:eu-repo/semantics/openAccess
rights_invalid_str_mv open access
http://purl.org/coar/access_right/c_abf2
Reserva de todos los derechos
http://rightsstatements.org/vocab/InC/1.0/
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
application/pdf
dc.publisher.none.fl_str_mv Elsevier
publisher.none.fl_str_mv Elsevier
dc.source.none.fl_str_mv reponame:RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
instname:Universitat Politècnica de València (UPV)
instname_str Universitat Politècnica de València (UPV)
reponame_str RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
collection RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869416212300038144
score 15,301629

Similar Items