Sciweavers

394 search results - page 38 / 79
» Structure Preserving Semantic Matching
Sort
View
PLDI
2011
ACM
14 years 2 months ago
Evaluating value-graph translation validation for LLVM
Translation validators are static analyzers that attempt to verify that program transformations preserve semantics. Normalizing translation validators do so by trying to match the...
Jean-Baptiste Tristan, Paul Govereau, Greg Morrise...
LISP
2006
105views more  LISP 2006»
14 years 11 months ago
Call-by-push-value: Decomposing call-by-value and call-by-name
We present the call-by-push-value (CBPV) calculus, which decomposes the typed call-by-value (CBV) and typed call-by-name (CBN) paradigms into fine-grain primitives. On the operatio...
Paul Blain Levy
CC
2005
Springer
195views System Software» more  CC 2005»
15 years 1 months ago
Compilation of Generic Regular Path Expressions Using C++ Class Templates
Various techniques for the navigation and matching of data structures using path expressions have been the subject of extensive investigations. No matter whether such techniques ar...
Luca Padovani
SEMWEB
2005
Springer
15 years 5 months ago
OMEN: A Probabilistic Ontology Mapping Tool
Abstract. Most existing ontology mapping tools do not provide exact mappings. Rather, there is usually some degree of uncertainty. We describe a framework to improve existing ontol...
Prasenjit Mitra, Natasha F. Noy, Anuj R. Jaiswal
IGPL
2010
142views more  IGPL 2010»
14 years 9 months ago
Logics of Kripke meta-models
This paper introduces and studies a new type of logical construction, which allows to combine various non-classical propositional logics with the temporal or modal background. The...
Sergey Babenyshev, Vladimir V. Rybakov