Uma nova estrutura baseada em digrafos e denominada Grafos com Matrizes de Medida
(MWGs) é apresentada. Esta estrutura se baseia na estrutura conhecida como Grafos de …

We refine matrix interpretations for proving termination and complexity bounds of term
rewrite systems we restricting them to domains that satisfy a system of linear inequalities …

This thesis is concerned with automated termination analysis of first-order term rewrite
systems.“Lazy Termination Analysis” addresses various termination arguments and brings …

A biform theory is a combination of an axiomatic theory and an algorithmic theory. It is used
to integrate reasoning and computation in a common theory and can include algorithms with …

7. Abstract Completion, Formalized 135 7.1. Introduction................................... 135 7.2.
Preliminaries.................................. 138 7.2. 1. Rewrite Systems............................ 138 7.2. 2 …

The teaching of computer science has become essential in the majority of educational
programs. Therefore, many programming languages were born with the will to propose a …

Dans ce document, je présente une synthèse de mon travail de recherche et d'encadrement
depuis l'obtention de mon doctorat en septembre 2001 [Bla01b]. Il présente en particulier …

We consider the problem of formally verifying an algorithm in a proof assistant and
generating efficient code. Reasoning about correctness is best done at an abstract level, but …

Making sure that a computer program behaves as expected, especially in critical
applications (health, transport, energy, communications, etc.), is more and more important …