Our work deals with schema or ontology matching and is driven by the following statements: (1) Most of works only consider intensional description of schemas; (2) They mostly use s...
We show how some classical static analyses for imperative programs, and the optimizing transformations which they enable, may be expressed and proved correct using elementary logi...
This document contains the Isabelle/HOL sources underlying our paper A bytecode logic for JML and types [2], updated to Isabelle 2008. We present a program logic for a subset of s...
: Bisimulation can be defined in a simple way using coinductive methods, and has rather pleasant properties. Ready similarity was proposed by Meyer et al. as a way to weakening the...
David de Frutos-Escrig, Carlos Gregorio-Rodr&iacut...