Results 11  20
of
1,479
Uniqueness Typing for Functional Languages with Graph Rewriting Semantics
 Mathematical Structures in Computer Science
, 1996
"... This paper is an elaborated version of the work presented in Barendsen and Smetsers (1995a) and Barendsen and Smetsers (1995c). 2. Term graph rewriting ..."
Abstract

Cited by 50 (5 self)
 Add to MetaCart
This paper is an elaborated version of the work presented in Barendsen and Smetsers (1995a) and Barendsen and Smetsers (1995c). 2. Term graph rewriting
Coinductive Reasoning for Contextual GraphRewriting
, 2004
"... We introduce a comprehensive semantic theory of graph rewriting. The theory is operational, and therefore, lends itself to the application of coinductive principles. The central idea is recasting rewriting frameworks as reactive systems with the resulting contextual equivalences. Specifically, a gra ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
We introduce a comprehensive semantic theory of graph rewriting. The theory is operational, and therefore, lends itself to the application of coinductive principles. The central idea is recasting rewriting frameworks as reactive systems with the resulting contextual equivalences. Specifically, a
Towards A Formal Operational Semantics Of Uml Statechart Diagrams
, 1999
"... : Statechart Diagrams are a notation for describing behaviours in the framework of UML, the Unified Modeling Language of objectoriented systems. UML is a semiformal language, with a precisely defined syntax and static semantics but with an only informally specified dynamic semantics. UML Statec ..."
Abstract

Cited by 79 (14 self)
 Add to MetaCart
: Statechart Diagrams are a notation for describing behaviours in the framework of UML, the Unified Modeling Language of objectoriented systems. UML is a semiformal language, with a precisely defined syntax and static semantics but with an only informally specified dynamic semantics. UML
Admissible Graph Rewriting and Narrowing
 IN PROCEEDINGS OF THE JOINT INTERNATIONAL CONFERENCE AND SYMPOSIUM ON LOGIC PROGRAMMING
, 1998
"... We address the problem of graph rewriting and narrowing as the underlying operational semantics of rulebased programming languages. We propose new optimal graph rewriting and narrowing strategies in the setting of orthogonal constructorbased graph rewriting systems. For this purpose, we first char ..."
Abstract

Cited by 35 (10 self)
 Add to MetaCart
We address the problem of graph rewriting and narrowing as the underlying operational semantics of rulebased programming languages. We propose new optimal graph rewriting and narrowing strategies in the setting of orthogonal constructorbased graph rewriting systems. For this purpose, we first
Structured Operational Semantics for Graph Rewriting
 In ICE (2011
"... Process calculi and graph transformation systems provide models of reactive systems with labelled transition semantics. While the semantics for process calculi is compositional, this is not the case for graph transformation systems, in general. Hence, the goal of this article is to obtain a composit ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Process calculi and graph transformation systems provide models of reactive systems with labelled transition semantics. While the semantics for process calculi is compositional, this is not the case for graph transformation systems, in general. Hence, the goal of this article is to obtain a
Congruences for Contextual GraphRewriting
, 2004
"... We introduce a comprehensive operational semantic theory of graphrewriting. Graphrewriting here is ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
We introduce a comprehensive operational semantic theory of graphrewriting. Graphrewriting here is
Dactl: An Experimental Graph Rewriting Language
 Proc. 4th International Workshop on Graph Grammars
, 1991
"... This paper gives some examples of how computation in a number of languages may be described as graph rewriting, giving the Dactl notation for the examples shown. It goes on to present the Dactl model more formally before giving a formal definition of the syntax and semantics of the language. 2 Examp ..."
Abstract

Cited by 36 (7 self)
 Add to MetaCart
This paper gives some examples of how computation in a number of languages may be described as graph rewriting, giving the Dactl notation for the examples shown. It goes on to present the Dactl model more formally before giving a formal definition of the syntax and semantics of the language. 2
Using Statecharts to Model Hypertext
 ACM ECHT CONFERENCE
, 1992
"... This paper describes how to use statecharts to model hypertext. Statechart is a formal graphical model based on state transition diagram and hypergraph. The statechart model is compared with other models for hypertext based on simple nodeandlink graph, firstorder logic formulae, hypergraph, and p ..."
Abstract

Cited by 24 (0 self)
 Add to MetaCart
This paper describes how to use statecharts to model hypertext. Statechart is a formal graphical model based on state transition diagram and hypergraph. The statechart model is compared with other models for hypertext based on simple nodeandlink graph, firstorder logic formulae, hypergraph
A Formal Semantics of UML Statecharts by Model Transition Systems
"... Abstract. UML Statecharts are wellknown visual means to capture the dynamic behavior of reactive systems in the objectoriented design methodology. Since the UML standard only contains an informal description on how to execute such statemachines mathematically precise semantic frameworks are requi ..."
Abstract
 Add to MetaCart
are required for an automated analysis. The current paper presents a formal semantics for UML statecharts based on a combination of metamodeling and graph transformation that is (i) simultaneously visual and precise, and (ii) clearly separates derived static concepts (like priorities, conflicts, etc.) from
A graphoriented model for articulation of ontology interdependencies
 In Proceedings, 7th International Conference on Extending Database Technology
, 2000
"... Abstract: Ontologies are knowledge structures to explicate the contents, essential properties, and relationships between terms in a knowledge source. Many sources are now accessible with associated ontologies. Most prior work on use of ontologies relies on the construction of a single global ontolog ..."
Abstract

Cited by 159 (4 self)
 Add to MetaCart
the ontologies amenable for automatic composition based on the accumulated knowledge rules, we represent them using a graphoriented model extended with a small algebraic operator set. ONION, a userfriendly toolkit, aids the experts in bridging the semantic gap in reallife settings. Our framework provides a
Results 11  20
of
1,479