SL-COMP: Competition of Solvers for Separation Logic

Abstract : SL-COMP aims at bringing together researchers interested on improving the state of the art of the automated deduction methods for Separation Logic (SL). The event took place twice until now and collected more than 1K problems for different fragments of SL. The input format of problems is based on the SMT-LIB format and therefore fully typed; only one new command is added to SMT-LIB's list, the command for the declaration of the heap's type. The SMT-LIB theory of SL comes with ten logics, some of them being combinations of SL with linear arithmetics. The competition's divisions are defined by the logic fragment, the kind of decision problem (satisfiability or entailment) and the presence of quantifiers. Until now, SL-COMP has been run on the StarExec platform, where the benchmark set and the binaries of participant solvers are freely available. The benchmark set is also available with the competition's documentation on a public repository in GitHub.
Document type :
Conference papers
Complete list of metadatas

Cited literature [31 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02388022
Contributor : Radu Iosif <>
Submitted on : Saturday, November 30, 2019 - 8:10:33 PM
Last modification on : Monday, December 2, 2019 - 10:55:14 AM

File

main.pdf
Files produced by the author(s)

Identifiers

Citation

Mihaela Sighireanu, Juan Navarro Pérez, Andrey Rybalchenko, Nikos Gorogiannis, Radu Iosif, et al.. SL-COMP: Competition of Solvers for Separation Logic. Tools and Algorithms for the Construction and Analysis of Systems - 25 Years of TOOLympics, Held as Part of 2019, Apr 2019, Prague, Czech Republic. pp.116-132, ⟨10.1007/978-3-030-17502-3_8⟩. ⟨hal-02388022⟩

Share

Metrics

Record views

20

Files downloads

14