2514 search results - page 275 / 503 » The use of industrial-strength formal methods |
152
click to vote
TYPES
2004
Springer
15 years 12 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...
164
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 ...
158
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...
151
click to vote
FM
1999
Springer
15 years 11 months ago
1999
Springer
Sharing between B constructs is limited, both on the specification and the implementation level. The limitations stem from the single writer/multiple readers paradigm, restricted ...
182
click to vote
FM
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. The correctness of a system according to a given specification is essential, especially for safety-critical applications. One such typical application domain is the autom...