Specification of Mobile Code Systems Using Graph Grammars

Dotti, Fernando Luís; Ribeiro, Leila

doi:10.1007/978-0-387-35520-7_3

Cited by 21 publications

(24 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…An object may perform many (re)actions in parallel. A way to model objectbased systems using graph grammars have been presented [3] inspired in the actor model [1]. The basic idea was to use graph grammars as a (graphical) language to specify a kind of actor systems.…”

Section: Object-based Graph Grammarsmentioning

confidence: 99%

“…Here we consider some restrictions for graph grammars, still allowing read access to items. This restricted class of graph grammars is called objectbased graph grammars [3]. The restrictions imposed in this model implement the usual requirements of an object-based model, like encapsulation and communication via message passing.…”

Section: Introductionmentioning

confidence: 99%

“…2. Definition 3.1 Reduction SATcx:RAGG-m. 3 A problem L is NP-Hard if and only if Satisfiability reduces to L [9], that is, there is a deterministic polynomial time algorithm that transforms each instance of SAT into and instance of L, preserving the answer. This transformation (reduction) is denoted by ex.…”

mentioning

confidence: 99%

See 2 more Smart Citations

Decidability and Tractability of Problems in Object-Based Graph Grammars

Loreto

Ribeiro

Toscani

2002

Foundations of Information Technology in the Era of Network and Mobile Computing

Self Cite

View full text Add to dashboard Cite

Object-based programming languages are being widely used to construct concurrent and distributed systems. In such systems, the complexity of performing some task is usually measured in terms of messages that are exchanged to perform the task, because communication is almost always the most time consuming operation in these environments. In this paper we analyze the problem of verifying if a message can be delivered. We model object-based systems as a graph grammars, and analyze this property as a graph grammar property. It turns out that this problem is NP-Hard. With suitable restrictions on the kind of graph grammar rules that are used, decidability can also be proven.

show abstract

Section: Object-based Graph Grammarsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Decidability and Tractability of Problems in Object-Based Graph Grammars

Loreto

Ribeiro

Toscani

2002

Foundations of Information Technology in the Era of Network and Mobile Computing

Self Cite

View full text Add to dashboard Cite

show abstract

“…Since then, the theory evolved quickly [24], and a growing community has applied GTSs to diverse application fields [7]. Along the years, GTSs have been used to provide an operational semantics to programming languages [22], to systems made of agents (or actors) interacting via message passing [15,16,6], to object-oriented specification formalisms [26], to process calculi [10], and to several other languages and formalisms.…”

Section: Introductionmentioning

confidence: 99%

Translating Java Code to Graph Transformation Systems

Corradini

Dotti

Foss

et al. 2004

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. We propose a faithful encoding of Java programs (written in a suitable fragment of the language) to Graph Transformation Systems. Every program is translated to a set of rules including some basic rules, common to all programs and providing the operational semantics of Java (data and control) operators, and the program specific rules, namely one rule for each method or constructor declared in the program. Besides sketching some potential applications of the proposed translation, we discuss some desing choices that ensure its correctness, and we report on how do we intend to extend it in order to handle several other features of the Java language.

show abstract

“…We have developed a formal specification language [6], called Object-Based Graph Grammars (OBGG), suitable for the specification of asynchronous distributed systems. Currently, models defined in this formal specification language can be analyzed through simulation [3] [4].…”

Section: Introductionmentioning

confidence: 99%

Verification of Distributed Object-Based Systems

Dotti

Foss

Ribeiro

et al. 2003

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract.Distributed systems for open environments, like the Internet, are becoming more frequent and important. However, it is difficult to assure that such systems have the required functional properties. In this paper we use a visual formal specification language, called ObjectBased Graph Grammars (OBGG), to specify asynchronous distributed systems. After discussing the main concepts of OBGG, we propose an approach for the verification of OBGG specifications using model checking. This approach consists on the translation of OBGG specifications into PROMELA (PROcess/PROtocol MEta LAnguage), which is the input language of the SPIN model checker. The approach we use for verification allows one to write properties based on the OBGG specification instead of on the generated PROMELA model.

show abstract

Specification of Mobile Code Systems Using Graph Grammars

Cited by 21 publications

References 18 publications

Decidability and Tractability of Problems in Object-Based Graph Grammars

Decidability and Tractability of Problems in Object-Based Graph Grammars

Translating Java Code to Graph Transformation Systems

Verification of Distributed Object-Based Systems

Contact Info

Product

Resources

About