A. R. Flora-Holmquist and M. Staskauskas. Formal validation of virtual finite state machines. In Proc. Workshop on Industrial-Strength Formal Specification Techniques (WIFT'95), pages 122--129, Boca Raton, April 1995.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....using such tools. In many cases, these analyses were able to reveal quite subtle design errors (e.g. Rud92, CGH 93, BG96] Once the model of a new software application has been thoroughly analyzed, it can also be used as the core of the implementation of the application (e.g. HP89, FHS95] Recently [God97] it has been shown how systematic state space exploration can be extended to deal directly with actual code implementing concurrent reactive software systems, in which processes execute arbitrary code written in general purpose programming languages such as C or C . ....

A. R. Flora-Holmquist and M. Staskauskas. Formal validation of virtual finite state machines. In Proc. Workshop on Industrial-Strength Formal Specification Techniques (WIFT'95), pages 122--129, Boca Raton, April 1995.

....checking in a broad sense, to denote any automatic state space exploration technique that can be used for verification purposes. 1 Examples of tools that follow the above paradigm are CAESAR [FGM 92] COSPAN [HK90] CWB [CPS93] MURPHI [DDHY92] SMV [McM93] SPIN [Hol91] and VFSMvalid [FHS95] among others. These tools differ by the modeling languages they use for representing systems and properties, and by the conformation criteria according to which these representations are compared. But all of them are based on state space exploration algorithms, in one form or another, for ....

A. R. Flora-Holmquist and M. Staskauskas. Formal validation of virtual finite state machines. In Proc. Workshop on IndustrialStrength Formal Specification Techniques (WIFT'95), pages 122--129, Boca Raton, April 1995.

....existing state space exploration tools can compute automatically a state space from an abstract description of such a system, specified in a modeling language. Examples of such tools are CAESAR [FGM 92] COSPAN [HK90] CWB [CPS93] MURPHI [DDHY92] SMV [McM93] SPIN [Hol91] and VFSMvalid [FHS95] among others. In many cases, analyses of complex concurrent systems using state space exploration techniques were able to reveal quite subtle design errors (for instance, see [Rud92, CGH 93, BG96] VeriSoft extends the previous results by being able to directly analyze the implementation ....

A. R. Flora-Holmquist and M. Staskauskas. Formal validation of virtual finite state machines. In Proc. Workshop on Industrial-Strength Formal Specification Techniques (WIFT'95), pages 122--129, Boca Raton, April 1995.

.... specified in a modeling language (e.g. 15, 5, 22] Once a model of a new software application has been thoroughly analyzed, it can also be used as the core of the implementation of the application, as can be done with software development environments for languages such as SDL [16] and VFSM [9]. VeriSoft [11] is a recent tool which extends the scope of systematic statespace exploration to concurrent systems in which processes execute arbitrary code written in general purpose programming languages such as C or C . VeriSoft systematically explores the state space of a concurrent ....

A. R. Flora-Holmquist and M. Staskauskas. Formal validation of virtual finite state machines. In Proc. Workshop on Industrial-Strength Formal Specification Techniques (WIFT'95), pages 122--129, Boca Raton, April 1995.

....Existing state space exploration tools can compute automatically a state space from a description of the concurrent system specified in a modeling language. Examples of such tools are CAESAR [FGM 92] COSPAN [HK90] CWB [CPS93] MURPHI [DDHY92] SMV [McM93] SPIN [Hol91] and VFSMvalid [FHS95] among others. These tools differ by the modeling languages they use for representing systems and properties, and by the conformation criteria according to which these representations are compared. But all of them are based on state space exploration algorithms, in one form or another, for ....

A. R. Flora-Holmquist and M. Staskauskas. Formal validation of virtual finite state machines. In Proc. Workshop on Industrial-Strength Formal Specification Techniques (WIFT'95), pages 122--129, Boca Raton, April 1995.

....checking is a proven successful verification technology in the hardware community. For example, it has been used to find bugs in published circuits [4, 14] the cache coherence protocol for the Encore Gigamax multiprocessor [23] the IEEE Futurebus Standard [9] and telephone switching systems [15]. It has been used to prove safety and liveness properties of the T9000 virtual channel processor [3] Fundamental to model checking is its reliance on finite state machines. Model checking exploits this finiteness property by performing an exhaustive case analysis of the machine s set of states. ....

Flora-Holmquist, A., and Staskauskas, M. Formal validation of virtual finite state machines. In Proceedings of the Workshop on Industrial-Strength Formal Specification Techniques (Apr. 1995). to appear.

No context found.

A. R. Flora-Holmquist and M. G. Staskauskas. Formal validation of virtual finite state machines. In Proc. Workshop on Industrial-Strength Formal Specification Techniques (WIFT95), Boca Raton, FL, April 1995.

....of AT T) To date, over twenty five 5ESS developers have used the validator to search for errors in their VFSM designs. Our experience represents one of the first instances we know of in which validation technology has achieved widespread use in an industrial software development organization (see [1] for more details about our experiences with technology transfer) 3 Despite its many successful applications, the validator can be a difficult tool to use: the running time of validation typically grows exponentially with the size of the VFSM(s) being validated. The first few runs of the ....

A. R. Flora-Holmquist and M. G. Staskauskas, "Formal validation of virtual finite state machines," Proc. Workshop on Industrial-Strength Formal Specification Techniques (WIFT95), Boca Raton, FL, pp. 122-129, April 1995.

No context found.

A. R. Flora-Holmquist and M. G. Staskauskas, "Formal Validation of Virtual Finite-State Machines," Proceedings of the Workshop on Industrial-Strength Formal Specification Techniques (WIFT `95), Boca Raton, Florida, Apr. 1995, pp. 122-129.

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