Holzmann, G.J. (1994) `Proving the value of formal methods,' Proc. 7th FORTE Conference , Bern, Switzerland, Chapman & Hall, pp. 385-396.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....validation can be profitably used, albeit with some difficulty, by software developers with relatively little training. We have also demonstrated that the low level design phase of software development is a promising, though often overlooked, niche for the introduction of validation. Holzmann [Ho94b] has noted that Promela and SPIN were designed in accord with the Unix philosophy, i.e. to do one thing (validation) and do it well. While the Unix philosophy is certainly pertinent to the design of file manipulation utilities like diff and grep, we feel that a tool for the design of concurrent ....

G. J. Holzmann. Proving the value of formal methods. In Proc. 7th Intl. Conf. on Formal Description Techniques (FORTE'94), October 1994.

....within a memory arena that may be orders of magnitude smaller than required for exhaustive verifications. The method has made it possible to apply formal verification techniques to problems that would normally have remained beyond the scope of automated tools, e.g. C91] C94] L94] H94a] [H94b]. This paper provides an analytical argument that explains the performance of the algorithm. The analysis is then extended to compare the method with two alternative techniques that have been proposed in the recent literature as potential improvements [WL93] Problem Definition In the following, ....

Holzmann, G.J. (1994) `Proving the value of formal methods,' Proc. 7th FORTE Conference , Bern, Switzerland, Chapman & Hall, pp. 385-396.

....within a memory arena that may be orders of magnitude smaller than required for exhaustive verifications. The method has made it possible to apply formal verification techniques to problems that would normally have remained beyond the scope of automated tools, e.g. C91] C94] L94] H94a] [H94b]. This paper provides an analytical argument that explains the performance of the algorithm. The analysis is then extended to compare the method with alternative techniques, hash compact, and multihash [WL93] SD95] SD96] We show that a variation of the multihash technique, sequential bitstate ....

Holzmann, G.J. (1994) `Proving the value of formal methods,' Proc. 7th FORTE Conference , Bern, Switzerland, Chapman & Hall, pp. 385-396.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC