Copyright © 2007 Elsevier B.V. All rights reserved.
Formal Verification of Object-Oriented Graph Grammars Specifications
Available online 29 June 2007.
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Abstract
Concurrent object-oriented systems are ubiquitous due to the importance of networks and the current demands for modular, reusable, and easy to develop software. However, checking the correctness of such systems is a hard task, mainly due to concurrency and inheritance aspects. In this paper we present an approach to the verification of concurrent object-oriented systems. We use graph grammars equipped with object oriented features (including inheritance and polymorphism) as the specification formalism, and define a translation from such specifications to Promela, the input language of the SPIN model checker.
Keywords: Graph grammars; object-oriented programming; model checking






E-mail Article
Add to my Quick Links

Cited By in Scopus (0)





