SL-COMP: Competition of Solvers for Separation Logic

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.

[1]  James Brotherston,et al.  A decision procedure for satisfiability in separation logic with inductive predicates , 2014, CSL-LICS.

[2]  Andrey Rybalchenko,et al.  Separation Logic Modulo Theories , 2013, APLAS.

[3]  Wei-Ngan Chin,et al.  Automated lemma synthesis in symbolic-heap separation logic , 2017, Proc. ACM Program. Lang..

[4]  Shengchao Qin,et al.  Automated Verification of Shape, Size and Bag Properties , 2007, ICECCS.

[5]  Jun Sun,et al.  Frame Inference for Inductive Entailment Proofs in Separation Logic , 2018, TACAS.

[6]  Wei-Ngan Chin,et al.  Automated Mutual Explicit Induction Proof in Separation Logic , 2016, FM.

[7]  Constantin Enea,et al.  On Automated Lemma Generation for Separation Logic with Inductive Definitions , 2015, ATVA.

[8]  Taolue Chen,et al.  A Complete Decision Procedure for Linearly Compositional Separation Logic with Data Constraints , 2016, IJCAR.

[9]  John C. Reynolds,et al.  Intuitionistic reasoning about shared mutable data structure , 1999 .

[10]  Radu Iosif,et al.  The Tree Width of Separation Logic with Recursive Definitions , 2013, CADE.

[11]  Cristina Serban,et al.  A Decision Procedure for Separation Logic in SMT , 2016, ATVA.

[12]  Florian Zuleger,et al.  Unified Reasoning About Robustness Properties of Symbolic-Heap Separation Logic , 2016, ESOP.

[13]  Constantin Enea,et al.  Compositional entailment checking for a fragment of separation logic , 2014, Formal Methods in System Design.

[14]  Peter W. O'Hearn,et al.  Separation logic , 2019, Commun. ACM.

[15]  Stéphane Demri,et al.  Separation logics and modalities: a survey , 2015, J. Appl. Non Class. Logics.

[16]  Cristina Serban,et al.  Encoding Separation Logic in SMT-LIB v2.5 , 2018 .

[17]  James Brotherston,et al.  A Generic Cyclic Theorem Prover , 2012, APLAS.

[18]  Peter W. O'Hearn,et al.  Local Reasoning about Programs that Alter Data Structures , 2001, CSL.

[19]  Mihaela Sighireanu,et al.  Report on SL-COMP 2014 , 2014, J. Satisf. Boolean Model. Comput..

[20]  Florian Zuleger,et al.  Harrsh: A Tool for Unied Reasoning about Symbolic-Heap Separation Logic , 2018, LPAR.

[21]  Tomás Vojnar,et al.  Deciding Entailments in Inductive Separation Logic with Tree Automata , 2014, ATVA.

[22]  John C. Reynolds,et al.  Separation logic: a logic for shared mutable data structures , 2002, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science.

[23]  Joël Ouaknine,et al.  Foundations for Decision Problems in Separation Logic with General Inductive Predicates , 2014, FoSSaCS.