Sciweavers

83 search results - page 6 / 17
» A compact fixpoint semantics for term rewriting systems
Sort
View
WWW
2008
ACM
14 years 8 months ago
Semantic similarity based on compact concept ontology
This paper presents a new method of calculating the sematic similarity between articles based on WordNet. To further improve the performance of the proposed method, we build a new...
Ce Zhang, Yu-Jing Wang, Bin Cui, Gao Cong
LCPC
2005
Springer
14 years 28 days ago
A Language for the Compact Representation of Multiple Program Versions
Abstract. As processor complexity increases compilers tend to deliver suboptimal performance. Library generators such as ATLAS, FFTW and SPIRAL overcome this issue by empirically s...
Sébastien Donadio, James C. Brodman, Thomas...
ENTCS
2006
114views more  ENTCS 2006»
13 years 7 months ago
Prototyping SOS Meta-theory in Maude
We present a prototype implementation of SOS meta-theory in the Maude term rewriting language. The prototype defines the basic concepts of SOS meta-theory (e.g., transition formul...
Mohammad Reza Mousavi, Michel A. Reniers
FLOPS
2010
Springer
14 years 2 months ago
Code Generation via Higher-Order Rewrite Systems
Abstract. We present the meta-theory behind the code generation facilities of Isabelle/HOL. To bridge the gap between the source (higherorder logic with type classes) and the many ...
Florian Haftmann, Tobias Nipkow
ASE
2005
137views more  ASE 2005»
13 years 7 months ago
Rewriting-Based Techniques for Runtime Verification
Techniques for efficiently evaluating future time Linear Temporal Logic (abbreviated LTL) formulae on finite execution traces are presented. While the standard models of LTL are i...
Grigore Rosu, Klaus Havelund