4340 search results - page 474 / 868 » Formal Methods and Cryptography |
169
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...
176
click to vote
ICFP
1999
ACM
15 years 11 months ago
1999
ACM
We propose a conservative extension of the polymorphic lambda calculus (A5B ) as an intermediate language for compiling languages with name-based class and interface hierarchies. ...
156
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 ...
171
click to vote
IFL
1999
Springer
15 years 11 months 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...
151
click to vote
IFM
1999
Springer
15 years 11 months ago
1999
Springer
: Some of the shortcomings of using refinement alone as the means of passing from high level simple models to actual detailed implementations are reviewed. Retrenchment is presente...