Generic Approach to Certified Static Checking of Module-like Constructs

06/19/2017
by   Julia Belyakova, et al.
0

In this paper we consider the problem of certified static checking of module-like constructs of programming languages. We argue that there are algorithms and properties related to modules that can be defined and proven in an abstract way. We advocate the design of a generic Coq library, which is aimed to provide three building blocks for each checking mechanism: propositional, computable, and correctness proofs. Implemented part of the library is justified by applying it to a certified static checker of an extension of STLC.

READ FULL TEXT

page 1

page 2

research
12/31/2018

Generic Programming in OCaml

We present a library for generic programming in OCaml, adapting some tec...
research
05/18/2017

Exploiting Term Hiding to Reduce Run-time Checking Overhead

One of the most attractive features of untyped languages is the flexibil...
research
09/07/2017

On the Complexity of ATL and ATL* Module Checking

Module checking has been introduced in late 1990s to verify open systems...
research
03/31/2018

Generic Description of Well-Scoped, Well-Typed Syntaxes

We adapt the technique of type-generic programming via descriptions poin...
research
11/04/2021

A thread-safe Term Library

Terms are one of the fundamental data structures for computing. E.g. eve...
research
06/14/2019

Extensions of Generic DOL for Generic Ontology Design Patterns

Generic ontologies were introduced as an extension (Generic DOL) of the ...
research
11/23/2022

Data-Codata Symmetry and its Interaction with Evaluation Order

Data types and codata types are, as the names suggest, often seen as dua...

Please sign up or login with your details

Forgot password? Click here to reset