Efficient Tight Field Bounds Computation Based on Shape Predicates

Autores
Ponzio, Pablo Daniel; Rosner, Nicolas Leandro; Aguirre, Nazareno Matias; Frias, Marcelo Fabian
Año de publicación
2014
Idioma
inglés
Tipo de recurso
artículo
Estado
versión publicada
Descripción
Tight field bounds contribute to verifying the correctness of object oriented programs in bounded scenarios, by restricting the values that fields can take to feasible cases only, during automated analysis. Tight field bounds are computed from formal class specifications. Their computation is costly, and existing approaches use a cluster of computers to obtain the bounds, from declarative (JML) formal specifications. In this article we address the question of whether the language in which class specifications are expressed may affect the efficiency with which tight field bounds can be computed. We introduce a novel technique that generates tight field bounds from data structure descriptions provided in terms of shape predicates, expressed using separation logic. Our technique enables us to compute tight field bounds faster on a single workstation, than the alternative approaches which use a cluster, in wall-clock time terms. Although the computed tight bounds differ in the canonical ordering in which data structure nodes are labeled, our computed tight field bounds are also effective. We incorporate the field bounds computed with our technique into a state-of-the-art SAT based analysis tool, and show that, for various case studies, our field bounds allow us to handle scopes in bounded exhaustive analysis comparable to those corresponding to bounds computed with previous techniques.
Fil: Ponzio, Pablo Daniel. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Nacional de Rio Cuarto. Facultad de Cs.exactas Fisicoquímicas y Naturales. Departamento de Computacion; Argentina
Fil: Rosner, Nicolas Leandro. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina
Fil: Aguirre, Nazareno Matias. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Nacional de Rio Cuarto. Facultad de Cs.exactas Fisicoquímicas y Naturales. Departamento de Computacion; Argentina
Fil: Frias, Marcelo Fabian. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Instituto Tecnológico de Buenos Aires; Argentina
Materia
Tight Field Bounds
Shape Predicates
Bounded Verification
Nivel de accesibilidad
acceso abierto
Condiciones de uso
https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Repositorio
CONICET Digital (CONICET)
Institución
Consejo Nacional de Investigaciones Científicas y Técnicas
OAI Identificador
oai:ri.conicet.gov.ar:11336/33484

id CONICETDig_a089f23e1536d7a9dde96b4533458bcf
oai_identifier_str oai:ri.conicet.gov.ar:11336/33484
network_acronym_str CONICETDig
repository_id_str 3498
network_name_str CONICET Digital (CONICET)
spelling Efficient Tight Field Bounds Computation Based on Shape PredicatesPonzio, Pablo DanielRosner, Nicolas LeandroAguirre, Nazareno MatiasFrias, Marcelo FabianTight Field BoundsShape PredicatesBounded Verificationhttps://purl.org/becyt/ford/1.2https://purl.org/becyt/ford/1Tight field bounds contribute to verifying the correctness of object oriented programs in bounded scenarios, by restricting the values that fields can take to feasible cases only, during automated analysis. Tight field bounds are computed from formal class specifications. Their computation is costly, and existing approaches use a cluster of computers to obtain the bounds, from declarative (JML) formal specifications. In this article we address the question of whether the language in which class specifications are expressed may affect the efficiency with which tight field bounds can be computed. We introduce a novel technique that generates tight field bounds from data structure descriptions provided in terms of shape predicates, expressed using separation logic. Our technique enables us to compute tight field bounds faster on a single workstation, than the alternative approaches which use a cluster, in wall-clock time terms. Although the computed tight bounds differ in the canonical ordering in which data structure nodes are labeled, our computed tight field bounds are also effective. We incorporate the field bounds computed with our technique into a state-of-the-art SAT based analysis tool, and show that, for various case studies, our field bounds allow us to handle scopes in bounded exhaustive analysis comparable to those corresponding to bounds computed with previous techniques.Fil: Ponzio, Pablo Daniel. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Nacional de Rio Cuarto. Facultad de Cs.exactas Fisicoquímicas y Naturales. Departamento de Computacion; ArgentinaFil: Rosner, Nicolas Leandro. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; ArgentinaFil: Aguirre, Nazareno Matias. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Nacional de Rio Cuarto. Facultad de Cs.exactas Fisicoquímicas y Naturales. Departamento de Computacion; ArgentinaFil: Frias, Marcelo Fabian. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Instituto Tecnológico de Buenos Aires; ArgentinaSpringer2014-05info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdfapplication/pdfapplication/pdfapplication/pdfhttp://hdl.handle.net/11336/33484Rosner, Nicolas Leandro; Aguirre, Nazareno Matias; Ponzio, Pablo Daniel; Frias, Marcelo Fabian; Efficient Tight Field Bounds Computation Based on Shape Predicates; Springer; Lecture Notes in Computer Science; FM2014; 5-2014; 531-5460302-9743CONICET DigitalCONICETenginfo:eu-repo/semantics/altIdentifier/doi/10.1007/978-3-319-06410-9_36info:eu-repo/semantics/altIdentifier/url/https://link.springer.com/chapter/10.1007%2F978-3-319-06410-9_36info:eu-repo/semantics/openAccesshttps://creativecommons.org/licenses/by-nc-sa/2.5/ar/reponame:CONICET Digital (CONICET)instname:Consejo Nacional de Investigaciones Científicas y Técnicas2025-09-10T13:08:53Zoai:ri.conicet.gov.ar:11336/33484instacron:CONICETInstitucionalhttp://ri.conicet.gov.ar/Organismo científico-tecnológicoNo correspondehttp://ri.conicet.gov.ar/oai/requestdasensio@conicet.gov.ar; lcarlino@conicet.gov.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:34982025-09-10 13:08:53.734CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicasfalse
dc.title.none.fl_str_mv Efficient Tight Field Bounds Computation Based on Shape Predicates
title Efficient Tight Field Bounds Computation Based on Shape Predicates
spellingShingle Efficient Tight Field Bounds Computation Based on Shape Predicates
Ponzio, Pablo Daniel
Tight Field Bounds
Shape Predicates
Bounded Verification
title_short Efficient Tight Field Bounds Computation Based on Shape Predicates
title_full Efficient Tight Field Bounds Computation Based on Shape Predicates
title_fullStr Efficient Tight Field Bounds Computation Based on Shape Predicates
title_full_unstemmed Efficient Tight Field Bounds Computation Based on Shape Predicates
title_sort Efficient Tight Field Bounds Computation Based on Shape Predicates
dc.creator.none.fl_str_mv Ponzio, Pablo Daniel
Rosner, Nicolas Leandro
Aguirre, Nazareno Matias
Frias, Marcelo Fabian
author Ponzio, Pablo Daniel
author_facet Ponzio, Pablo Daniel
Rosner, Nicolas Leandro
Aguirre, Nazareno Matias
Frias, Marcelo Fabian
author_role author
author2 Rosner, Nicolas Leandro
Aguirre, Nazareno Matias
Frias, Marcelo Fabian
author2_role author
author
author
dc.subject.none.fl_str_mv Tight Field Bounds
Shape Predicates
Bounded Verification
topic Tight Field Bounds
Shape Predicates
Bounded Verification
purl_subject.fl_str_mv https://purl.org/becyt/ford/1.2
https://purl.org/becyt/ford/1
dc.description.none.fl_txt_mv Tight field bounds contribute to verifying the correctness of object oriented programs in bounded scenarios, by restricting the values that fields can take to feasible cases only, during automated analysis. Tight field bounds are computed from formal class specifications. Their computation is costly, and existing approaches use a cluster of computers to obtain the bounds, from declarative (JML) formal specifications. In this article we address the question of whether the language in which class specifications are expressed may affect the efficiency with which tight field bounds can be computed. We introduce a novel technique that generates tight field bounds from data structure descriptions provided in terms of shape predicates, expressed using separation logic. Our technique enables us to compute tight field bounds faster on a single workstation, than the alternative approaches which use a cluster, in wall-clock time terms. Although the computed tight bounds differ in the canonical ordering in which data structure nodes are labeled, our computed tight field bounds are also effective. We incorporate the field bounds computed with our technique into a state-of-the-art SAT based analysis tool, and show that, for various case studies, our field bounds allow us to handle scopes in bounded exhaustive analysis comparable to those corresponding to bounds computed with previous techniques.
Fil: Ponzio, Pablo Daniel. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Nacional de Rio Cuarto. Facultad de Cs.exactas Fisicoquímicas y Naturales. Departamento de Computacion; Argentina
Fil: Rosner, Nicolas Leandro. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina
Fil: Aguirre, Nazareno Matias. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Nacional de Rio Cuarto. Facultad de Cs.exactas Fisicoquímicas y Naturales. Departamento de Computacion; Argentina
Fil: Frias, Marcelo Fabian. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Instituto Tecnológico de Buenos Aires; Argentina
description Tight field bounds contribute to verifying the correctness of object oriented programs in bounded scenarios, by restricting the values that fields can take to feasible cases only, during automated analysis. Tight field bounds are computed from formal class specifications. Their computation is costly, and existing approaches use a cluster of computers to obtain the bounds, from declarative (JML) formal specifications. In this article we address the question of whether the language in which class specifications are expressed may affect the efficiency with which tight field bounds can be computed. We introduce a novel technique that generates tight field bounds from data structure descriptions provided in terms of shape predicates, expressed using separation logic. Our technique enables us to compute tight field bounds faster on a single workstation, than the alternative approaches which use a cluster, in wall-clock time terms. Although the computed tight bounds differ in the canonical ordering in which data structure nodes are labeled, our computed tight field bounds are also effective. We incorporate the field bounds computed with our technique into a state-of-the-art SAT based analysis tool, and show that, for various case studies, our field bounds allow us to handle scopes in bounded exhaustive analysis comparable to those corresponding to bounds computed with previous techniques.
publishDate 2014
dc.date.none.fl_str_mv 2014-05
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
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://hdl.handle.net/11336/33484
Rosner, Nicolas Leandro; Aguirre, Nazareno Matias; Ponzio, Pablo Daniel; Frias, Marcelo Fabian; Efficient Tight Field Bounds Computation Based on Shape Predicates; Springer; Lecture Notes in Computer Science; FM2014; 5-2014; 531-546
0302-9743
CONICET Digital
CONICET
url http://hdl.handle.net/11336/33484
identifier_str_mv Rosner, Nicolas Leandro; Aguirre, Nazareno Matias; Ponzio, Pablo Daniel; Frias, Marcelo Fabian; Efficient Tight Field Bounds Computation Based on Shape Predicates; Springer; Lecture Notes in Computer Science; FM2014; 5-2014; 531-546
0302-9743
CONICET Digital
CONICET
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/doi/10.1007/978-3-319-06410-9_36
info:eu-repo/semantics/altIdentifier/url/https://link.springer.com/chapter/10.1007%2F978-3-319-06410-9_36
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
eu_rights_str_mv openAccess
rights_invalid_str_mv https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
dc.format.none.fl_str_mv application/pdf
application/pdf
application/pdf
application/pdf
dc.publisher.none.fl_str_mv Springer
publisher.none.fl_str_mv Springer
dc.source.none.fl_str_mv reponame:CONICET Digital (CONICET)
instname:Consejo Nacional de Investigaciones Científicas y Técnicas
reponame_str CONICET Digital (CONICET)
collection CONICET Digital (CONICET)
instname_str Consejo Nacional de Investigaciones Científicas y Técnicas
repository.name.fl_str_mv CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicas
repository.mail.fl_str_mv dasensio@conicet.gov.ar; lcarlino@conicet.gov.ar
_version_ 1842980429166018560
score 12.993085