3342 search results - page 293 / 669 » Automating Abstract Interpretation |
146
click to vote
PLILP
1998
Springer
15 years 8 months ago
1998
Springer
Abstract. We address the problem of term normalisation modulo associativecommutative (AC) theories, and describe several techniques for compiling many-to-one AC matching and reduce...
138
click to vote
LICS
1997
IEEE
15 years 8 months ago
1997
IEEE
We present a categorical theory of ‘well-behaved’ operational semantics which aims at complementing the established theory of domains and denotational semantics to form a cohe...
185
click to vote
ALP
1997
Springer
15 years 8 months ago
1997
Springer
Abstract. We show that non-determinism simplifies coding certain problems into programs. We define a non-confluent, but well-behaved class of rewrite systems for supporting non-...
109
click to vote
ECSQARU
1997
Springer
15 years 8 months ago
1997
Springer
Abstract. Today, different formalisms exist to solve reasoning problems under uncertainty. For most of the known formalisms, corresponding computer implementations are available. ...
124
click to vote
ECSQARU
1997
Springer
15 years 8 months ago
1997
Springer
Abstract. Temporal programming languages are recognized as natural and expressive formalisms for describing dynamic systems. However, most such languages are based on linear ow of ...