The Separation Logic Competition (SL-COMP) is an initiative to bring together researchers and practitioners interested on improving the state of the art of automated deduction methods for Separation Logic. The competition is run on more than 1K decision problems for different theories of Separation Logic. The solvers are compared on each theory on the number of problems solved and the running time. This initiative started at FLOC 2014 and it has been affiliated with different events: SMT-COMP 2014, FLOC 2018 workshop ADSL 2018 and TOOLympics 2019.

• New edition of SL-COMP will take place as part of FLOC 2022 Olympic Games affiliated with IJCAR 2022. The result will be presented on July 31st, 2022, during the ASL workshop.

The competition compares solvers for decision problems in Separation Logic with respect to effectiveness and running time. The competition consists of two phases: a training phase, in which solver developers try their tool on the competition benchmark and may provide feedback to organizers, and an evaluation phase, in which all participating solvers are executed on benchmark problems, and the number of correctly solved instances as well as the runtime is measured.

A decision problem is either a satisfiability or an entailment problem in a fixed fragment of Separation Logic. The possible answers of a solver are: sat, unsat and unknown. The answer is compared with the known status of the problem specified in the problem's file. The result of the comparison determines the evaluation of the solver on this problem, which is correct, incorrect or unsolved.

The problems are specified using the format described here and commented in this post. The input format of problems extends the format SMT-LIB with SL constructs, and exploit the new features of SMT-LIB like datatypes definition and mutually recursive functions.

Teams may contribute with problems in the input format above. The number of problems submitted by a team in some division is limited. The problems submitted are revised by the organizing committee which may or may not accept it. An accepted problem may be changed when this improves the overall quality of the final set of problems.

The solvers shall run on the StarExec platform. Solvers may use a pre-processor to transform the input file format to the solver's format.The time spent on this pre-processor is not included in the evaluation time. The input problems are not scrambled before their submission to he solver.

The set of decision problems collected until now are available for browsing and download on the following GIT repository.

Each problem is contributed by a team, as specified in the file header. Thanks to all participants that contributed programs, sent patches, and commented on the sets.

The file header also specifies the status of the problems (sat, unsat) and, most importantly, the logic fragment used in this problem. A division is defined by its logic fragment. The following division are now present:

• Satisfiability checking:

  • qf_shls_sat: for quantifier free (QF) formulas in the symbolic heaps (SH) fragment using only acyclic singly linked lists
  • qf_shid_sat: for QF formulas in the SH fragment using general inductive definitions (ID)
  • qf_shidlia_sat: for QF formulas in the SH fragment with ID and linear integer constraints (LIA)
  • qf_bsl_sat: for QF fragment with boolean combination of SL atoms; the quantified version of this division bsl_sat has not enough problems to enter in the competition
  • qf_bsllia_sat: for QF fragment with boolean combination of SL atoms and LIA

• Entailment checking:

  • qf_shls_entl: for QF formulas in the SH fragment using only acyclic singly linked lists
  • qf_shid_entl: for QF formulas in the SH fragment with ID
  • qf_shlid_entl: for QF formulas in the SH fragment with linear ID
  • shid_entl: for formulas in the SH fragment with ID
  • qf_shidlia_entl: for formulas in the SH fragment with ID and LIA
  • shidlia_entl: for QF formulas in the SH fragment with IS and LIA

The GIT repository provides tools for parsing the input format (in C, C++ and Ocaml). Based on these tools, the organizing committee provides pre-processors of this input to solvers' input format.

The same repository includes a translator of the input format used for SL-COMP 2014 to the new input format.

The following solvers have participated to at least one edition of SL-COMP:

• Asterix
• ComSPEN
• Cyclist-SL
• CVC4
• Harrsh
• S2S
• Sleek
• Slide
• SLSAT
• Songbird
• SPEN

• SL-COMP 2019 at TOOLympics 2019
• SL-COMP 2018 at FLOC 2018
• SL-COMP 2014 at FLOC 2014

• M. Sighireanu et al. SL-COMP: Competition of Solvers for Separation Logic. TOOLympics'19. PDF
• R. Iosif, C. Serban, A. Reynolds, and M. Sighireanu. Encoding Separation Logic in SMT-LIB v2.5. PDF
• M. Sighireanu and D. R. Cok. Report on SLCOMP 2014. JSAT 2014, PDF

Any question related to this competition shall be sent to the organisation committee and to the organizers.