Fragment definition comp8/19/2023 This solution was created in Part 1, and the class was created in Part 2. Step 2: Open your newly created MP solution, and open Solution Explorer. I will update these often as I enhance and add new ones, so check back often for new versions. Step 1: Download and extract the sample MP fragments. In our next example fragment – we will monitor a service by creating a monitor that targets our custom class. Please subscribe to the Slack channel to participate to the competition.This is Part 3 in a series of posts described here: JSAT 2014,Īny question related to this competition shall be sent to Encoding Separation Logic in SMT-LIB v2.5. SL-COMP: Competition of Solvers for Separation Logic. The following solvers have participated to at least one edition of SL-COMP: The same repository includes a translator of the input format used for SL-COMP 2014 to the new input format. The GIT repository provides tools for parsing the input format (in C, C++ and Ocaml).īased on these tools, the organizing committee provides pre-processors of this input to solvers’ input format. Has not enough problems to enter in the competitionįor QF fragment with boolean combination of SL atoms and LIAįor QF formulas in the SH fragment using only acyclic singly linked listsįor QF formulas in the SH fragment with IDįor QF formulas in the SH fragment with linear IDįor formulas in the SH fragment with ID and LIAįor QF formulas in the SH fragment with IS and LIA The quantified version of this division bsl_sat The following division are now present:įor quantifier free (QF) formulas in the symbolic heaps (SH) fragment using only acyclic singly linked listsįor QF formulas in the SH fragment using general inductive definitions (ID)įor QF formulas in the SH fragment with ID and linear integer constraints (LIA)įor QF fragment with boolean combination of SL atoms A division is defined by its logic fragment. The file header also specifies the status of the problems ( sat, unsat) and, most importantly, the logic fragment used in this problem. Many thanks to all contributors with tools, patches, and commented on the benchmark. The set of decision problems collected until now are available for browsing and download on the following GIT repository.Įach problem is contributed by a team, as specified in the file header. The input problems are not scrambled before their submission to the solver. The time spent on this pre-processor is not included in the evaluation time. Solvers may use a pre-processor to transform the input file format to the solver’s format. The solvers shall run on the StarExec platform. An accepted problem may be changed when this improves the overall quality of the final set of problems. The problems submitted are revised by the organizing committee which may or may not accept them. The number of problems submitted by a team in some division is limited. Teams may contribute with problems in the input format above. 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. The problems are specified using the format described here and commented in this post. The result of the comparison determines the evaluation of the solver on this problem, which is correct, incorrect or unsolved. The answer is compared with the known status of the problem specified in the problem’s file. The possible answers of a solver are: sat, unsat and unknown. 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.Ī decision problem is either a satisfiability or an entailment problem in a fixed fragment of Separation Logic. The competition compares solvers for decision problems in Separation Logic with respect to effectiveness and running time.
0 Comments
Leave a Reply.AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |