Sciweavers

357 search results - page 40 / 72
» Optimizing programs with intended semantics
Sort
View
ICDE
2008
IEEE
129views Database» more  ICDE 2008»
14 years 9 months ago
Optimal Boolean Matrix Decomposition: Application to Role Engineering
Abstract-- A decomposition of a binary matrix into two matrices gives a set of basis vectors and their appropriate combination to form the original matrix. Such decomposition solut...
Haibing Lu, Jaideep Vaidya, Vijayalakshmi Atluri
ICLP
2005
Springer
14 years 1 months ago
Nondeterminism Analysis of Functional Logic Programs
Abstract. Information about the nondeterminism behavior of a functional logic program is important for various reasons. For instance, a nondeterministic choice in I/O operations re...
Bernd Braßel, Michael Hanus
HASKELL
2009
ACM
14 years 2 months ago
Types are calling conventions
It is common for compilers to derive the calling convention of a function from its type. Doing so is simple and modular but misses many optimisation opportunities, particularly in...
Maximilian C. Bolingbroke, Simon L. Peyton Jones
ERSHOV
1999
Springer
13 years 12 months ago
The Essence of Program Transformation by Partial Evaluation and Driving
Abstract. An abstract framework is developed to describe program transformation by specializing a given program to a restricted set of inputs. Particular cases include partial eval...
Neil D. Jones
PEPM
1999
ACM
13 years 12 months ago
Declarative Aspect-Oriented Programming
Aspect-oriented programming addresses the problem that the implementation of some properties such as error handling and optimization tends to cross-cut the basic functionality. To...
Ralf Lämmel