Computer Aided Verification of Relational Models by Strategic Rewriting

Autores
Necco, Claudia Mónica; Oliveira, José N.; Visser, Joost; Uzal, Roberto
Año de publicación
2017
Idioma
inglés
Tipo de recurso
artículo
Estado
versión publicada
Descripción
Binary relational algebra provides semantic foundations for major areas of computing, such as database design, state-based modeling and functional programming. Remarkably, static checking support in these areas fails to exploit the full semantic content of relations. In particular, properties such as the simplicity or injectivity of relations are not statically enforced in operations such as database queries, state transitions, or composition of functional components. When data models, their constraints and operations are represented by point-free binary relational expressions, proof obligations can be expressed as inclusions between relational expressions. We developed a typedirected, strategic term rewriting system that can be used to simplify relational proof obligations and ultimately reduce them to tautologies. Such reductions can be used to provide extended static checking for design contraints commonly found in software modeling and development.
Facultad de Informática
Materia
Ciencias Informáticas
models verification
symbolic execution
abstract model verification
extended static checking
strategic term rewriting
Nivel de accesibilidad
acceso abierto
Condiciones de uso
http://creativecommons.org/licenses/by/4.0/
Repositorio
SEDICI (UNLP)
Institución
Universidad Nacional de La Plata
OAI Identificador
oai:sedici.unlp.edu.ar:10915/62942
Acceder
id SEDICI_61c6d2efea5a0ce3e4c31833623a0021
oai_identifier_str oai:sedici.unlp.edu.ar:10915/62942
network_acronym_str SEDICI
repository_id_str 1329
network_name_str SEDICI (UNLP)
spelling Computer Aided Verification of Relational Models by Strategic RewritingNecco, Claudia MónicaOliveira, José N.Visser, JoostUzal, RobertoCiencias Informáticasmodels verificationsymbolic executionabstract model verificationextended static checkingstrategic term rewritingBinary relational algebra provides semantic foundations for major areas of computing, such as database design, state-based modeling and functional programming. Remarkably, static checking support in these areas fails to exploit the full semantic content of relations. In particular, properties such as the simplicity or injectivity of relations are not statically enforced in operations such as database queries, state transitions, or composition of functional components. When data models, their constraints and operations are represented by point-free binary relational expressions, proof obligations can be expressed as inclusions between relational expressions. We developed a typedirected, strategic term rewriting system that can be used to simplify relational proof obligations and ultimately reduce them to tautologies. Such reductions can be used to provide extended static checking for design contraints commonly found in software modeling and development.Facultad de Informática2017-10info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionArticulohttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdf140-148http://sedici.unlp.edu.ar/handle/10915/62942enginfo:eu-repo/semantics/altIdentifier/url/http://journal.info.unlp.edu.ar/wp-content/uploads/2017/10/JCST-45-Paper-7.pdfinfo:eu-repo/semantics/altIdentifier/issn/1666-6038info:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by/4.0/Creative Commons Attribution 4.0 International (CC BY 4.0)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-09-03T10:40:46Zoai:sedici.unlp.edu.ar:10915/62942Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-09-03 10:40:47.149SEDICI (UNLP) - Universidad Nacional de La Platafalse
dc.title.none.fl_str_mv Computer Aided Verification of Relational Models by Strategic Rewriting
title Computer Aided Verification of Relational Models by Strategic Rewriting
spellingShingle Computer Aided Verification of Relational Models by Strategic Rewriting
Necco, Claudia Mónica
Ciencias Informáticas
models verification
symbolic execution
abstract model verification
extended static checking
strategic term rewriting
title_short Computer Aided Verification of Relational Models by Strategic Rewriting
title_full Computer Aided Verification of Relational Models by Strategic Rewriting
title_fullStr Computer Aided Verification of Relational Models by Strategic Rewriting
title_full_unstemmed Computer Aided Verification of Relational Models by Strategic Rewriting
title_sort Computer Aided Verification of Relational Models by Strategic Rewriting
dc.creator.none.fl_str_mv Necco, Claudia Mónica
Oliveira, José N.
Visser, Joost
Uzal, Roberto
author Necco, Claudia Mónica
author_facet Necco, Claudia Mónica
Oliveira, José N.
Visser, Joost
Uzal, Roberto
author_role author
author2 Oliveira, José N.
Visser, Joost
Uzal, Roberto
author2_role author
author
author
dc.subject.none.fl_str_mv Ciencias Informáticas
models verification
symbolic execution
abstract model verification
extended static checking
strategic term rewriting
topic Ciencias Informáticas
models verification
symbolic execution
abstract model verification
extended static checking
strategic term rewriting
dc.description.none.fl_txt_mv Binary relational algebra provides semantic foundations for major areas of computing, such as database design, state-based modeling and functional programming. Remarkably, static checking support in these areas fails to exploit the full semantic content of relations. In particular, properties such as the simplicity or injectivity of relations are not statically enforced in operations such as database queries, state transitions, or composition of functional components. When data models, their constraints and operations are represented by point-free binary relational expressions, proof obligations can be expressed as inclusions between relational expressions. We developed a typedirected, strategic term rewriting system that can be used to simplify relational proof obligations and ultimately reduce them to tautologies. Such reductions can be used to provide extended static checking for design contraints commonly found in software modeling and development.
Facultad de Informática
description Binary relational algebra provides semantic foundations for major areas of computing, such as database design, state-based modeling and functional programming. Remarkably, static checking support in these areas fails to exploit the full semantic content of relations. In particular, properties such as the simplicity or injectivity of relations are not statically enforced in operations such as database queries, state transitions, or composition of functional components. When data models, their constraints and operations are represented by point-free binary relational expressions, proof obligations can be expressed as inclusions between relational expressions. We developed a typedirected, strategic term rewriting system that can be used to simplify relational proof obligations and ultimately reduce them to tautologies. Such reductions can be used to provide extended static checking for design contraints commonly found in software modeling and development.
publishDate 2017
dc.date.none.fl_str_mv 2017-10
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Articulo
http://purl.org/coar/resource_type/c_6501
info:ar-repo/semantics/articulo
format article
status_str publishedVersion
dc.identifier.none.fl_str_mv http://sedici.unlp.edu.ar/handle/10915/62942
url http://sedici.unlp.edu.ar/handle/10915/62942
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/url/http://journal.info.unlp.edu.ar/wp-content/uploads/2017/10/JCST-45-Paper-7.pdf
info:eu-repo/semantics/altIdentifier/issn/1666-6038
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
http://creativecommons.org/licenses/by/4.0/
Creative Commons Attribution 4.0 International (CC BY 4.0)
eu_rights_str_mv openAccess
rights_invalid_str_mv http://creativecommons.org/licenses/by/4.0/
Creative Commons Attribution 4.0 International (CC BY 4.0)
dc.format.none.fl_str_mv application/pdf
140-148
dc.source.none.fl_str_mv reponame:SEDICI (UNLP)
instname:Universidad Nacional de La Plata
instacron:UNLP
reponame_str SEDICI (UNLP)
collection SEDICI (UNLP)
instname_str Universidad Nacional de La Plata
instacron_str UNLP
institution UNLP
repository.name.fl_str_mv SEDICI (UNLP) - Universidad Nacional de La Plata
repository.mail.fl_str_mv alira@sedici.unlp.edu.ar
_version_ 1842260273729110016
score 13.13397

Publicaciones similares