In this paper, we make an attempt to use Inductive Logic Programming (ILP) to automatically learn non trivial descriptions of symbols, based on a formal description. This work is ...
Abstract. In previous research, we presented a dynamicprogramming-based EM (expectation-maximization) algorithm for parameterized logic programs, which is based on the structure sh...
—In this paper, we propose a formal analysis of domain extenders for hash functions in the indifferentiability framework. We define a general model for domain extenders and prov...
Marion Daubignard, Pierre-Alain Fouque, Yassine La...
This work presents a framework for fusing flow analysis and theorem proving called logic-flow analysis (LFA). The framework itthe reduced product of two abstract interpretations: ...
Abstract. We present a declarative method for diagnosing missing computed answers in CFLP(D), a generic scheme for lazy Constraint Functional-Logic Programming which can be instant...