Report on SL-COMP 2014 | Zendy

Mihaela Sighireanu | Zendy; David R. Cok | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Report on SL-COMP 2014

Author(s) -

Mihaela Sighireanu,

David R. Cok

Publication year - 2016

Publication title -

journal on satisfiability boolean modeling and computation

Language(s) - English

Resource type - Journals

eISSN - 1875-5011

pISSN - 1574-0617

DOI - 10.3233/sat190107

Subject(s) - fragment (logic) , event (particle physics) , competition (biology) , solver , computer science , textual entailment , boolean satisfiability problem , satisfiability , symbolic execution , programming language , logical consequence , theoretical computer science , artificial intelligence , ecology , physics , software , quantum mechanics , biology

A competition of solvers for Separation Logic was held in May 2014, as an unofficial satellite event of the FLoC Olympic Games. Six solvers participated in the competition; the success and performance of each solver was measured over an appropriate subset of a library of benchmarks accumulated for the purpose. The benchmarks consisted of satisfiability and entailment problems over formulas in the fragment of symbolic heaps with inductive definitions, which is the fragment of Separation Logic that is most used in program analysis and verification tools. We report in this paper on the competition rules, the participants, the results, the findings, and the future of this event.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research