4814 search results - page 195 / 963 » Combining abstract interpreters |
166
click to vote
PEPM
1993
ACM
15 years 10 months ago
1993
ACM
For a functional programming language with a lazy standard semantics, we define a strictness analysis by means of abstract interpretation. Using the information from the strictne...
154
click to vote
FPCA
1989
15 years 10 months ago
1989
One way to analyse programs is to to derive expressions for their computational behaviour. A time bound function (or worst-case complexity) gives an upper bound for the computatio...
137
click to vote
MPC
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. We present an algorithm for inverse computation in a rstorder functional language based on the notion of a perfect process tree. The Universal Resolving Algorithm (URA) i...
188
click to vote
EUROGP
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. Geometric Differential Evolution (GDE) is a very recently introduced formal generalization of traditional Differential Evolution (DE) that can be used to derive specific ...
179
click to vote
ER
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. In this paper we discuss about composing services from standard suites of applications for personal data management in mobile devices. We propose a data model and an inte...