Synthesis of models for order-sorted first-order theories using linear algebra and constraint solving

[EN] Recent developments in termination analysis for declarative programs emphasize the use of appropriate models for the logical theory representing the program at stake as a generic approach to prove termination of declarative programs. In this setting, Order-Sorted First-Order Logic provides a po...

Descripción completa

Detalles Bibliográficos
Autor: Lucas Alba, Salvador|||0000-0001-9923-2108
Tipo de recurso: artículo
Fecha de publicación:2015
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/64921
Acceso en línea:https://riunet.upv.es/handle/10251/64921
Access Level:acceso abierto
Palabra clave:Linear algebra
Logical models
Order-sorted first-order logic
Program Termination
LENGUAJES Y SISTEMAS INFORMATICOS
id ES_a0db569edd9be2eec4268b66a940f3f4
oai_identifier_str oai:riunet.upv.es:10251/64921
network_acronym_str ES
network_name_str España
repository_id_str
spelling Synthesis of models for order-sorted first-order theories using linear algebra and constraint solvingLucas Alba, Salvador|||0000-0001-9923-2108Linear algebraLogical modelsOrder-sorted first-order logicProgram TerminationLENGUAJES Y SISTEMAS INFORMATICOS[EN] Recent developments in termination analysis for declarative programs emphasize the use of appropriate models for the logical theory representing the program at stake as a generic approach to prove termination of declarative programs. In this setting, Order-Sorted First-Order Logic provides a powerful framework to represent declarative programs. It also provides a target logic to obtain models for other logics via transformations. We investigate the automatic generation of numerical models for order-sorted first-order logics and its use in program analysis, in particular in termination analysis of declarative programs. We use convex domains to give domains to the different sorts of an order-sorted signature; we interpret the ranked symbols of sorted signatures by means of appropriately adapted convex matrix interpretations. Such numerical interpretations permit the use of existing algorithms and tools from linear algebra and arithmetic constraint solving to synthesize the models.Partially supported by the EU (FEDER), Spanish MINECO TIN 2013-45732-C4-1-P and GV PROMETEOII/2015/013Departamento de Sistemas Informáticos y ComputaciónEscuela Técnica Superior de Ingeniería InformáticaInstituto Universitario Valenciano de Investigación en Inteligencia ArtificialMinisterio de Economía y CompetitividadGeneralitat ValencianaRepositorio Institucional de la Universitat Politècnica de València Riunet20152015-12-19journal articlehttp://purl.org/coar/resource_type/c_6501VoRhttp://purl.org/coar/version/c_970fb48d4fbd8a85info:eu-repo/semantics/articleapplication/pdfhttps://riunet.upv.es/handle/10251/64921reponame:RiuNet. Repositorio Institucional de la Universitat Politécnica de Valénciainstname:Universitat Politècnica de València (UPV)InglésengMinisterio 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 PROMETEOII%2F2015%2F013 SmartLogic: Logic Technologies for Software Security and Performanceopen accesshttp://purl.org/coar/access_right/c_abf2Reconocimiento (by)http://creativecommons.org/licenses/by/4.0/info:eu-repo/semantics/openAccessoai:riunet.upv.es:10251/649212026-06-13T07:49:27Z
dc.title.none.fl_str_mv Synthesis of models for order-sorted first-order theories using linear algebra and constraint solving
title Synthesis of models for order-sorted first-order theories using linear algebra and constraint solving
spellingShingle Synthesis of models for order-sorted first-order theories using linear algebra and constraint solving
Lucas Alba, Salvador|||0000-0001-9923-2108
Linear algebra
Logical models
Order-sorted first-order logic
Program Termination
LENGUAJES Y SISTEMAS INFORMATICOS
title_short Synthesis of models for order-sorted first-order theories using linear algebra and constraint solving
title_full Synthesis of models for order-sorted first-order theories using linear algebra and constraint solving
title_fullStr Synthesis of models for order-sorted first-order theories using linear algebra and constraint solving
title_full_unstemmed Synthesis of models for order-sorted first-order theories using linear algebra and constraint solving
title_sort Synthesis of models for order-sorted first-order theories using linear algebra and constraint solving
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 Economía y Competitividad
Generalitat Valenciana
Repositorio Institucional de la Universitat Politècnica de València Riunet
dc.subject.none.fl_str_mv Linear algebra
Logical models
Order-sorted first-order logic
Program Termination
LENGUAJES Y SISTEMAS INFORMATICOS
topic Linear algebra
Logical models
Order-sorted first-order logic
Program Termination
LENGUAJES Y SISTEMAS INFORMATICOS
description [EN] Recent developments in termination analysis for declarative programs emphasize the use of appropriate models for the logical theory representing the program at stake as a generic approach to prove termination of declarative programs. In this setting, Order-Sorted First-Order Logic provides a powerful framework to represent declarative programs. It also provides a target logic to obtain models for other logics via transformations. We investigate the automatic generation of numerical models for order-sorted first-order logics and its use in program analysis, in particular in termination analysis of declarative programs. We use convex domains to give domains to the different sorts of an order-sorted signature; we interpret the ranked symbols of sorted signatures by means of appropriately adapted convex matrix interpretations. Such numerical interpretations permit the use of existing algorithms and tools from linear algebra and arithmetic constraint solving to synthesize the models.
publishDate 2015
dc.date.none.fl_str_mv 2015
2015-12-19
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/64921
url https://riunet.upv.es/handle/10251/64921
dc.language.none.fl_str_mv Inglés
eng
language_invalid_str_mv Inglés
language eng
dc.relation.none.fl_str_mv 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 PROMETEOII%2F2015%2F013 SmartLogic: Logic Technologies for Software Security and Performance
dc.rights.none.fl_str_mv open access
http://purl.org/coar/access_right/c_abf2
Reconocimiento (by)
http://creativecommons.org/licenses/by/4.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
Reconocimiento (by)
http://creativecommons.org/licenses/by/4.0/
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
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_ 1869415062962176000
score 15.300719

Similares en LA Referencia