13306 search results - page 420 / 2662 » Theoretical Computer Science |
197
click to vote
ERSHOV
1999
Springer
15 years 11 months ago
1999
Springer
We extend positive supercompilation to handle negative as well as positive information. This is done by instrumenting the underlying unfold rules with a small rewrite system that h...
182
Voted
GI
1999
Springer
15 years 11 months ago
1999
Springer
We discuss the properties of strictly typed languages on the one hand and soft typing of the other and identify disadvantages of these approaches to type checking in the context of...
161
click to vote
MFCS
1999
Springer
15 years 11 months ago
1999
Springer
We propose so called clausal tableau systems for the common modal logics K4, KD4 and S4. Basing on these systems, we give more efficient decision procedures than those hitherto kno...
200
click to vote
RANDOM
1999
Springer
15 years 11 months ago
1999
Springer
Abstract. We consider approximate PCPs for multidimensional bin-packing problems. In particular, we show how a verifier can be quickly convinced that a set of multidimensional blo...
175
click to vote
SOFSEM
1999
Springer
15 years 11 months ago
1999
Springer
Changeability (also called evolvability) is an essential property of software. Software change is the foundation for both new software development and legacy software maintenance, ...