A procedure to translate Paradigm Specifications to Propositional Linear Temporal Logic and its application to verification
Augusto, Juan Carlos and Gómez, Rodolfo (2002) A procedure to translate Paradigm Specifications to Propositional Linear Temporal Logic and its application to verification.
This is the latest version of this item.
Full text not available from this repository.
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.
|Item Type:||Monograph (Technical Report)|
|Divisions:||Faculty of Physical and Applied Science > Electronics and Computer Science
|Date Deposited:||07 Oct 2002|
|Last Modified:||02 Mar 2012 11:38|
|Contributors:||Augusto, Juan Carlos (Author)
Gómez, Rodolfo (Author)
|Further Information:||Google Scholar|
|RDF:||RDF+N-Triples, RDF+N3, RDF+XML, Browse.|
Available Versions of this Item
- A procedure to translate Paradigm Specifications to Propositional Linear Temporal Logic and its application to verification. (deposited 07 Oct 2002) [Currently Displayed]
Actions (login required)