Please use this identifier to cite or link to this item:
https://www.um.edu.mt/library/oar/handle/123456789/91814| Title: | LARVA converter user manual |
| Authors: | Colombo, Christian |
| Keywords: | Electronic funds transfers -- Security measures Transaction systems (Computer systems) Business intelligence Computer programs -- Verification |
| Issue Date: | 2008 |
| Citation: | Colombo, C. (2008). LARVA Converter User Manual. 1-5 |
| Abstract: | Several notations can be used to represent properties of computer systems. We provide a conversion to LARVA for some of these notations. This document provides the information to use a suite of converters which act as a bridge from some notation to LARVA. The LARVA code generated is not complete for the simple reason that the user has to insert additional information about the relationship between the variables in the notation and the events of the system to be monitored. The application here described can also be used to check whether a counterexample formula is slowdown truth preserving and whether it is speedup truth preserving. Counterexample formulae are a subset of duration calculus for which we have proved a subset which is slowdown truth preserving and a subset which is speedup truth preserving. |
| URI: | https://www.um.edu.mt/library/oar/handle/123456789/91814 |
| Appears in Collections: | Scholarly Works - FacICTCS |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| LARVA_converter_user_manual.pdf Restricted Access | 60.02 kB | Adobe PDF | View/Open Request a copy |
Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.