| Seungjoon Park. Computer Assisted Analysis of Multiprocessor Memory Systems. PhD thesis, Stanford University, jun 1996. Department of Computer Science. |
....it through model checking. Next, Imp abs is verified against Spec, the visibility order based specification of the memory model. We believe (as we will demonstrate) that Phase 1 can in itself be used as a very e#ective bug hunting tool. Phase 2 can be conducted using theorem proving, similar to [12], as detailed on our webpage. This paper is mostly about Phase 1. For a large class of implementations, Phase 2 does not vary, as the same Imp abs results from all these implementations, thus permitting verification reuse. In fact, most Imp abs models we end up creating are the same as operational ....
Seungjoon Park. Computer Assisted Analysis of Multiprocessor Memory Systems. PhD thesis, Stanford University, jun 1996. Department of Computer Science.
....space is a difficulty even for theorem provers. This is demonstrated through the verification of the general version of the protocol using PVS. A method for bounding the state space is presented. At Stanford University a method for use in the verification of concurrent systems in PVS was developed [Par96, PD96]. To demonstrate this method the FLASH cache coherence protocol was specified and verified. Software verification is restricted almost completely to the research arena. Dave Stringer Calvert of the University of York is using PVS to verify a compiler for a simple imperative language. His work is ....
Park, Seungjoon. "Computer Assisted Analysis of Multiprocessor Memory Systems." Ph.D. Thesis, Department of Electrical Engineering, Stanford University, June 1996.
....a protocol to its abstract version by providing an abstraction function c flIFIP 1997. Published by Chapman Hall 2 Automatic Checking of Aggregation Abstractions Through State Enumeration which reassembles individual implementation steps into atomic transactions in a specification protocol [25, 24]. This method addresses the primary difficulty with using theorem proving for verification of real systems, which is the amount of human effort required to complete a proof, by making it easier to create appropriate abstraction functions. The aggregation method is applicable when the description ....
Seungjoon Park. Computer Assisted Analysis of Multiprocessor Memory Systems. PhD thesis, Stanford University, June 1996.
No context found.
Seungjoon Park. Computer Assisted Analysis of Multiprocessor Memory Systems. PhD thesis, Department of Electrical Engineering, Stanford University, June 1996.
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