Can Graph Grammars Make Formal Methods More Human?
نویسندگان
چکیده
Formal methods are scarcely used in industrial applications. Industrial strength tools and educational effort do not significantly help in promoting formal methods. Main obstacles to the industrial application of formal methods are lack of flexibility, lack of specialization, and difficulties in interpreting analysis results. This paper argues that graph grammars can help overcoming such limitations. The paper suggests that translation rules based on graph grammars are a natural merging of formalizations based on graph grammars and rule based approaches; thus it indicates a challenging practical application domain for graph grammars.
منابع مشابه
Matrix Graph Grammars
This book objective is to develop an algebraization of graph grammars. Equivalently, we study graph dynamics. From the point of view of a computer scientist, graph grammars are a natural generalization of Chomsky grammars for which a purely algebraic approach does not exist up to now. A Chomsky (or string) grammar is, roughly speaking, a precise description of a formal language (which in essenc...
متن کاملSemantic construction with graph grammars
We introduce s-graph grammars, a new grammar formalism for computing graph-based semantic representations. Semantically annotated corpora which use graphs as semantic representations have recently become available, and there have been a number of data-driven systems for semantic parsing that can be trained on these corpora. However, it is hard to map the linguistic assumptions of these systems ...
متن کاملFormal Properties of Feature Grammars
This paper describes the formal power of feature grammars such as Generalised Phrase Structured Grammars (GPSG) 1]. It shows how such grammars relate to context-free grammar (Chomsky type 2) and which extensions cause the formalism to increase in power to context-sensitive grammar and beyond. Also, it describes how any Turing machine can be implemented as a feature grammar showing that the powe...
متن کاملNon-Confluent NLC Graph Grammar Inference by Compressing Disjoint Subgraphs
Grammar inference deals with determining (preferable simple) models/grammars consistent with a set of observations. There is a large body of research on grammar inference within the theory of formal languages. However, there is surprisingly little known on grammar inference for graph grammars. In this paper we take a further step in this direction and work within the framework of node label con...
متن کاملStudents can get excited about Formal Methods: a model-driven course on Petri-Nets, Metamodels and Graph Grammars
Formal Methods have always been controversial. In spite of the fact that the disbelief about their usefulness has been corrected by a growing number of applications and even more publications, it remains a challenge to demonstrate the strengths and weaknesses of formal methods within the time constraints of a typical semester course. This paper reports on a new course at the University of Antwe...
متن کامل