4211 search results - page 246 / 843 » Types as Abstract Interpretations |
149
click to vote
ECAI
1994
Springer
15 years 10 months ago
1994
Springer
Abstract. In this paper we describe a framework for defining and operationalizing conceptual models of distributed knowledge-based systems which extends published approaches by the...
142
Voted
HYBRID
1994
Springer
15 years 10 months ago
1994
Springer
Abstract. We present a language,Hybrid cc, for modeling hybrid systems compositionally. This language is declarative, with programs being understood as logical formulas that place ...
161
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...
127
click to vote
CTCS
1989
Springer
15 years 10 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...
142
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...