A procedure to translate Paradigm Specifications to Propositional Linear Temporal Logic and its application to verification
A procedure to translate Paradigm Specifications to Propositional Linear Temporal Logic and its application to verification
Software systems have evolved from monolythic programs to systems constructed from parallel, cooperative components, as can be currently found in object-oriented applications. Although powerfull, these cooperative systems are also more difficult to verify. We show 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 useful on verifying 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.
Augusto, Juan Carlos
1bb7d5e6-e71d-4b93-a611-d62d2a974495
Gómez, Rodolfo
29f01b6c-45bd-4200-b906-c8d4f6610bdc
June 2002
Augusto, Juan Carlos
1bb7d5e6-e71d-4b93-a611-d62d2a974495
Gómez, Rodolfo
29f01b6c-45bd-4200-b906-c8d4f6610bdc
Augusto, Juan Carlos and Gómez, Rodolfo
(2002)
A procedure to translate Paradigm Specifications to Propositional Linear Temporal Logic and its application to verification
Record type:
Monograph
(Project Report)
Abstract
Software systems have evolved from monolythic programs to systems constructed from parallel, cooperative components, as can be currently found in object-oriented applications. Although powerfull, these cooperative systems are also more difficult to verify. We show 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 useful on verifying 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.
This record has no associated files available for download.
More information
Published date: June 2002
Organisations:
Electronics & Computer Science
Identifiers
Local EPrints ID: 256802
URI: http://eprints.soton.ac.uk/id/eprint/256802
PURE UUID: 683a8e37-cea1-40b8-8224-ecd56b18a94f
Catalogue record
Date deposited: 07 Oct 2002
Last modified: 20 Feb 2024 17:43
Export record
Contributors
Author:
Juan Carlos Augusto
Author:
Rodolfo Gómez
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics