Sciweavers

674 search results - page 112 / 135
» Explanation Based Program Transformation
Sort
View
ICPP
1998
IEEE
15 years 1 months ago
A memory-layout oriented run-time technique for locality optimization
Exploiting locality at run-time is a complementary approach to a compiler approach for those applications with dynamic memory access patterns. This paper proposes a memory-layout ...
Yong Yan, Xiaodong Zhang, Zhao Zhang
DBPL
1993
Springer
104views Database» more  DBPL 1993»
15 years 1 months ago
Extensible Grammars for Language Specialization
A frequent dilemma in the design of a database programming language is the choice between a language with a rich set of tailored notations for schema definitions, query expression...
Luca Cardelli, Florian Matthes, Martín Abad...
ICS
1993
Tsinghua U.
15 years 1 months ago
The EM-4 Under Implicit Parallelism
: The EM-4 is a supercomputer that offers very fast inter processor communication and support for multi threading. In this paper we demonstrate that the EM-4, Together with an auto...
Lubomir Bic, Mayez A. Al-Mouhamed
ECOOP
2007
Springer
15 years 1 months ago
Efficiently Generating Structurally Complex Inputs with Thousands of Objects
Abstract. We present Shekoosh, a novel framework for constraint-based generation of structurally complex inputs of large sizes. Given a Java predicate that represents the desired s...
Bassem Elkarablieh, Yehia Zayour, Sarfraz Khurshid
CORR
2010
Springer
151views Education» more  CORR 2010»
14 years 9 months ago
Redundancies in Dependently Typed Lambda Calculi and Their Relevance to Proof Search
Dependently typed -calculi such as the Logical Framework (LF) are capable of representing relationships between terms through types. By exploiting the "formulas-as-types"...
Zachary Snow, David Baelde, Gopalan Nadathur