1882 search results - page 119 / 377 » Transformational Programming and Forests |
ESOP
1999
Springer
15 years 2 months ago
1999
Springer
Abstract. Dynamicprogramming is an importantalgorithm design technique. It is used for solving problems whose solutions involve recursively solving subproblems that share subsubpro...
INFSOF
2010
14 years 8 months ago
2010
Program analysis techniques are used by software engineers to deduce and infer characteristics of software systems. Recent research has suggested that certain program analysis tec...
77
Voted
IEEEPACT
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract—Load elimination is a classical compiler transformation that is increasing in importance for multi-core and many-core architectures. The effect of the transformation is ...
PASTE
1998
ACM
15 years 2 months ago
1998
ACM
Concept analysis transforms any relation between ‘lobjects” and “attributes” into a complete lattice. This concept lattice can be studied by algebraic means and offers rem...
TCS
2010
14 years 8 months ago
2010
The refinement calculus of Back, Morgan, Morris, and others is based on monotone predicate transformers (weakest preconditions) where conjunctions stand for demonic choices betwee...