Cameleer: A Deductive Verification Tool for OCaml

Pereira, Mário; Ravara, António

doi:10.1007/978-3-030-81688-9_31

Cited by 3 publications

References 29 publications

(22 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

Practical Deductive Verification of OCaml Programs

Pereira

2024

Lecture Notes in Computer Science

View full text Add to dashboard Cite

In this paper, we provide a comprehensive, hands-on tutorial on how to apply deductive verification to programs written in . In particular, we show how one can use the specification language and the tool to conduct mostly-automated verification on code. In our presentation, we focus on two main classes of programs: first, purely functional programs with no mutable state; then on imperative programs, where one can mix mutable state with subtle control-flow primitives, such as locally-defined exceptions.

show abstract

Practical Deductive Verification of OCaml Programs

Pereira

2024

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

A Formalization of Core Why3 in Coq

Cohen,

Johnson-Freyd

2024

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

Intermediate verification languages like Why3 and Boogie have made it much easier to build program verifiers, transforming the process into a logic compilation problem rather than a proof automation one. Why3 in particular implements a rich logic for program specification with polymorphism, algebraic data types, recursive functions and predicates, and inductive predicates; it translates this logic to over a dozen solvers and proof assistants. Accordingly, it serves as a backend for many tools, including Frama-C, EasyCrypt, and GNATProve for Ada SPARK. But how can we be sure that these tools are correct? The alternate foundational approach, taken by tools like VST and CakeML, provides strong guarantees by implementing the entire toolchain in a proof assistant, but these tools are harder to build and cannot directly take advantage of SMT solver automation. As a first step toward enabling automated tools with similar foundational guarantees, we give a formal semantics in Coq for the logic fragment of Why3. We show that our semantics are useful by giving a correct-by-construction natural deduction proof system for this logic, using this proof system to verify parts of Why3's standard library, and proving sound two of Why3's transformations used to convert terms and formulas into the simpler logics supported by the backend solvers.

show abstract

Specification and Verification for Unrestricted Algebraic Effects and Handling

Song,

Foo,

Chin

2024

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

Programming with user-defined effects and effect handlers has many practical use cases involving imperative effects. Additionally, it is natural and powerful to use multi-shot effect handlers for non-deterministic or probabilistic programs that allow backtracking to compute a comprehensive outcome. Existing works for verifying effect handlers are restricted in one of three ways: i) permitting multi-shot continuations under pure setting; ii) allowing heap manipulation for only one-shot continuations; or iii) allowing multi-shot continuations with heap-manipulation but under a restricted frame rule. This work proposes a novel calculus called Effectful Specification Logic (ESL) to support unrestricted effect handlers, where zero-/one-/multi-shot continuations can co-exist with imperative effects and higher-order constructs. ESL captures behaviors in stages, and provides precise models to support invoked effects, handlers and continuations. To show its feasibility, we prototype an automated verification system for this novel specification logic, prove its soundness, report on useful case studies, and present experimental results. With this proposal, we have provided an extended specification logic that is capable of modeling arbitrary imperative higher-order programs with algebraic effects and continuation-enabled handlers.

show abstract

Cameleer: A Deductive Verification Tool for OCaml

Cited by 3 publications

References 29 publications

Practical Deductive Verification of OCaml Programs

Practical Deductive Verification of OCaml Programs

A Formalization of Core Why3 in Coq

Specification and Verification for Unrestricted Algebraic Effects and Handling

Contact Info

Product

Resources

About