Verification Playground aims to provide a platform where researchers and practitioners interested in formal verification can interact. By providing an environment where people can work with and test formal tools, the event enables the research community to gauge the usability of formal verification, as well as the state of progress in this area.
Challenges are designed to target different kinds of properties and programs; this is intended to avoid any specialization or exclusivity on verification approaches. It is not always possible to design a challenge that is appropriate for every verification tool, though.
For example, some of the challenges require a data structure, and it is therefore difficult to make sure that every team is able to deal with a given input. We find that the input data structure has an impact on whether or not teams will be able to verify correctly; in general, more teams succeed when the input is a scalar (or a list or an array).
Another factor that may contribute to the ease of verification is how much time participants spend on it. We found that teams that spent more time on a particular part of the 검증놀이터 task were better at it; this is because they are less likely to be distracted by details that might not be central to the algorithm's behavior. For example, we found that the multiplication algorithm in challenge 1 was not simple and required a lot of attention to fill in the associativity and commutativity properties of arithmetic operations.
0 comments:
Post a Comment