loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Fifth International Workshop on Microprocessor Test and Verification (MTV'04)
Extreme Formal Modeling (XFM) for Hardware Models
Austin, Texas
September 09-September 10
ISBN: 0-7695-2320-X
Syed Suhaib, Virginia Polytechnic and State University
Deepak Mathaikutty, Virginia Polytechnic and State University
Sandeep Shukla, Virginia Polytechnic and State University
David Berner, Institut de Recherche en Informatique et Systèmes Aléatoires
In this paper, we show the usefulness of an agile formal method (named XFM) based on extreme programming concepts to construct abstract models from a natural language specification of a complex system. Building formal models for verification purposes is being employed in the industry for two different usage modes: (i) Descriptive Formal Models (DFM) which, are used to capture an implementation into an abstract model to submit to analysis by model checking tools, (ii) Prescriptive Formal Models (PFM) which, are used to capture natural language specifications into a formal model to analyze consistency of the specification and also as a reference model to compare a DFM against it. We propose XFM as a methodology to incrementally build a correct PFM from a natural language specification. In this paper, using XFM, on various examples related to micro-processors, we build the models of DLX pipeline in SPIN, the ISA bus monitor and arbitration phase of the Pentium Pro bus in SMV.
Citation:
Syed Suhaib, Deepak Mathaikutty, Sandeep Shukla, David Berner, "Extreme Formal Modeling (XFM) for Hardware Models," mtv, pp.30-35, Fifth International Workshop on Microprocessor Test and Verification (MTV'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.