Logo Logo
Hilfe
Hilfe
Switch Language to English

Beyer, Dirk ORCID logoORCID: https://orcid.org/0000-0003-4832-7662; Kanav, Sudeep ORCID logoORCID: https://orcid.org/0000-0001-6078-4175 und Richter, Cedric ORCID logoORCID: https://orcid.org/0000-0003-2906-6508 (2022): Construction of Verifier Combinations Based on Off-the-Shelf Verifiers. . In: Fundamental Approaches to Software Engineering. 25th International Conference, FASE 2022, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022, Munich, Germany, April 2–7, 2022, Proceedings, Lecture Notes in Computer Science Bd. 13241 Cham, Switzerland: Springer. S. 49-70

Volltext auf 'Open Access LMU' nicht verfügbar.

Abstract

Software verifiers have different strengths and weaknesses, depending on properties of the verification task. It is well-known that combinations of verifiers via portfolio and selection approaches can help to combine the strengths. In this paper, we investigate (a) how to easily compose such combinations from existing, ‘off-the-shelf’ verification tools without changing them and (b) how much performance improvement easy combinations can yield, regarding the effectiveness (number of solved problems) and efficiency (consumed resources). First, we contribute a method to systematically and conveniently construct verifier combinations from existing tools, using the composition framework CoVeriTeam. We consider sequential portfolios, parallel portfolios, and algorithm selections. Second, we perform a large experiment on 8 883 verification tasks to show that combinations can improve the verification results without additional computational resources. All combinations are constructed from off-the-shelf verifiers, that is, we use them as published. The result of our work suggests that users of verification tools can achieve a significant improvement at a negligible cost (only configure our composition scripts).

Dokument bearbeiten Dokument bearbeiten