JTACO: Test Execution for Faster Bounded Verification

Autores
Kampmann, Alexander; Galeotti, Juan Pablo; Zeller, Andreas
Año de publicación
2014
Idioma
inglés
Tipo de recurso
artículo
Estado
versión publicada
Descripción
In bounded program verification a finite set of execution traces is exhaustively checked in order to find violations to a given specification (i.e. errors). SAT-based bounded verifiers rely on SAT-Solvers as their back-end decision procedure, accounting for most of the execution time due to their exponential time complexity. In this paper we sketch a novel approach to improve SAT-based bounded verification. As modern SAT-Solvers work by augmenting partial assignments, the key idea is to translate some of these partial assignments into JUnit test cases during the SAT-Solving process. If the execution of the generated test cases succeeds in finding an error, the SAT-Solver is promptly stopped. We implemented our approach in JTACO, an extension to the TACO bounded verifier, and evaluate our prototype by verifying parameterized unit tests of several complex data structures.
Fil: Kampmann, Alexander. Universitat Saarland; Alemania
Fil: Galeotti, Juan Pablo. Universitat Saarland; Alemania. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
Fil: Zeller, Andreas. Universitat Saarland; Alemania
Materia
Taco
Bounded Verification
Testing
Sat-Solving
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/41629
Acceder
id CONICETDig_2aa8bbc6ad15e58f00bdf741971c1fb9
oai_identifier_str oai:ri.conicet.gov.ar:11336/41629
network_acronym_str CONICETDig
repository_id_str 3498
network_name_str CONICET Digital (CONICET)
spelling JTACO: Test Execution for Faster Bounded VerificationKampmann, AlexanderGaleotti, Juan PabloZeller, AndreasTacoBounded VerificationTestingSat-Solvinghttps://purl.org/becyt/ford/2.2https://purl.org/becyt/ford/2In bounded program verification a finite set of execution traces is exhaustively checked in order to find violations to a given specification (i.e. errors). SAT-based bounded verifiers rely on SAT-Solvers as their back-end decision procedure, accounting for most of the execution time due to their exponential time complexity. In this paper we sketch a novel approach to improve SAT-based bounded verification. As modern SAT-Solvers work by augmenting partial assignments, the key idea is to translate some of these partial assignments into JUnit test cases during the SAT-Solving process. If the execution of the generated test cases succeeds in finding an error, the SAT-Solver is promptly stopped. We implemented our approach in JTACO, an extension to the TACO bounded verifier, and evaluate our prototype by verifying parameterized unit tests of several complex data structures.Fil: Kampmann, Alexander. Universitat Saarland; AlemaniaFil: Galeotti, Juan Pablo. Universitat Saarland; Alemania. Consejo Nacional de Investigaciones Científicas y Técnicas; ArgentinaFil: Zeller, Andreas. Universitat Saarland; AlemaniaSpringer2014-07info: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/41629Kampmann, Alexander; Galeotti, Juan Pablo; Zeller, Andreas; JTACO: Test Execution for Faster Bounded Verification; Springer; Lecture Notes in Computer Science; 8570; 7-2014; 134-1410302-9743CONICET DigitalCONICETenginfo:eu-repo/semantics/altIdentifier/doi/10.1007/978-3-319-09099-3_10info:eu-repo/semantics/altIdentifier/url/https://link.springer.com/chapter/10.1007%2F978-3-319-09099-3_10info: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:50:44Zoai:ri.conicet.gov.ar:11336/41629instacron: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:50:44.719CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicasfalse
dc.title.none.fl_str_mv JTACO: Test Execution for Faster Bounded Verification
title JTACO: Test Execution for Faster Bounded Verification
spellingShingle JTACO: Test Execution for Faster Bounded Verification
Kampmann, Alexander
Taco
Bounded Verification
Testing
Sat-Solving
title_short JTACO: Test Execution for Faster Bounded Verification
title_full JTACO: Test Execution for Faster Bounded Verification
title_fullStr JTACO: Test Execution for Faster Bounded Verification
title_full_unstemmed JTACO: Test Execution for Faster Bounded Verification
title_sort JTACO: Test Execution for Faster Bounded Verification
dc.creator.none.fl_str_mv Kampmann, Alexander
Galeotti, Juan Pablo
Zeller, Andreas
author Kampmann, Alexander
author_facet Kampmann, Alexander
Galeotti, Juan Pablo
Zeller, Andreas
author_role author
author2 Galeotti, Juan Pablo
Zeller, Andreas
author2_role author
author
dc.subject.none.fl_str_mv Taco
Bounded Verification
Testing
Sat-Solving
topic Taco
Bounded Verification
Testing
Sat-Solving
purl_subject.fl_str_mv https://purl.org/becyt/ford/2.2
https://purl.org/becyt/ford/2
dc.description.none.fl_txt_mv In bounded program verification a finite set of execution traces is exhaustively checked in order to find violations to a given specification (i.e. errors). SAT-based bounded verifiers rely on SAT-Solvers as their back-end decision procedure, accounting for most of the execution time due to their exponential time complexity. In this paper we sketch a novel approach to improve SAT-based bounded verification. As modern SAT-Solvers work by augmenting partial assignments, the key idea is to translate some of these partial assignments into JUnit test cases during the SAT-Solving process. If the execution of the generated test cases succeeds in finding an error, the SAT-Solver is promptly stopped. We implemented our approach in JTACO, an extension to the TACO bounded verifier, and evaluate our prototype by verifying parameterized unit tests of several complex data structures.
Fil: Kampmann, Alexander. Universitat Saarland; Alemania
Fil: Galeotti, Juan Pablo. Universitat Saarland; Alemania. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
Fil: Zeller, Andreas. Universitat Saarland; Alemania
description In bounded program verification a finite set of execution traces is exhaustively checked in order to find violations to a given specification (i.e. errors). SAT-based bounded verifiers rely on SAT-Solvers as their back-end decision procedure, accounting for most of the execution time due to their exponential time complexity. In this paper we sketch a novel approach to improve SAT-based bounded verification. As modern SAT-Solvers work by augmenting partial assignments, the key idea is to translate some of these partial assignments into JUnit test cases during the SAT-Solving process. If the execution of the generated test cases succeeds in finding an error, the SAT-Solver is promptly stopped. We implemented our approach in JTACO, an extension to the TACO bounded verifier, and evaluate our prototype by verifying parameterized unit tests of several complex data structures.
publishDate 2014
dc.date.none.fl_str_mv 2014-07
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/41629
Kampmann, Alexander; Galeotti, Juan Pablo; Zeller, Andreas; JTACO: Test Execution for Faster Bounded Verification; Springer; Lecture Notes in Computer Science; 8570; 7-2014; 134-141
0302-9743
CONICET Digital
CONICET
url http://hdl.handle.net/11336/41629
identifier_str_mv Kampmann, Alexander; Galeotti, Juan Pablo; Zeller, Andreas; JTACO: Test Execution for Faster Bounded Verification; Springer; Lecture Notes in Computer Science; 8570; 7-2014; 134-141
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-09099-3_10
info:eu-repo/semantics/altIdentifier/url/https://link.springer.com/chapter/10.1007%2F978-3-319-09099-3_10
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
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_ 1842269050821935104
score 13.13397

Publicaciones similares