11345 search results - page 234 / 2269 » Foundations of Computer Science |
213
click to vote
STACS
2007
Springer
16 years 20 days ago
2007
Springer
Fixed point equations x = f(x) over ω-continuous semirings can be seen as the mathematical foundation of interprocedural program analysis. The sequence 0, f(0), f2 (0), . . . conv...
160
click to vote
ERSHOV
1999
Springer
15 years 10 months ago
1999
Springer
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...
183
click to vote
TLCA
1993
Springer
15 years 10 months ago
1993
Springer
d abstract) Giorgio Ghelli1 F≤ is a type system used to study the integration of inclusion and parametric polymorphism. F≤ does not include a notion of recursive types, but ext...
166
click to vote
UAI
1990
15 years 7 months ago
1990
The intelligent reformulation or restructuring of a belief network can greatly increase the efficiency of inference. However, time expended for reformulation is not available for ...
232
click to vote
GG
2010
Springer
15 years 7 months ago
2010
Springer
Model-driven development (MDD) has become a promising trend in software engineering. The model-driven development of highly complex software systems may lead to large models which ...