![]() ![]() 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 |