5255 search results - page 634 / 1051 » Formal Methods for Privacy |
175
click to vote
IFL
2001
Springer
15 years 11 months ago
2001
Springer
In order to achieve a high level of abstraction, array-oriented languages provide language constructs for defining array operations in a shape-invariant way. However, when trying ...
187
click to vote
IFL
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. Generic programming enables the programmer to define functions by induction on the structure of types. Defined once, such a generic function can be used to generate a s...
180
click to vote
SAS
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the omission of t...
171
click to vote
SAS
2001
Springer
15 years 11 months ago
2001
Springer
Programs often have a lot of duplicated code, which makes both understanding and maintenance more difficult. This problem can be alleviated by detecting duplicated code, extracting...
172
click to vote
SAS
2001
Springer
15 years 11 months ago
2001
Springer
Model checking would answer all finite-state verification problems, if it were not for the notorious state-space explosion problem. A problem of practical importance, which attra...