A Graph Rewriting Approach for Transformational Design of Digital Systems

Transformational design integrates design and verification. It combines “correctness by construction” and design creativity by the use of pre-proven behaviour preserving transformations as design steps. The formal aspects of this methodology are hidden in the transformations. A constraint is the availability of a design representation with a compositional formal semantics. Graph representations are useful design representations because of their visualisation of design information. In this paper graph rewriting theory, as developed in the last twenty years in mathematics, is shown to be a useful basis for a formal framework for transformational design. The semantic aspects of graphs which are no part of graph rewriting theory are included by the use of attributed graphs. The used attribute algebra, table algebra, is a relation algebra derived from database theory. The combination of graph rewriting, table algebra and transformational design is new

Generative grammar

Generative Grammar is the label of the most influential research program in linguistics and related fields in the second half of the 20. century. Initiated by a short book, Noam Chomsky's Syntactic Structures (1957), it became one of the driving forces among the disciplines jointly called the cognitive sciences. The term generative grammar refers to an explicit, formal characterization of the (largely implicit) knowledge determining the formal aspect of all kinds of language behavior. The program had a strong mentalist orientation right from the beginning, documented e.g. in a fundamental critique of Skinner's Verbal behavior (1957) by Chomsky (1959), arguing that behaviorist stimulus-response-theories could in no way account for the complexities of ordinary language use. The "Generative Enterprise", as the program was called in 1982, went through a number of stages, each of which was accompanied by discussions of specific problems and consequences within the narrower domain of linguistics as well as the wider range of related fields, such as ontogenetic development, psychology of language use, or biological evolution. Four stages of the Generative Enterprise can be marked off for expository purposes

From 'scientific revolution' to 'unscientific revolution': an analysis of approaches to the history of generative linguistics

This paper is devoted to the challenge that generative linguistics poses for linguistic historiography. As a first step, it presents a systematic overview of 19 approaches to the history of generative linguistics. Second, it analyzes the approaches overviewed by asking and answering the following questions: (a) To what extent and how are the views at issue biased? (b) What central topics do the approaches discuss, how successfully do they tackle them, and how do the various standpoints converge and diverge? (c) How do the approaches relate to general trends in the philosophy and history of science? The concluding step summarizes our findings with respect to Chomsky’s impact on linguistic historiography

An Analysis on Syntactic and Semantic Factors Found in Newspaper Headlines

As a type of media text, newspaper has an important role in human\u27s life because it presents various local, national and International information and events. In order to attract readers\u27 attention, journalists make the headlines as ambiguous and confusing as possible so that readers are curious to know the content of the whole story and they would read it. Moreover, in presenting the information or events, different reporters will have different linguistic choices which include the choice of words and expressions and different linguistic structures. Thus, this paper analyzes how the different linguistic choices and structures used in the headlines of The Jakarta Post and Indonesian Daily News would construct different linguistic representations of events in the world

An Analysis on Syntactic and Semantic Factors Found in Newspaper Headlines

As a type of media text, newspaper has an important role in human\u27s life because it presents various local, national and International information and events. In order to attract readers\u27 attention, journalists make the headlines as ambiguous and confusing as possible so that readers are curious to know the content of the whole story and they would read it. Moreover, in presenting the information or events, different reporters will have different linguistic choices which include the choice of words and expressions and different linguistic structures. Thus, this paper analyzes how the different linguistic choices and structures used in the headlines of The Jakarta Post and Indonesian Daily News would construct different linguistic representations of events in the world

A static analysis for quantifying information flow in a simple imperative language

We propose an approach to quantify interference in a simple imperative language that includes a looping construct. In this paper we focus on a particular case of this definition of interference: leakage of information from private variables to public ones via a Trojan Horse attack. We quantify leakage in terms of Shannon's information theory and we motivate our definition by proving a result relating this definition of leakage and the classical notion of programming language interference. The major contribution of the paper is a quantitative static analysis based on this definition for such a language. The analysis uses some non-trivial information theory results like Fano's inequality and L1 inequalities to provide reasonable bounds for conditional statements. While-loops are handled by integrating a qualitative flow-sensitive dependency analysis into the quantitative analysis

Recovering Grammar Relationships for the Java Language Specification

Grammar convergence is a method that helps discovering relationships between different grammars of the same language or different language versions. The key element of the method is the operational, transformation-based representation of those relationships. Given input grammars for convergence, they are transformed until they are structurally equal. The transformations are composed from primitive operators; properties of these operators and the composed chains provide quantitative and qualitative insight into the relationships between the grammars at hand. We describe a refined method for grammar convergence, and we use it in a major study, where we recover the relationships between all the grammars that occur in the different versions of the Java Language Specification (JLS). The relationships are represented as grammar transformation chains that capture all accidental or intended differences between the JLS grammars. This method is mechanized and driven by nominal and structural differences between pairs of grammars that are subject to asymmetric, binary convergence steps. We present the underlying operator suite for grammar transformation in detail, and we illustrate the suite with many examples of transformations on the JLS grammars. We also describe the extraction effort, which was needed to make the JLS grammars amenable to automated processing. We include substantial metadata about the convergence process for the JLS so that the effort becomes reproducible and transparent