4036 search results - page 186 / 808 » Formal Methods |
131
click to vote
FMCAD
2000
Springer
15 years 10 months ago
2000
Springer
We present a symbolic algorithm for strongly connected component decomposition. The algorithm performs (n log n) image and preimage computations in the worst case, where n is the n...
192
click to vote
IFL
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. In this paper we compare three systems for tracing and debugging Haskell programs: Freja, Hat and Hood. We evaluate their usefulness in practice by applying them to a num...
145
click to vote
ZUM
2000
Springer
15 years 10 months ago
2000
Springer
Unlike Z, Object-Z allows schemas to be defined recursively. This enables mutual and self recursive structures, commonly occurring in object-oriented programs, to be readily specif...
132
click to vote
ZUM
2000
Springer
15 years 10 months ago
2000
Springer
We propose an extension to Z whereby generic parameters may have their types partially constrained. Using this mechanism it becomes possible to dene in Z much of its own schema cal...
133
Voted
AMAST
2008
Springer
15 years 8 months ago
2008
Springer
The complexity of specification development and verification of large systems has to be mastered. In this paper a specification of a real case study, a platoon of Cristal vehicles ...