Property-Directed Inference of Relational Invariants

• Main Author: Dmitry A. Mordvinov
• Format: Article
• Language: English
• Published: Yaroslavl State University 2019-12-01
• Series: Modelirovanie i Analiz Informacionnyh Sistem
• Subjects: relational verification; constrained horn clauses; property-directed reachability; relational invariants
• Online Access: https://www.mais-journal.ru/jour/article/view/1276

Property Directed Reachability (PDR) is an efficient and scalable approach to solving systems of symbolic constraints also known as Constrained Horn Clauses (CHC). In the case of non-linear CHCs, which may arise, e.g., from relational verification tasks, PDR aims to infer an inductive invariant for each uninterpreted predicate. However, in many practical cases this reasoning is not successful, as invariants should be derived for groups of predicates instead of individual predicates. The article describes a novel algorithm that identifies these groups automatically and complements the existing PDR technique. The key feature of the algorithm is that it does not require a possibly expensive synchronization transformation over the system of CHCs. We have implemented the algorithm on top of a up-to-date CHC solver Spacer. Our experimental evaluation shows that for some CHC systems, on which existing solvers diverge, our tool is able to discover relational invariants.