Formal Verification of Object-Oriented Graph Grammars Specifications

Authors:
Ana Paula Lüdtke Ferreira;Luciana Foss;Leila Ribeiro
Affiliations:
Universidade do Vale do Rio dos Sinos, São Leopoldo, Brazil;Universidade Federal do Rio Grande do Sul, Porto Alegre, Brazil;Universidade Federal do Rio Grande do Sul, Porto Alegre, Brazil
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2007

Citing 6
Cited 5

Programming languages (3rd ed.): design and implementation

Programming languages (3rd ed.): design and implementation
Graph processes

Fundamenta Informaticae - Special issue on graph transformations
The Model Checker SPIN

IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Algebraic approaches to graph transformation. Part II: single pushout approach and comparison with double pushout approach

Handbook of graph grammars and computing by graph transformation
Logic in computer science: modelling and reasoning about systems

Logic in computer science: modelling and reasoning about systems
An Overview of the GXL Graph Exchange Language

Revised Lectures on Software Visualization, International Seminar

Explicit State Model Checking for Graph Grammars

Concurrency, Graphs and Models
A Graph-Based Operational Semantics of OO Programs

ICFEM '09 Proceedings of the 11th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering
Attributed graph transformation with inheritance: Efficient conflict detection and local confluence analysis using abstract critical pairs

Theoretical Computer Science
Scenario-driven analysis of systems specified through graph transformations

Journal of Visual Languages and Computing
A graph-based generic type system for object-oriented programs

Frontiers of Computer Science: Selected Publications from Chinese Universities

Quantified Score

Hi-index	0.00

Visualization

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.