Computer Aided Verification of Relational Models

Autores
Necco, Claudia Mónica; Oliveira, José R.; Visser, Joost; Uzal, Roberto
Año de publicación
2016
Idioma
inglés
Tipo de recurso
documento de conferencia
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 type-directed, 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.
XIII Workshop Ingeniería de Software (WIS).
Red de Universidades con Carreras en Informática (RedUNCI)
Materia
Ciencias Informáticas
models verification
symbolic execution
extended static checking
strategic term rewriting
Nivel de accesibilidad
acceso abierto
Condiciones de uso
http://creativecommons.org/licenses/by-nc-sa/4.0/
Repositorio
SEDICI (UNLP)
Institución
Universidad Nacional de La Plata
OAI Identificador
oai:sedici.unlp.edu.ar:10915/56730
Acceder
id SEDICI_8b2dd13f12751b382a08d2601e6dd72f
oai_identifier_str oai:sedici.unlp.edu.ar:10915/56730
network_acronym_str SEDICI
repository_id_str 1329
network_name_str SEDICI (UNLP)
spelling Computer Aided Verification of Relational ModelsNecco, Claudia MónicaOliveira, José R.Visser, JoostUzal, RobertoCiencias Informáticasmodels verificationsymbolic executionextended 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 type-directed, 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.XIII Workshop Ingeniería de Software (WIS).Red de Universidades con Carreras en Informática (RedUNCI)2016-10info:eu-repo/semantics/conferenceObjectinfo:eu-repo/semantics/publishedVersionObjeto de conferenciahttp://purl.org/coar/resource_type/c_5794info:ar-repo/semantics/documentoDeConferenciaapplication/pdf647-658http://sedici.unlp.edu.ar/handle/10915/56730enginfo:eu-repo/semantics/reference/hdl/10915/55718info:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by-nc-sa/4.0/Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-09-29T11:06:08Zoai:sedici.unlp.edu.ar:10915/56730Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-09-29 11:06:08.318SEDICI (UNLP) - Universidad Nacional de La Platafalse
dc.title.none.fl_str_mv Computer Aided Verification of Relational Models
title Computer Aided Verification of Relational Models
spellingShingle Computer Aided Verification of Relational Models
Necco, Claudia Mónica
Ciencias Informáticas
models verification
symbolic execution
extended static checking
strategic term rewriting
title_short Computer Aided Verification of Relational Models
title_full Computer Aided Verification of Relational Models
title_fullStr Computer Aided Verification of Relational Models
title_full_unstemmed Computer Aided Verification of Relational Models
title_sort Computer Aided Verification of Relational Models
dc.creator.none.fl_str_mv Necco, Claudia Mónica
Oliveira, José R.
Visser, Joost
Uzal, Roberto
author Necco, Claudia Mónica
author_facet Necco, Claudia Mónica
Oliveira, José R.
Visser, Joost
Uzal, Roberto
author_role author
author2 Oliveira, José R.
Visser, Joost
Uzal, Roberto
author2_role author
author
author
dc.subject.none.fl_str_mv Ciencias Informáticas
models verification
symbolic execution
extended static checking
strategic term rewriting
topic Ciencias Informáticas
models verification
symbolic execution
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 type-directed, 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.
XIII Workshop Ingeniería de Software (WIS).
Red de Universidades con Carreras en Informática (RedUNCI)
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 type-directed, 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 2016
dc.date.none.fl_str_mv 2016-10
dc.type.none.fl_str_mv info:eu-repo/semantics/conferenceObject
info:eu-repo/semantics/publishedVersion
Objeto de conferencia
http://purl.org/coar/resource_type/c_5794
info:ar-repo/semantics/documentoDeConferencia
format conferenceObject
status_str publishedVersion
dc.identifier.none.fl_str_mv http://sedici.unlp.edu.ar/handle/10915/56730
url http://sedici.unlp.edu.ar/handle/10915/56730
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/reference/hdl/10915/55718
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
http://creativecommons.org/licenses/by-nc-sa/4.0/
Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)
eu_rights_str_mv openAccess
rights_invalid_str_mv http://creativecommons.org/licenses/by-nc-sa/4.0/
Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)
dc.format.none.fl_str_mv application/pdf
647-658
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_ 1844615932163391488
score 13.069144

Publicaciones similares