378 search results - page 42 / 76 » Automating Mathematical Program Transformations |
ICLP
1992
Springer
15 years 3 months ago
1992
Springer
CFT is a new constraint system providing records as logical data structure for constraint (logic) programming. It can be seen as a generalization of the rational tree system emplo...
104
click to vote
ICDCS
2002
IEEE
15 years 4 months ago
2002
IEEE
In this paper, we focus our attention on the problem of automating the addition of failsafe fault-tolerance where fault-tolerance is added to an existing (fault-intolerant) progra...
101
click to vote
PLILP
1992
Springer
15 years 3 months ago
1992
Springer
Attribute grammars may be seen as a (rather specialised) lazy or demand-driven programming language. The "programs" in this language take text or parse trees as input an...
109
click to vote
LOPSTR
2005
Springer
15 years 4 months ago
2005
Springer
We propose an extension of functional logic languages that allows the definition of operations with patterns containing other defined operation symbols. Such “function patterns...
ICDCS
2003
IEEE
15 years 4 months ago
2003
IEEE
In this paper, we focus on automated techniques to enhance the fault-tolerance of a nonmasking fault-tolerant program to masking. A masking program continually satisfies its spec...