4340 search results - page 473 / 868 » Formal Methods and Cryptography |
178
click to vote
FM
2001
Springer
15 years 11 months ago
2001
Springer
To develop efficient algorithms for the reachability analysis of timed automata, a promising approach is to use binary decision diagrams (BDDs) as data structure for the representa...
168
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 ...
184
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...
172
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...