Augusto, Juan Carlos and Gomez, R.S. (2003) A Procedure to Translate PARADIGM Specifications to Propositional Linear Temporal Logic and its Application to Verification. International Journal of Software Engineering and Knowledge Engineering, 13 (6). pp. 627-654. ISSN 0218-1940.
| The full text of this publication is not available from this repository. (Contact us about this Publication) | |
| Official URL http://www.cs.kent.ac.uk/pubs/2003/1833 |
Abstract
Software systems have evolved from monolithic programs to systems constructed from parallel, cooperative components, as can be currently found in object-oriented applications. Although powerful, these cooperative systems are also more difficult to verify. We show that it is possible to automatically translate a PARADIGM specification to a Propositional Linear Temporal Logic based program. This has several interesting consequences: a) on one hand we allow a more declarative view of PARADIGM specifications, b) the resulting translation is an executable specification and c) as we show in this work it can also be used to verify correctness properties by automatic means. We think this will contribute to enhance the understanding, usability and further development of PARADIGM, and related methods like SOCCA, within both the Software Engineering and the Knowledge Engineering communities.
| Item Type: | Article |
|---|---|
| Uncontrolled keywords: | Software process, PARADIGM, temporal logic, verification |
| Subjects: | Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming, |
| Divisions: | Faculties > Science Technology and Medical Studies > School of Computing > Theoretical Computing Group |
| Depositing User: | Mark Wheadon |
| Date Deposited: | 24 Nov 2008 18:00 |
| Last Modified: | 20 Apr 2012 11:40 |
| Resource URI: | http://kar.kent.ac.uk/id/eprint/13880 (The current URI for this page, for reference purposes) |
- Depositors only (login required):
