617 search results - page 87 / 124 » Using Formal Methods in a Retrospective Safety Case |
TYPES
2004
Springer
14 years 1 months ago
2004
Springer
In this paper we use the Epigram language to define the universe of regular tree types—closed under empty, unit, sum, product and least fixpoint. We then present a generic deci...
IFL
2001
Springer
14 years 5 days 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 ...
IFL
2001
Springer
14 years 5 days 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...
SAS
2001
Springer
14 years 5 days 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...
IFL
1999
Springer
14 years 6 hour ago
1999
Springer
Abstract. We discuss a new optimisation for recursive functions yielding multiple results in tuples for lazy functional languages, like Clean and Haskell. This optimisation improve...