TacoFlow: optimizing SAT program verification using dataflow analysis

Autores
Cuervo Parrino, Bruno; Galeotti, Juan Pablo; Garbervetsky, Diego David; Frias, Marcelo Fabian
Año de publicación
2015
Idioma
inglés
Tipo de recurso
artículo
Estado
versión publicada
Descripción
In previous work, we presented TACO, a tool for efficient bounded verification. TACO translates programs annotated with contracts to a SAT problem which is then solved resorting to off-the-shelf SAT-solvers. TACO may deem propositional variables used in the description of a program initial states as being unnecessary. Since the worst-case complexity of SAT (a known NP problem) depends on the number of variables, most times this allows us to obtain significant speed ups. In this article, we present TacoFlow, an improvement over TACO that uses dataflow analysis in order to also discard propositional variables that describe intermediate program states. We present an extensive empirical evaluation that considers the effect of removing those variables at different levels of abstraction, and a discussion on the benefits of the proposed approach.
Fil: Cuervo Parrino, Bruno. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina
Fil: Galeotti, Juan Pablo. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universitat Saarland; Alemania
Fil: Garbervetsky, Diego David. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
Fil: Frias, Marcelo Fabian. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Instituto Tecnológico de Buenos Aires. Facultad de Ingeniería. Departamento de Informática; Argentina
Materia
Dataflow Analysis
Java-Like Programs Verification
Sat-Based 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/37732
Acceder
id CONICETDig_4f0f7f504d27e7c42c8d078e24505eb6
oai_identifier_str oai:ri.conicet.gov.ar:11336/37732
network_acronym_str CONICETDig
repository_id_str 3498
network_name_str CONICET Digital (CONICET)
spelling TacoFlow: optimizing SAT program verification using dataflow analysisCuervo Parrino, BrunoGaleotti, Juan PabloGarbervetsky, Diego DavidFrias, Marcelo FabianDataflow AnalysisJava-Like Programs VerificationSat-Based Verificationhttps://purl.org/becyt/ford/1.2https://purl.org/becyt/ford/1In previous work, we presented TACO, a tool for efficient bounded verification. TACO translates programs annotated with contracts to a SAT problem which is then solved resorting to off-the-shelf SAT-solvers. TACO may deem propositional variables used in the description of a program initial states as being unnecessary. Since the worst-case complexity of SAT (a known NP problem) depends on the number of variables, most times this allows us to obtain significant speed ups. In this article, we present TacoFlow, an improvement over TACO that uses dataflow analysis in order to also discard propositional variables that describe intermediate program states. We present an extensive empirical evaluation that considers the effect of removing those variables at different levels of abstraction, and a discussion on the benefits of the proposed approach.Fil: Cuervo Parrino, Bruno. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; ArgentinaFil: Galeotti, Juan Pablo. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universitat Saarland; AlemaniaFil: Garbervetsky, Diego David. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; ArgentinaFil: Frias, Marcelo Fabian. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Instituto Tecnológico de Buenos Aires. Facultad de Ingeniería. Departamento de Informática; ArgentinaSpringer Heidelberg2015-01info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdfapplication/pdfhttp://hdl.handle.net/11336/37732Cuervo Parrino, Bruno; Galeotti, Juan Pablo; Garbervetsky, Diego David; Frias, Marcelo Fabian; TacoFlow: optimizing SAT program verification using dataflow analysis; Springer Heidelberg; Software and Systems Modeling; 14; 1; 1-2015; 45-631619-1366CONICET DigitalCONICETenginfo:eu-repo/semantics/altIdentifier/doi/10.1007/s10270-014-0401-9info:eu-repo/semantics/altIdentifier/url/https://link.springer.com/article/10.1007%2Fs10270-014-0401-9info: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-03T09:58:01Zoai:ri.conicet.gov.ar:11336/37732instacron: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-03 09:58:01.8CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicasfalse
dc.title.none.fl_str_mv TacoFlow: optimizing SAT program verification using dataflow analysis
title TacoFlow: optimizing SAT program verification using dataflow analysis
spellingShingle TacoFlow: optimizing SAT program verification using dataflow analysis
Cuervo Parrino, Bruno
Dataflow Analysis
Java-Like Programs Verification
Sat-Based Verification
title_short TacoFlow: optimizing SAT program verification using dataflow analysis
title_full TacoFlow: optimizing SAT program verification using dataflow analysis
title_fullStr TacoFlow: optimizing SAT program verification using dataflow analysis
title_full_unstemmed TacoFlow: optimizing SAT program verification using dataflow analysis
title_sort TacoFlow: optimizing SAT program verification using dataflow analysis
dc.creator.none.fl_str_mv Cuervo Parrino, Bruno
Galeotti, Juan Pablo
Garbervetsky, Diego David
Frias, Marcelo Fabian
author Cuervo Parrino, Bruno
author_facet Cuervo Parrino, Bruno
Galeotti, Juan Pablo
Garbervetsky, Diego David
Frias, Marcelo Fabian
author_role author
author2 Galeotti, Juan Pablo
Garbervetsky, Diego David
Frias, Marcelo Fabian
author2_role author
author
author
dc.subject.none.fl_str_mv Dataflow Analysis
Java-Like Programs Verification
Sat-Based Verification
topic Dataflow Analysis
Java-Like Programs Verification
Sat-Based 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 In previous work, we presented TACO, a tool for efficient bounded verification. TACO translates programs annotated with contracts to a SAT problem which is then solved resorting to off-the-shelf SAT-solvers. TACO may deem propositional variables used in the description of a program initial states as being unnecessary. Since the worst-case complexity of SAT (a known NP problem) depends on the number of variables, most times this allows us to obtain significant speed ups. In this article, we present TacoFlow, an improvement over TACO that uses dataflow analysis in order to also discard propositional variables that describe intermediate program states. We present an extensive empirical evaluation that considers the effect of removing those variables at different levels of abstraction, and a discussion on the benefits of the proposed approach.
Fil: Cuervo Parrino, Bruno. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina
Fil: Galeotti, Juan Pablo. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universitat Saarland; Alemania
Fil: Garbervetsky, Diego David. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
Fil: Frias, Marcelo Fabian. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Instituto Tecnológico de Buenos Aires. Facultad de Ingeniería. Departamento de Informática; Argentina
description In previous work, we presented TACO, a tool for efficient bounded verification. TACO translates programs annotated with contracts to a SAT problem which is then solved resorting to off-the-shelf SAT-solvers. TACO may deem propositional variables used in the description of a program initial states as being unnecessary. Since the worst-case complexity of SAT (a known NP problem) depends on the number of variables, most times this allows us to obtain significant speed ups. In this article, we present TacoFlow, an improvement over TACO that uses dataflow analysis in order to also discard propositional variables that describe intermediate program states. We present an extensive empirical evaluation that considers the effect of removing those variables at different levels of abstraction, and a discussion on the benefits of the proposed approach.
publishDate 2015
dc.date.none.fl_str_mv 2015-01
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/37732
Cuervo Parrino, Bruno; Galeotti, Juan Pablo; Garbervetsky, Diego David; Frias, Marcelo Fabian; TacoFlow: optimizing SAT program verification using dataflow analysis; Springer Heidelberg; Software and Systems Modeling; 14; 1; 1-2015; 45-63
1619-1366
CONICET Digital
CONICET
url http://hdl.handle.net/11336/37732
identifier_str_mv Cuervo Parrino, Bruno; Galeotti, Juan Pablo; Garbervetsky, Diego David; Frias, Marcelo Fabian; TacoFlow: optimizing SAT program verification using dataflow analysis; Springer Heidelberg; Software and Systems Modeling; 14; 1; 1-2015; 45-63
1619-1366
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/s10270-014-0401-9
info:eu-repo/semantics/altIdentifier/url/https://link.springer.com/article/10.1007%2Fs10270-014-0401-9
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
dc.publisher.none.fl_str_mv Springer Heidelberg
publisher.none.fl_str_mv Springer Heidelberg
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_ 1842269496420597760
score 13.13397

Publicaciones similares