Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

Temporal Refinements for Guarded Recursive Types (full version)

Guilhem Jaber 1, 2 Colin Riba 3 
2 GALLINETTE - Gallinette : vers une nouvelle génération d'assistant à la preuve
Inria Rennes – Bretagne Atlantique , LS2N - Laboratoire des Sciences du Numérique de Nantes
3 PLUME - Preuves et Langages
LIP - Laboratoire de l'Informatique du Parallélisme
Abstract : We propose a logic to reason on temporal properties of higher-order programs that handle infinite objects like streams or infinite trees, represented via coinductive types. Specifications of programs are defined using safety and liveness properties. A given program can then be proven to satisfy its 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 λ-calculus with guarded recursive types. The refinements are formulae of a modal μ-calculus which embeds usual temporal modal logics such as LTL and CTL. 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. We use in a crucial way the connection with set-theoretic semantics to handle liveness properties.
Document type :
Preprints, Working Papers, ...
Complete list of metadata

https://hal.archives-ouvertes.fr/hal-02512655
Contributor : Colin Riba Connect in order to contact the contributor
Submitted on : Sunday, March 14, 2021 - 4:57:57 PM
Last modification on : Thursday, September 29, 2022 - 2:58:07 PM

File

reftrees.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02512655, version 5

Citation

Guilhem Jaber, Colin Riba. Temporal Refinements for Guarded Recursive Types (full version). 2021. ⟨hal-02512655v5⟩

Share

Metrics

Record views

278

Files downloads

152