5 citations · 6 across the 5 of their papers we have counts for
4 papers · 1 filter
Binding Logic: proofs and models
Gilles Dowek, Thérèse Hardin, Claude Kirchner
We define an extension of predicate logic, called Binding Logic, where variables can be bound in terms and in propositions. We introduce a notion of model for this logic and prove…
Yet Another Deep Embedding of B:Extending de Bruijn Notations
Eric Jaeger, Thérèse Hardin
We present Bicoq3, a deep embedding of the B system in Coq, focusing on the technical aspects of the development. The main subjects discussed are related to the representation of s…
A Few Remarks About Formal Development of Secure Systems
Eric Jaeger, Thérèse Hardin
Formal methods provide remarkable tools allowing for high levels of confidence in the correctness of developments. Their use is therefore encouraged, when not required, for the dev…
On the implementation of construction functions for non-free concrete data types
Frédéric Blanqui, Thérèse Hardin, Pierre Weis
Many algorithms use concrete data types with some additional invariants. The set of values satisfying the invariants is often a set of representatives for the equivalence classes o…