loading...
Configurable Proof Obligations in the Frog Toolkit
London, England September 10-September 14
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/SEFM.2007.12Fifth IEEE International Conference o ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Simon Fraser, University of Manchester
Richard Banach, University of Manchester,
In model based formal methods, incompatible tools for different techniques is the norm. However, greater applicability to industrial scale systems increasingly requires combining the strengths of different techniques, in line with the Verification Grand Challenge. The Frog tool embodies a construct-based specification syntax, and its meta-language Frog-CCL allows the generic configuration of both a construct?s syntax and its proof obligations. For a specific system, Frog generates the system?s verification conditions mechanically from the generic ones. Relationships between systems such as refinement and retrenchment can be configured. An example retrenchment between two simple systems illustrates the technique.
Citation:
Simon Fraser, Richard Banach, "Configurable Proof Obligations in the Frog Toolkit," sefm, pp.361-370, Fifth IEEE International Conference on Software Engineering and Formal Methods (SEFM 2007), 2007
Usage of this product signifies your acceptance of the Terms of Use.


Suggestions