Sciweavers

31387 search results - page 449 / 6278
» Abstracts
Sort
View
AMAST
2004
Springer
15 years 11 months ago
Towards Correspondence Carrying Specifications
Abstract. In this work we study the unification of heterogeneous partial specifications using category theory. We propose an alternative to inn morphisms, which we call (abstract) ...
Marius C. Bujorianu, Eerke A. Boiten
FCCM
2004
IEEE
89views VLSI» more  FCCM 2004»
15 years 11 months ago
Word-Length Optimization of Folded Polynomial Evaluation
ended abstract presents further results from the word-length optimization system Right-Size described at FCCM 2003. The system is used to quantify the compiletime specialization s...
George A. Constantinides, Abunaser Miah, Nalin Sid...
CCGRID
2001
IEEE
15 years 11 months ago
TACO-Exploiting Cluster Networks for High-Level Collective Operations
TACO (Topologies and Collections) is a template library that introduces the flavour of distributed data parallel processing by means of reusable topology classes and C++ s. This p...
Jörg Nolte, Mitsuhisa Sato, Yutaka Ishikawa
FASE
2000
Springer
15 years 11 months ago
Formal System Development with KIV
state-based approach KIV uses abstract state machines (ASMs, [5]) over algebraically specified data types. The semantics of an ASM is the set of
Michael Balser, Wolfgang Reif, Gerhard Schellhorn,...
RTA
2000
Springer
15 years 11 months ago
Linear Higher-Order Matching Is NP-Complete
We consider the problem of higher-order matching restricted et of linear -terms (i.e., -terms where each abstraction x. M is such that there is exactly one free occurrence of x in ...
Philippe de Groote