Combining higher-order model checking with refinement type inference

Satô, Ryôsuke; Iwayama, Naoki; Kobayashi, Naoki

doi:10.1145/3294032.3294081

Cited by 7 publications

(3 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A CHC solver provides a common infrastructure for a variety of programming languages and properties to be verified. There have been effective CHC solvers [40,18,29,12] that can solve instances obtained from actual programs 2 and many program verification tools [23,37,25,28,38,60] use a CHC solver as a backend.…”

Section: Introductionmentioning

confidence: 99%

RustHorn: CHC-Based Verification for Rust Programs

Matsushita¹,

Tsukada²,

Kobayashi³

2020

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Reduction to the satisfiablility problem for constrained Horn clauses (CHCs) is a widely studied approach to automated program verification. The current CHC-based methods for pointer-manipulating programs, however, are not very scalable. This paper proposes a novel translation of pointer-manipulating Rust programs into CHCs, which clears away pointers and heaps by leveraging ownership. We formalize the translation for a simplified core of Rust and prove its correctness. We have implemented a prototype verifier for a subset of Rust and confirmed the effectiveness of our method. 17 The first character of each variable indicates the pointer kind (o/m corresponds to own/mutα). We swap the branches of the match statement in take-max, to fit the order to C/Rust's if.

show abstract

Section: Introductionmentioning

confidence: 99%

RustHorn: CHC-Based Verification for Rust Programs

Matsushita¹,

Tsukada²,

Kobayashi³

2020

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

show abstract

“…Besides, the combination of refinement types with automatic techniques like predicate abstraction [57], abstract interpretation [34], or SMT solvers [66,65] has been particularly successful. More recently, the combination of refinement types inference with HOMC has been investigated [59].…”

Section: Discussionmentioning

confidence: 99%

Temporal Refinements for Guarded Recursive Types

Jaber

Riba

2021

Programming Languages and Systems

View full text Add to dashboard Cite

We propose a logic for temporal properties of higher-order programs that handle infinite objects like streams or infinite trees, represented via coinductive types. Specifications of programs use safety and liveness properties. Programs can then be proven to satisfy their specification in a compositional way, our logic being based on a type system.The logic is presented as a refinement type system over the guarded $$\lambda $$ λ -calculus, a $$\lambda $$ λ -calculus with guarded recursive types. The refinements are formulae of a modal $$\mu $$ μ -calculus which embeds usual temporal modal logics such as and . The semantics of our system is given within a rich structure, the topos of trees, in which we build a realizability model of the temporal refinement type system.

show abstract

“…Constrained Horn Clauses (CHCs) are a convenient intermediate verification language that can be generated by several verification tools in many settings, ranging from verification of smart contracts [16] to verification of computer programs in various languages [10,11,15,22,34]. The CHC interchange language provides a separation of concerns, allowing the designers of verification systems to focus on high-level aspects like the applied proof rules and verification methodology, while giving CHC solver developers a clean framework that can be instantiated using various model checking algorithms and specialised decision procedures.…”

Section: Introductionmentioning

confidence: 99%

A Theory of Heap for Constrained Horn Clauses (Extended Technical Report)

Esen,

Rümmer

2021

Preprint

View full text Add to dashboard Cite

Constrained Horn Clauses (CHCs) are an intermediate program representation that can be generated by several verification tools, and that can be processed and solved by a number of Horn solvers. One of the main challenges when using CHCs in verification is the encoding of heap-allocated data-structures: such data-structures are today either represented explicitly using the theory of arrays, or transformed away with the help of invariants or refinement types, defeating the purpose of CHCs as a representation that is language-independent as well as agnostic of the algorithm implemented by the Horn solver. This paper presents an SMT-LIB theory of heap tailored to CHCs, with the goal of enabling a standard interchange format for programs with heap data-structures. We introduce the syntax of the theory of heap, define its semantics in terms of axioms and using a reduction to SMT-LIB arrays and data-types, and discuss its properties and outline possible extensions and future work.

show abstract

Combining higher-order model checking with refinement type inference

Cited by 7 publications

References 23 publications

RustHorn: CHC-Based Verification for Rust Programs

RustHorn: CHC-Based Verification for Rust Programs

Temporal Refinements for Guarded Recursive Types

A Theory of Heap for Constrained Horn Clauses (Extended Technical Report)

Contact Info

Product

Resources

About