Compiling higher-order specifications to SMT solvers: how to deal with rejection constructively

Daggitt, Matthew L., Atkey, Robert, Kokke, Wen, Komendantskaya, Ekaterina and Arnaboldi, Luca (2023) Compiling higher-order specifications to SMT solvers: how to deal with rejection constructively. Krebbers, Robbert, Traytel, Dmitriy, Pientka, Brigitte and Zdancewic, Steve (eds.) In CPP 2023 - Proceedings of the 12th ACM SIGPLAN International Conference on Certified Programs and Proofs, co-located with POPL 2023. Association for Computing Machinery. pp. 102-120 . (doi:10.1145/3573105.3575674).

Abstract

Modern verification tools frequently rely on compiling high-level specifications to SMT queries. However, the high-level specification language is usually more expressive than the available solvers and therefore some syntactically valid specifications must be rejected by the tool. In such cases, the challenge is to provide a comprehensible error message to the user that relates the original syntactic form of the specification to the semantic reason it has been rejected. In this paper we demonstrate how this analysis may be performed by combining a standard unification-based type-checker with type classes and automatic generalisation. Concretely, type-checking is used as a constructive procedure for under-approximating whether a given specification lies in the subset of problems supported by the solver. Any resulting proof of rejection can be transformed into a detailed explanation to the user. The approach is compositional and does not require the user to add extra typing annotations to their program. We subsequently describe how the type system may be leveraged to provide a sound and complete compilation procedure from suitably typed expressions to SMT queries, which we have verified in Agda.

This record has no associated files available for download.

Contributors

Download statistics