1689 search results - page 164 / 338 » Refining abstract interpretations |
147
click to vote
PEPM
1993
ACM
15 years 9 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...
107
click to vote
CTCS
1989
Springer
15 years 9 months ago
1989
Springer
We combine the principles of the Floyd-Warshall-Kleene algorithm, enriched categories, and Birkhoff arithmetic, to yield a useful class of algebras of transitive vertex-labeled s...
126
Voted
FPCA
1989
15 years 9 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...
156
Voted
ICANN
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. A new classification algorithm based on combination of kernel density estimators is introduced. The method combines the estimators with different bandwidths what can be i...
132
Voted
ACSD
2006
IEEE
15 years 8 months ago
2006
IEEE
Dynamic communication systems (DCS) are complex because of their unboundedness in several dimensions. They have an unbounded and changing number of objects, a dynamically changing...