In EDS ansehen

Proving termination through conditional termination

Gespeichert in:
Bibliographische Detailangaben
Titel: Proving termination through conditional termination
Autoren: Universitat Politècnica de Catalunya. Departament de Ciències de la Computació, Universitat Politècnica de Catalunya. LOGPROG - Lògica i Programació, Borralleras Andreu, Cristina, Brockschmidt, Marc, Larraz Hurtado, Daniel, Oliveras Llunell, Albert, Rodríguez Carbonell, Enric, Rubio Gimeno, Alberto
Verlagsinformationen: Springer 2017
Publikationsart: Electronic Resource
Abstract: We present a constraint-based method for proving conditional termination of integer programs. Building on this, we construct a framework to prove (unconditional) program termination using a powerful mechanism to combine conditional termination proofs. Our key insight is that a conditional termination proof shows termination for a subset of program execution states which do not need to be considered in the remaining analysis. This facilitates more effective termination as well as non-termination analyses, and allows handling loops with different execution phases naturally. Moreover, our method can deal with sequences of loops compositionally. In an empirical evaluation, we show that our implementation VeryMax outperforms state-of-the-art tools on a range of standard benchmarks.
Peer Reviewed
Postprint (author's final draft)
Index Begriffe: Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica, Integer programming, Ranking function, Entry transition, Program component, Satisfiability modulo theory, Program transformation, Programació en nombres enters, Conference report
URL: https://hdl.handle.net/2117/179916
https://link.springer.com/chapter/10.1007/978-3-662-54577-5_6
https://link.springer.com/chapter/10.1007/978-3-662-54577-5_6
info:eu-repo/grantAgreement/EC/H2020/648276/EU/A Unified Theory of Algorithmic Relaxations/AUTAR
info:eu-repo/grantAgreement/MINECO//TIN2015-69175-C4-3-R/ES/SOLUCIONES EFECTIVAS BASADAS EN LA LOGICA
Verfügbarkeit: Open access content. Open access content
Open Access
Anmerkung: 19 p.
application/pdf
English
Other Numbers: HGF oai:upcommons.upc.edu:2117/179916
Borralleras, C. [et al.]. Proving termination through conditional termination. A: International Conference on Tools and Algorithms for the Construction and Analysis of Systems. "Tools and Algorithms for the Construction and Analysis of Systems, 23rd International Conference, TACAS 2017: held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017: Uppsala, Sweden, April 22-29, 2017: proceedings, part I". Berlín: Springer, 2017, p. 99-117.
978-3-662-54577-5
10.1007/978-3-662-54577-5_6
1151825484
Originalquelle: UNIV POLITECNICA DE CATALUNYA
From OAIster®, provided by the OCLC Cooperative.
Dokumentencode: edsoai.on1151825484
Datenbank: OAIster
Beschreibung
Abstract:We present a constraint-based method for proving conditional termination of integer programs. Building on this, we construct a framework to prove (unconditional) program termination using a powerful mechanism to combine conditional termination proofs. Our key insight is that a conditional termination proof shows termination for a subset of program execution states which do not need to be considered in the remaining analysis. This facilitates more effective termination as well as non-termination analyses, and allows handling loops with different execution phases naturally. Moreover, our method can deal with sequences of loops compositionally. In an empirical evaluation, we show that our implementation VeryMax outperforms state-of-the-art tools on a range of standard benchmarks.<br />Peer Reviewed<br />Postprint (author's final draft)