|Appears in Collections:||Computing Science and Mathematics Journal Articles|
|Peer Review Status:||Refereed|
|Title:||Flexible and Configurable Verification Policies with Omnibus|
|Keywords:||Computer program Verification|
Omnibus (Computer program language)
|Citation:||Wilson T, Maharaj S & Clark R (2008) Flexible and Configurable Verification Policies with Omnibus, Software and Systems Modeling, 7 (3), pp. 257-272. http://www.springerlink.com/content/9543347t1h403181/fulltext.pdf; https://doi.org/10.1007/s10270-007-0060-1.|
|Abstract:||The three main assertion-based verification approaches are: run-time assertion checking(RAC), extended static checking (ESC) and full formal verification (FFV). Each approach offers a different balance between rigour and ease of use, making them appropriate in different situations. Our goal is to explore the use of these approaches together in a flexible way, enabling an application to be broken down into parts with different reliability requirements and different verification approaches used in each part. We explain the benefits of using the approaches together, present a set of guidelines to avoid potential conflicts and give an overview of how the Omnibus IDE provides support for the full range of assertion-based verification approaches within a single tool.|
|Rights:||The original publication is available at www.springerlink.com. URL: http://www.springerlink.com/content/9543347t1h403181/|
|WilsonMaharajClark.pdf||Fulltext - Accepted Version||208.77 kB||Adobe PDF||View/Open|
This item is protected by original copyright
Items in the Repository are protected by copyright, with all rights reserved, unless otherwise indicated.
If you believe that any material held in STORRE infringes copyright, please contact firstname.lastname@example.org providing details and we will remove the Work from public display in STORRE and investigate your claim.