10 citations · 18 across the 6 of their papers we have counts for
6 papers
Dedukti: a Logical Framework based on the -Calculus Modulo Theory
Ali Assaf, Guillaume Burel, Raphaël Cauderlier +7
Dedukti is a Logical Framework based on the -Calculus Modulo Theory. We show that many theories can be expressed in Dedukti: constructive and classical predicate logic, Simpl…
Comparing EventB, and Why3 Models of Sparse Sets
Maximiliano Cristiá, Catherine Dubois
Many representations for sets are available in programming languages libraries. The paper focuses on sparse sets used, e.g., in some constraint solvers for representing integer var…
Automatic Synthesis of Random Generators for Numerically Constrained Algebraic Recursive Types
Ghiles Ziat, Vincent Botbol, Matthieu Dien +3
In program verification, constraint-based random testing is a powerful technique which aims at generating random test cases that satisfy functional properties of a program. However…
LibNDT: Towards a Formal Library on Spreadable Properties over Linked Nested Datatypes
Mathieu Montin, Amélie Ledein, Catherine Dubois
Nested datatypes have been widely studied in the past 25 years, both theoretically using category theory, and practically in programming languages such as Haskell. They consist in…
Tableaux Modulo Theories Using Superdeduction
Mélanie Jacquel, Karim Berkani, David Delahaye +1
We propose a method that allows us to develop tableaux modulo theories using the principles of superdeduction, among which the theory is used to enrich the deduction system with ne…
Proceedings 1st Workshop on Formal Integrated Development Environment
Catherine Dubois, Dimitra Giannakopoulou, Dominique Méry
This volume contains the proceedings of F-IDE 2014, the first international workshop on Formal Integrated Development Environment, which was held as an ETAPS 2014 satellite event,…