Models for logics and conditional constraints in automated proofs of termination

Reasoning about termination of declarative programs, which are described by means of a computational logic, requires the definition of appropriate abstractions as semantic models of the logic, and also handling the conditional constraints which are often obtained. The formal treatment of such constr...

Descripción completa

Detalles Bibliográficos
Autores: Lucas Alba, Salvador|||0000-0001-9923-2108, Meseguer, José
Tipo de recurso: capítulo de libro
Fecha de publicación:2014
País:España
Institución:Universitat Politècnica de València (UPV)
Repositorio:RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Idioma:inglés
OAI Identifier:oai:riunet.upv.es:10251/50582
Acceso en línea:https://riunet.upv.es/handle/10251/50582
Access Level:acceso abierto
Palabra clave:Termination
Conditional constraints
Program Analysis
LENGUAJES Y SISTEMAS INFORMATICOS
id ES_58bf109b18bdff8985c9ddb5b5dfc3ec
oai_identifier_str oai:riunet.upv.es:10251/50582
network_acronym_str ES
network_name_str España
repository_id_str
spelling Models for logics and conditional constraints in automated proofs of terminationLucas Alba, Salvador|||0000-0001-9923-2108Meseguer, JoséTerminationConditional constraintsProgram AnalysisLENGUAJES Y SISTEMAS INFORMATICOSReasoning about termination of declarative programs, which are described by means of a computational logic, requires the definition of appropriate abstractions as semantic models of the logic, and also handling the conditional constraints which are often obtained. The formal treatment of such constraints in automated proofs, often using numeric interpretations and (arithmetic) constraint solving can greatly benefit from appropriate techniques to deal with the conditional (in)equations at stake. Existing results from linear algebra or real algebraic geometry are useful to deal with them but have received only scant attention to date. We investigate the definition and use of numeric models for logics and the resolution of linear and algebraic conditional constraints as unifying techniques for proving termination of declarative programs.Developed during a sabbatical year at UIUC. Supported by projects NSF CNS13-19109, MINECO TIN2010-21062-C02-02 and TIN2013-45732-C4-1-P, and GV BEST/2014/026 and PROMETEO/2011/052.Springer Verlag (Germany)Departamento de Sistemas Informáticos y ComputaciónEscuela Técnica Superior de Ingeniería InformáticaInstituto Universitario Valenciano de Investigación en Inteligencia ArtificialNational Science Foundation, EEUUMinisterio de Economía y CompetitividadGeneralitat ValencianaMinisterio de Ciencia e InnovaciónRepositorio Institucional de la Universitat Politècnica de València Riunet20142014-01-01book parthttp://purl.org/coar/resource_type/c_3248VoRhttp://purl.org/coar/version/c_970fb48d4fbd8a85info:eu-repo/semantics/bookPartapplication/pdfapplication/pdfhttps://riunet.upv.es/handle/10251/50582reponame:RiuNet. Repositorio Institucional de la Universitat Politécnica de Valénciainstname:Universitat Politècnica de València (UPV)InglésengNational 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-UPVMinisterio de Economía y Competitividad http://dx.doi.org/10.13039/501100003329 TIN2013-45732-C4-1-P UNA APROXIMACION DECLARATIVA AL MODELADO, ANALISIS Y RESOLUCION DE PROBLEMASGeneralitat Valenciana https://doi.org/10.13039/501100003359 BEST%2F2014%2F026Generalitat Valenciana https://doi.org/10.13039/501100003359 PROMETEO%2F2011%2F052 LOGICEXTREME: TECNOLOGIA LOGICA Y SOFTWARE SEGUROopen 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/505822026-06-13T07:49:27Z
dc.title.none.fl_str_mv Models for logics and conditional constraints in automated proofs of termination
title Models for logics and conditional constraints in automated proofs of termination
spellingShingle Models for logics and conditional constraints in automated proofs of termination
Lucas Alba, Salvador|||0000-0001-9923-2108
Termination
Conditional constraints
Program Analysis
LENGUAJES Y SISTEMAS INFORMATICOS
title_short Models for logics and conditional constraints in automated proofs of termination
title_full Models for logics and conditional constraints in automated proofs of termination
title_fullStr Models for logics and conditional constraints in automated proofs of termination
title_full_unstemmed Models for logics and conditional constraints in automated proofs of termination
title_sort Models for logics and conditional constraints in automated proofs of termination
dc.creator.none.fl_str_mv Lucas Alba, Salvador|||0000-0001-9923-2108
Meseguer, José
author Lucas Alba, Salvador|||0000-0001-9923-2108
author_facet Lucas Alba, Salvador|||0000-0001-9923-2108
Meseguer, José
author_role author
author2 Meseguer, José
author2_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
National Science Foundation, EEUU
Ministerio de Economía y Competitividad
Generalitat Valenciana
Ministerio de Ciencia e Innovación
Repositorio Institucional de la Universitat Politècnica de València Riunet
dc.subject.none.fl_str_mv Termination
Conditional constraints
Program Analysis
LENGUAJES Y SISTEMAS INFORMATICOS
topic Termination
Conditional constraints
Program Analysis
LENGUAJES Y SISTEMAS INFORMATICOS
description Reasoning about termination of declarative programs, which are described by means of a computational logic, requires the definition of appropriate abstractions as semantic models of the logic, and also handling the conditional constraints which are often obtained. The formal treatment of such constraints in automated proofs, often using numeric interpretations and (arithmetic) constraint solving can greatly benefit from appropriate techniques to deal with the conditional (in)equations at stake. Existing results from linear algebra or real algebraic geometry are useful to deal with them but have received only scant attention to date. We investigate the definition and use of numeric models for logics and the resolution of linear and algebraic conditional constraints as unifying techniques for proving termination of declarative programs.
publishDate 2014
dc.date.none.fl_str_mv 2014
2014-01-01
dc.type.none.fl_str_mv book part
http://purl.org/coar/resource_type/c_3248
VoR
http://purl.org/coar/version/c_970fb48d4fbd8a85
dc.type.openaire.fl_str_mv info:eu-repo/semantics/bookPart
format bookPart
dc.identifier.none.fl_str_mv https://riunet.upv.es/handle/10251/50582
url https://riunet.upv.es/handle/10251/50582
dc.language.none.fl_str_mv Inglés
eng
language_invalid_str_mv Inglés
language eng
dc.relation.none.fl_str_mv 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
Ministerio de Economía y Competitividad http://dx.doi.org/10.13039/501100003329 TIN2013-45732-C4-1-P UNA APROXIMACION DECLARATIVA AL MODELADO, ANALISIS Y RESOLUCION DE PROBLEMAS
Generalitat Valenciana https://doi.org/10.13039/501100003359 BEST%2F2014%2F026
Generalitat Valenciana https://doi.org/10.13039/501100003359 PROMETEO%2F2011%2F052 LOGICEXTREME: TECNOLOGIA LOGICA Y SOFTWARE SEGURO
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 Springer Verlag (Germany)
publisher.none.fl_str_mv Springer Verlag (Germany)
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_ 1869408564874838016
score 15,300719

Similares en LA Referencia