Sciweavers

14 search results - page 3 / 3
» Intensional Associations in Dataspaces
Sort
View
CAISE
2006
Springer
13 years 9 months ago
An Interactive, Asymmetric and Extensional Method for Matching Conceptual Hierarchies
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...
Jérôme David, Fabrice Guillet, R&eacu...
POPL
2004
ACM
14 years 5 months ago
Simple relational correctness proofs for static analyses and program transformations
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...
Nick Benton
APLAS
2006
ACM
13 years 11 months ago
A Bytecode Logic for JML and Types
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...
Lennart Beringer, Martin Hofmann
JUCS
2006
89views more  JUCS 2006»
13 years 5 months ago
Process Equivalences as Global Bisimulations
: 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...