This directory is created automatically and some papers may be mislabeled. Only document within the CiteSeer database are listed. The directory is intended to provide entry points for browsing the database and is not intended to be authoritative. Papers may not appear in all relevant categories. For example, papers in a sub-category may not appear in higher level categories.
301 The Well-Founded Semantics for General Logic Programs - Van Gelder, Ross, Schlipf (1991)(Correct)
A general logic program (abbreviated to "program" hereafter) is a set of rules that have both positive and negative subgoals. It is common to view a deductive database as a general logic program consi... / F. . Mathematical Logic and Formal Languages Mathematical Logic - br D. . Programming Languages Formal Definitions and Theory
279 A Framework for Defining Logics - Harper, Honsell, Plotkin (1987)(Correct)
The Edinburgh Logical Framework (LF) provides a means to define (or present) logics. It is based on a general treatment of syntax, rules, and proofs by means of a typed -calculus with dependent types.... / F. . Mathematical Logic and Formal Languages Mathematical Logic.
267 Dynamic Logic - Harel, Kozen, Tiuryn (1984)(Correct)
ed to be true under the valuation u iff there exists an a 2 N such that the
formula x
= y is true under the valuation u[x=a], where u[x=a] agrees with u
everywhere except x, on which it takes the v... / logic computability formal languages and automata and program br theory Kozen a formal languages automata and
206 A Theory of Timed Automata - Alur, Dill (1994)(Correct)
We propose timed (finite) automata to model the behavior of realtime
systems over time. Our definition provides a simple, and yet powerful, way to
annotate state-transition graphs with timing constr... / from the perspective of formal language theory we consider closure br automatic verification formal languages and automata theory.
163 Formal Methods: State of the Art and Future Directions - Clarke, Wing (1996)(Correct)
ing with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works, requires prior specific permission and... / Mathematical Logic and Formal Languages Mathematical br on Principles of Programming Languages Formal Methods State of the Art
138 Domain Theory - Abramsky, Jung (1994)(Correct)
bases were introduced in [Smyth, 1977] where they are called "R-structures". Examples
of abstract bases are concrete bases of continuous domains, of course, where the relation OE is the
restriction of... / this result in the context of formal language theory were Arden br and points We define a formal language of type expressions by the
130 Radiosity and realistic image synthesis - Cohen, Wallace (1993)(Correct)
this paper, such as the global distribution of radiative energy in the tree crowns, which affects the amount of light reaching the leaves and the local temperature of plant organs. The presented frame... / development. In Handbook of formal languages G. Rozenberg and A.
121 Telos: Representing Knowledge About Information Systems - Mylopoulos, Borgida, Jarke.. (1990)(Correct)
This paper describes a language that is intended to support software engineers in the development
of information systems throughout the software lifecycle. This language is not a programming
language.... / or design languages formal languages or natural languages br such as programming or design languages formal languages or natural
82 What Every Computer Scientist Should Know About Floating Point.. - Goldberg (1991)(Correct)
page 154 Introduction page 154 Rounding Err or page 155 The IEEE Standard page 171 Systems Aspects page 193 The Details page 207 Summary page 221 Acknowledgments page 222 References page 222 Theorem 1... / languages D. . Programming Languages Formal Definitions and Theory
81 A Modal Analysis of Staged Computation - Davies, Pfenning (1996)(Correct)
ing with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works, requires prior specific permission and... / F. . Mathematical Logic and Formal Languages Mathematical
78 The Syntax Definition Formalism SDF - Reference Manual - - Heering, Hendriks, Klint, Rekers (1992)(Correct)
SDF is a formalism for the definition of syntax which is comparable to BNF in some respects, but has a wider scope in that it also covers the definition of lexical and abstract syntax. Its design and ... / Snelting. The PSG system from formal language definitions to interactive br D. . Programming Languages Formal Definitions and
76 The Syntax Definition Formalism SDF - Reference Manual - Heering, Hendriks, Klint, Rekers (2001)(Correct)
SDF is a formalism for the de nition of syntax which is comparable unknown The Syntax De nition Formalism SDF
|Reference Manual|
J. Heering,
P.R.H. Hendriks,
P. Klint
and J. Rekers
June 14, 2001... / Snelting. The PSG system from formal language de nitions to interactive br D. . Programming Languages Formal De nitions and
69 Linearity and the Pi-Calculus - Kobayashi, Pierce, Turner (1996)(Correct)
this article (Section 8 mentions some related work on this topic). unknown Linearity and the Pi-Calculus
NAOKI KOBAYASHI
University of Tokyo
BENJAMIN C. PIERCE
University of Pennsylvania
and
DAVID N. ... / D. . Programming Languages Formal Definitions and Theory
67 A Needed Narrowing Strategy - Antoy, Echahed, Hanus (1994)(Correct)
The narrowing relation over terms constitutes the basis of the most important operational semantics of languages that integrate functional and logic programming paradigms. It also plays an important r... / F. . Mathematical Logic and Formal Languages Grammars and Other
65 Modelling Concurrency with Partial Orders - Pratt (1986)(Correct)
Concurrency has been expressed variously in terms of formal languages (typically via
the shuffle operator), partial orders, and temporal logic, inter alia. In this paper we extract
from these three ap... / variously in terms of formal languages typically via the shuffle br analogous to those of formal languages that could be interpreted as
61 On Unifying Some Cryptographic Protocol Logics - Syverson, van Oorschot (1994)(Correct)
We present a logic for analyzing cryptographic protocols. This logic encompasses a unification of four of its predecessors in the BAN family of logics, namely those given in [GNY90], [AT91], [vO93], a... / T We actually require two formal languages one for messages and one
59 A Formal Basis for Architectural Connection - Allen, Garlan (1997)(Correct)
Machine as the underlying formalism [Inverardi and Wolf 1995]. 246 . Robert Allen and David Garlan ACM Transactions on Software Engineering and Methodology, Vol. 6, No. 3, July 1997. 13.4 Style An imp... / F. . Mathematical Logic and Formal Languages Formal Languages-CSP br Logic and Formal Languages Formal Languages-CSP General Terms
56 Temporal Query Languages: a Survey - Chomicki (1995)(Correct)
We define formal notions of temporal domain and temporal database, and use them
to survey a wide spectrum of temporal query languages. We distinguish between an
abstract temporal database and its conc... / database ffl query languages formal semantics expressiveness
50 Parsing English with a Link Grammar - Sleator, Temperley (1991)(Correct)
We develop a formal grammatical system called a link grammar, show how English grammar can
be encoded in such a system, and give algorithms for efficiently parsing with a link grammar.
Although the ex... / natural language processing formal languages . Introduction Most br of link grammars our new formal language system. A link grammar
45 Object-Preserving Class Transformations - Bergstein (1991)(Correct)
Reorganization of classes for object-oriented programming
and object-oriented database design has
recently received considerable attention in the literature.
In this paper a small set of primitive
tra... / two basic mechanisms used in formal languages concatenation and
41 Spatial Reasoning with Propositional Logics - Bennett (1994)(Correct)
I present a method for reasoning about spatial relationships on the basis of entailments in propositional logic. Formalisms for representing topological and other spatial information (e.g. [2] [10] [1... / in a number of different formal languages. This semantics can be
40 How to Declare an Imperative - Wadler (1995)(Correct)
How can we integrate interaction into a purely declarative language? This tutorial describes a solution to this problem based on a monad. The solution has been implemented in the functional language H... / F. . Mathematical Logic and Formal Languages Mathematical
40 Petri Net Algorithms in the Theory of Matrix Grammars - Hauschildt, Jantzen (1994)(Correct)
This paper shows that the languages over a one-letter alphabet generated by a
context-free matrix grammar are always regular. Moreover we give a decision procedure
for the question of whether a contex... / importance in the theory of formal languages. Here they are regarded as br to certain problems in formal language theory in which ffl the
40 The Complexity of Logic-Based Abduction - Eiter, Gottlob (1993)(Correct)
Abduction is an important form of nonmonotonic reasoning allowing one to find explanations for certain symptoms or manifestations. When the application domain is described by a logical theory, we spea... / Mathematical Logic and Formal Languages Mathematical Logic
39 Anytime Deduction for Probabilistic Logic - Frisch (1994)(Correct)
This paper proposes and investigates an approach to deduction in probabilistic logic, using as its medium a language that generalizes the propositional version of Nilsson's probabilistic logic by inco... / this rift by developing formal languages integrating probability with
38 A Polymorphic Record Calculus and Its Compilation - Ohori (1995)(Correct)
this article appeared in Proceedings of ACM Symposium on Principles of Programming Languages, 1992, under the title \A compilation method for ML-style polymorphic record calculi." This work was partly... / D. . Programming Languages Formal De nitions and Theory
38 Methods and Rules - Serge Abiteboul Georg (1993)(Correct)
We show how classical datalog semantics can be used directly
and very simply to provide semantics to a syntactic
extension of datalog with methods, classes, inheritance,
overloading and late binding. ... / step towards flexible and formal languages for databases. A major
34 A Schema Theorem for Context-Free Grammars - Whigham (1995)(Correct)
The basic Schema Theorem for genetic algorithms is modified for a grammatically-based
learning system. A context-free grammar is used to define a language in which each sentence
is mapped to a fitness... / An introduction to formal languages may be found in .
30 Parametric Shape Analysis via 3-Valued Logic - Sagiv, Reps, Wilhelm (1999)(Correct)
We present a family of abstract-interpretation algorithms that are capable of determining "shape invariants" of programs that perform destructive updating on dynamically allocated storage. The main id... / F. . Mathematical Logic and Formal Languages Mathematical
30 Tree-Adjoining Grammars - Joshi, Schabes (1997)(Correct)
this paper, we will describe a tree generating system called tree-adjoining grammar (TAG) and state some of the recent results about TAGs. The work on TAGs is motivated by linguistic considerations. H... / of interest to researchers in formal languages and automata including those br properties investigated in formal language theory and automata theory
28 Process And Policy: Resource-Bounded Non-Demonstrative Reasoning - Loui (1993)(Correct)
This paper investigates the appropriateness of formal dialectics as a basis for non-monotonic reasoning and defeasible reasoning that takes computational limits seriously. Rules that can come into con... / of mathematically satisfying formal languages. For non-demonstrative
25 Action Logic and Pure Induction - Pratt (1991)(Correct)
In Floyd-Hoare logic, programs are dynamic while assertions are static (hold at states). In action
logic the two notions become one, with programs viewed as on-the-fly assertions whose truth is evalua... / regular expressions as formal languages sets of strings over some br more strings of L. In the formal language literature the quotient
25 A Multiple-Method Knowledge-Acquisition Shell for the Automatic.. - Angel Puerta John (1992)(Correct)
The use of predefined models of problem-solving methods is receiving considerable attention from researchers in the
area of knowledge acquisition. Using these models, developers of knowledge-acquisiti... / also describe the use of two formal languages developed to provide br descriptions written in a formal language and produce specialized
25 Two-dimensional languages - Giammarresi, Restivo (1997)(Correct)
this paper, much work have been done in studying properties of picture languages recognized
by finite-state machines and several other models have been designed. A survey on this subject can
be found ... / concepts and techniques of formal language theory to two dimensions. br pictures. A generalization of formal languages to two dimensions is possible
25 An Algorithm for Approximate Tandem Repeats - Landau, Schmidt, Sokol (1993)(Correct)
A perfect single tandem repeat is defined as a nonempty string that can be divided into two identical
substrings, e.g. abcabc. An approximate single tandem repeat is one in which the substrings are s... / can be found in research in formal languages see a survey in ML
24 Speech Recognition by Composition of Weighted Finite Automata - Pereira, Riley (1996)(Correct)
We present a general framework based on weighted finite automata and weighted finite-state transducers for describing and implementing speech recognizers. The framework allows us to represent uniforml... / of language and transduction in formal language theory A weighted br used in many aspects of formal language theory and weighted
24 Metalogical Frameworks - Basin, Constable (1992)(Correct)
In computer science we speak of implementing a logic; this is done in a programming
language, such as Lisp, called here the implementation language. We also reason
about the logic, as in understanding... / of automata theory formal languages and programming logics.
24 The Expression Of Graph Properties And Graph Transformations In.. - Courcelle (1997)(Correct)
this paper is monadic second-order logic which
lies inbetween rst-order and second-order logic. unknown THE EXPRESSION OF GRAPH PROPERTIES AND GRAPH
TRANSFORMATIONS IN MONADIC SECOND-ORDER LOGIC
B.... / important in the theory of formal languages. It replaces because no br notion in the extension of formal language theory to graphs
24 The Pan Language-Based Editing System - Ballance, Graham, Vanter (1991)(Correct)
Powerful editing systems for developing complex software documents are difficult to engineer. Besides requiring efficient incremental algorithms and complex data structures, such editors must integrat... / use a variety of more formal languages to describe both software br from knowledge of underlying formal languages for example the connection
23 Continuation-Based Partial Evaluation - Lawall, Danvy (1993)(Correct)
Partial evaluation aims at specializing programs; it is based on call unfolding, constant propagation,
and constant folding along the control and data flows of a source program. A continuation
represe... / F. . Mathematical Logic and Formal Languages Mathematical Logic- br D. . Programming Languages Formal Definition and
23 Higher-Order Logic as the Basis for Logic Programming - Nadathur (1989)(Correct)
A generalization of Horn clauses to a higher-order logic is described and examined as a basis for logic programming. In qualitative terms, these higher-order Horn clauses are obtained from the first... / F. . Mathematical Logic and Formal Languages Mathematical Logic - br D. . Programming Languages Formal Definitions and Theory -
23 TIGUKAT: A Uniform Behavioral Objectbase Management System - Peters (1994)(Correct)
Object-oriented computing is influencing many areas of computer science, including database systems. Despite many advances, object-oriented computing is still in its infancy and a universally accepted... / to the base object model. The formal languages include a declarative object br prove the equivalence of the formal languages. A reduction of the TIGUKAT
22 Probabilistic predicate transformers - Morgan, McIver, Seidel (1995)(Correct)
this paper is to link Kozen's and He's models --- we show that the relations of He provide a more general operational semantics underlying the predicate transformers of Kozen, leading in particular to... / Proofs D. . Programming Languages Formal Definitions and Theory
21 The Computational Analysis Of The Syntax And Interpretation Of "Free" .. - Hoffman (1995)(Correct)
THE COMPUTATIONAL ANALYSIS OF THE SYNTAX AND
INTERPRETATION OF "FREE" WORD ORDER IN TURKISH
Author: Beryl Hoffman
Supervisor: Mark Steedman
In this dissertation, I examine a language with "free" word... / . Formal Languages br the grammar for these formal languages. However the empty string
21 Generalized Alignment - McCarthy, Prince(Correct)
this paper. Financial support was provided to McCarthy by a fellowship from the John Simon Guggenheim Memorial Foundation and a Faculty Research Grant from the University of Massachusetts and to Princ... / specifying a class of formal languages that when substantive
21 DNA computing: arrival of biological mathematics - Kari (1997)(Correct)
This article has benefited from discussions with
Leonard Adleman, Mark Gijzen, Greg Gloor, Tom Head, Jarkko Kari, Gheorghe
Paun, Clive Reis, Arto Salomaa, Gabriel Thierrin and Gary Walsh, to all
of wh... / is within the framework of formal language theory a branch of discrete br Our exposition requires a few formal language notions and notations
20 Combinatorics of words - Choffrut, Karhumäki (1997)(Correct)
Introduction
The basic object of this chapter is a word, that is a sequence -- finite or
infinite -- of elements from a finite set. The very definition of a word immediately
imposes two characteristi... / from the point of view of formal languages. We do not intend to be br to their relevance to formal languages we have paid a special
20 Closure Analysis in Constraint Form - Palsberg (1995)(Correct)
Interpretation
Bondorf's definition can be simplified considerably. To see why, consider the
second component of CMap(E) \Theta CEnv(E). This component is updated only in
Closure Analysis in Constr... / D. . Programming Languages Formal Definitions and
20 Reasoning about Knowledge and Probability - Fagin, Halpern (1994)(Correct)
We provide a model for reasoning about knowledge and probability
together. We allow explicit mention of probabilities in formulas, so
that our language has formulas that essentially say "according t... / they have not considered formal languages containing knowledge and
19 Membership for Limited ET0L Languages Is Not Decidable - Fernau (1994)(Correct)
In this paper, we show how to encode arbitrary enumerable set of numbers
given by register machines within limited EPT0L systems and programmed grammars with
unconditional transfer. This result has ... / lET L systems. Keywords Formal languages parallel and regulated br is one of the main topics of formal language theory since there
19 Automatic Average-Case Analysis Of Algorithms - Flajolet, al. (1991)(Correct)
Many probabilistic properties of elementary discrete combinatorial structures of interest for the average--case analysis of algorithms prove to be decidable. This paper presents a general framework ... / from the classical theory of formal languages and enumerations. Example br In Computer Programing and Formal Languages P. Braffort and D.
19 Partial Commutation and Traces - Diekert, Métivier (1997)(Correct)
Contents
1 Introduction : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 2
2 Free Partially Commutative Monoids : : : : : : : : : : : : : : : 3
2.1 First Definitions and Basic Propertie... / interest in algebra formal languages and combinatorics. Since the br appear . Special issue on Formal Language Theory. . Volker Diekert
19 Regularity of Splicing Languages - Pixton (1995)(Correct)
Motivated by the recombinant behavior of DNA, Tom Head introduced a scheme for the evolution of formal languages called splicing. We give a simpler proof of the fundamental fact that the closure of ... / a scheme for the evolution of formal languages called splicing. We give a br can be found in most texts on formal languages. Our proofs of regularity use
18 CPS Transformation after Strictness Analysis - Danvy, Hatcliff (1993)(Correct)
syntax of the source language
` c : ' f:::; x : ø ; :::g ` x : ø
ß ` e : ø !ø
ß ` fix e : ø
ß [ fx : ø 1 g ` e : ø 2
ß ` x : ø 1 : e : ø 1 !ø 2
ß ` e 0 : ø 1 !ø 2 ß ` e 1 : ø 1
ß ` @ e 0 e 1 : ø 2... / F. . Mathematical Logic and Formal Languages Mathematical br D. . Programming Languages Formal Definition and
18 DNA Computing Based on Splicing: The Existence of Universal Computers - Freund, Kari, al. (1995)(Correct)
Splicing systems are generative mechanisms based on the splicing operation introduced by Tom Head as a model of DNA recombination. We prove that the generative power of finite extended splicing syst... / . Mathematical Logic and Formal Languages Grammars and Other br squeezing operation which in formal language terms amounts to the
18 A Comparison of Languages which Operationalize and Formalise KADS.. - Fensel, van Harmelen (1994)(Correct)
In the field of Knowledge Engineering, dissatisfaction with the rapidprototyping approach has led to a number of more principled methodologies for the construction of knowledge based systems. Instea... / KBS. We describe eight formal languages for KADS models of expertise br unambiguous and preferably formal language that abstracts from
18 From Algol to Polymorphic Linear Lambda-calculus - O'Hearn, Reynolds (1997)(Correct)
ion and Store Shapes . . . . . . . . . . 6 2 Two Variations on Algol 8 2.1 Idealized Algol . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 Name: P.W. O'Hearn Address: Department of Compu... / D. . Programming Languages Formal Definitions and
17 A Reflection on Call-by-Value - Sabry, Wadler (1996)(Correct)
This article is a revised and extended version of a paper that appeared in the ACM SIGPLAN
International Conference on Functional Programming (Philadelphia, Pa.), 1996. Work started
while the first au... / Mathematical Logic and Formal Languages Mathematical Logic
17 Aligning A Parallel English-Chinese Corpus Statistically With Lexical .. - Wu (1994)(Correct)
We describe our experience with automatic alignment of sentences in parallel English-Chinese texts. Our report concerns three related topics: (1) progress on the HKUST English-Chinese Parallel Bilingu... / of the four major Han Chinese languages. Formal written Cantonese employs
17 Ontologies: Principles, Methods and Applications - Uschold, Grüninger (1996)(Correct)
This paper is intended to serve as a comprehensive introduction to the emerging field concerned with the design and use of ontologies. We observe that disparate backgrounds, languages, tools, and tech... / and discuss the role of formal languages and techniques in the br . The Role of Formal Languages
16 Plausibility Measures and Default Reasoning - Friedman (1996)(Correct)
this paper: default reasoning. In recent years, a number of different semantics for defaults have been proposed, such as preferential structures, ffl-semantics, possibilistic structures, and -rankings... / F. . Mathematical Logic and Formal Languages Mathematical Logic
16 win and sin: Predicate Transformers for Concurrency - Lamport (1990)(Correct)
This paper is primarily concerned with applications of win and sin rather than with their formal properties. The treatment of the formalism is brief, and no attempt is made to develop a complete proof... / proofs D. . Programming Languages Formal Definitions and
16 Polymorphism and Type Inference in Database Programming - Buneman, Ohori(Correct)
In order to find a static type system that adequately supports database languages, we need to express the most general type of a program that involves database operations. This can be achieved through... / D. . Programming Languages Formal De nitions and Theory
16 The Three Dimensions of Requirements Engineering - Pohl (1993)(Correct)
Requirements engineering (RE) is perceived as an area of growing importance.
Due to the increasing effort spent for research in this area many contributions
to solve different problems within RE exi... / more people suggest to use a formal language for representing the br of the system. Additionally a formal language offers the possibility of
15 Event-Clock Automata: A Determinizable Class of Timed Automata - Alur, Fix, Henzinger (1999)(Correct)
We introduce event-recording automata. An event-recording automaton
is a timed automaton that contains, for every event a, a clock that records the time
of the last occurrence of a. The class of eve... / behaviors of a system is a formal language and the system can be br the system also constitute a formal language the requirements
15 Analysis of Dynamical Recognizers - Blair, Pollack (1996)(Correct)
Pollack (1991) demonstrated that second-order recurrent neural networks
can act as dynamical recognizers for formal languages when trained on positive
and negative examples, and observed both phase tr... / as dynamical recognizers for formal languages when trained on positive and br may be trained to recognize formal languages from examples. The resulting
15 Classification Of Research Efforts In Requirements Engineering - Zave (1997)(Correct)
This paper presents a classification scheme for research efforts in requirements engineering. For those readers who are not familiar with requirements engineering, it is intended to provide an overvie... / Solutions to problems formal languages and analysis algorithms
15 Axel Thue's work on repetitions in words - Berstel (1992)(Correct)
The purpose of this survey is to present, in contemporary terminology,
the fundamental contributions of Axel Thue to the study of combinatorial
properties of sequences of symbols, insofar as repetit... / A. Salomaa Jewels of Formal Language Theory Computer Science
14 Asymptotic Properties Of Data Compression And Suffix Trees - Szpankowski (1993)(Correct)
Recently, Wyner and Ziv have proved that the typical length of a repeated subword found within the first n positions of a stationary ergodic sequence is (1=h) log n in probability where h is the entro... / compression in the theory of formal languages and in the design and
14 A Compendium of Problems Complete for P - Greenlaw, Hoover, Ruzzo (1991)(Correct)
This paper serves two purposes. Firstly, it is an elementary introduction to the
theory of P-completeness --- the branch of complexity theory that focuses on identifying
the problems in the class P th... / A. Formal Languages br flow local optimality logic formal languages algebraic geometry real
14 Visual Models of Plants Interacting with Their Environment - Mech, Prusinkiewicz (1996)(Correct)
Interaction with the environment is a key factor affecting the development
of plants and plant ecosystems. In this paper we introduce a
modeling framework that makes it possible to simulate and visual... / F. . Mathematical Logic and Formal Languages Grammars and Other br development. In Handbook of formal languages G. Rozenberg and A.
14 Super Logic Programs - Brass, Przymusinski (2000)(Correct)
this paper, we specialize it to a class of theories
called "super logic programs". We argue that these programs form a natural generalization of
standard logic programs. In particular, they allow disj... / F. . Mathematical Logic and Formal Languages Mathematical br translate this rule set into a formal language and then to analyze its
14 Towards a Methodology for Building Ontologies - Uschold, King (1995)(Correct)
We outline some requirements for a comprehensive methodology for building ontologies, and review some important work that has been done in the area which could contribute to this goal. We describe our... / of coding the ontology in a formal language nor how it might be br but less formal than a formal language. He proposes a specific
14 Sur La Complexité Des Suites Infinies - Allouche (1994)(Correct)
The complexity of an infinite sequence taking its values in a finite set counts the number of factors (subwords) of given length of this sequence. We give a quick view of complexity results for differ... / and squarefreeness of formal languages Lecture Notes in Computer br G. Rozenberg On subwords of formal languages Lecture Notes in Computer
13 On the Interleaving Semantics of Transformation Units - A Step into.. - Kreowski, Kuske (1994)(Correct)
The aim of the paper is to introduce the notion of a transformation unit together with its interleaving semantics and to study it as a means of constructing large graph transformation systems from sma... / and logic programming formal languages algebraic specification br objects is quite popular in formal language theory. . Graph theoretic
13 Artificial Intelligence: A Computational Perspective - Nebel (1994)(Correct)
Although the computational perspective on cognitive tasks has always
played a major role in Artificial Intelligence, the interest in the precise
determination of the computational costs that are requi... / problems are also viewed as formal languages formed by the yes
13 Precise Flow-Insensitive May-Alias Analysis is NP-Hard - Horwitz (1997)(Correct)
this paper we show that precise flow-insensitive
may-alias analysis is NP-hard given arbitrary levels of pointers and arbitrary pointer dereferencing. unknown Precise Flow-Insensitive May-Alias Analys... / F. . Mathematical Logic and Formal Languages Mathematical Logic- br F. . Mathematical Logic and Formal Languages Formal Languages
13 Undecidability of Static Analysis - Landi (1992)(Correct)
Static Analysis of programs is indispensable to any software tool, environment, or system
that requires compile time information about the semantics of programs. With the
emergence of languages like... / F. . Math Logic and Formal Languages Mathematical Logic Gamma
13 Modular Logic Programming - Brogi, Mancarella, Pedreschi, Turini (1994)(Correct)
Transformational Metalogical
union [ [ ae [m
intersection " " ae " m
encapsulation ae m
import / / ae /m
Figure 6
together at the expense of an extra interpretation level, thus allowing the co... / Mathematical Logic and Formal Languages Mathematical
12 Modular Domain Specific Languages and Tools - Hudak (1998)(Correct)
A domain specific language (DSL) allows one to
develop software for a particular application domain
quickly and e#ectively, yielding programs that are
easy to understand, reason about, and maintain. O... / languages functional languages formal methods. Introduction
12 DECLARE: A Prototype Declarative Proof System for Higher Order Logic - Syme (1997)(Correct)
This report describes DECLARE, a prototype implementation of a declarative proof system for simple higher order logic. The purpose of DECLARE is to explore mechanisms of specification and proof that m... / of natural symbolic and formal languages sufficient to convince the
12 Two Components of An Action Language - Lifschitz (1996)(Correct)
Some of the recent work on representing action makes use of high-level action languages.
In this paper we show that an action language can be represented as the sum of two distinct
parts: an "action d... /
12 Gates Accept Concurrent Behavior - Gupta (1993)(Correct)
We represent concurrent processes as Boolean propositions or gates, cast in the role of acceptors of concurrent behavior. This properly extends other mainstream representations of concurrent behavior ... / understood today in terms of formal languages as sets of possibly infinite br between automata and formal languages. True concurrency makes
12 Context-Free Languages and Push-Down Automata - Autebert, Berstel, Boasson (1997)(Correct)
Contents
1. Introduction : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 2
1.1 Grammars : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : :... / M.A. Harrison. Introduction to Formal Language Theory. Addison-Wesley br E. Hopcroft and J. D. Ullman. Formal Languages and Their Relation to
11 Data-Oriented Language Processing - An Overview - Bod, Scha (1996)(Correct)
Data-oriented models of language processing embody the assumption that human language
perception and production works with representations of concrete past language experiences,
rather than with abstr... / natural languages after the formal languages of logic and mathematics as br Representation of Formal Languages Tenth Annual IEEE
11 On Probabilistic Model Checking - Huth, Kwiatkowska (1996)(Correct)
We give a probabilistic semantics to formulas of the modal mu-calculus, where models
are probabilistic transition systems and meanings are functions from states to the unit
interval. The meaning of a ... / the issue of probabilistic formal languages. Finally we redevelop br the familiar notion of a formal language being accepted by some
11 Parametricity and Local Variables - O'Hearn, Tennent (1995)(Correct)
We propose that the phenomenon of local state may be understood in terms of Strachey
's concept of parametric (i.e., uniform) polymorphism. The intuitive basis for our
proposal is the following analog... / D. . Programming Languages Formal Definitions and Theory -
11 Length Considerations in Context-free Languages - Raz (1997)(Correct)
In this paper we investigate languages containing at most a bounded number
of words of each length. We first show that the context-free languages for which
the number of words of every length is bound... / of languages. Key words. formal languages context-free grammars br considerations in the study of formal languages. In a recent series of
11 Features of Architecture Description Languages - Paul Kogut (1994)(Correct)
Introduction
1.1 Background: system architecture for system development?
The characteristic approach in mature engineering disciplines (e.g. civil and chemical engineering)
is to build systems (e.g.... / State machine formalisms Formal languages Graphical tools Analysis
11 Self-Alignment in Words and their Applications - Apostolico, Szpankowski (1992)(Correct)
Some quantities associated with periodicities in words are analyzed within the Bernoulli
probabilistic model. In particular, the following problem is addressed. Assume that a string
X is given, with... / theory in the theory of formal languages and in the design and
11 Splicing Semigroups of Dominoes and DNA - Culik, II, Harju (1991)(Correct)
We introduce semigroups of dominoes as a tool for working with sets of linked strings. In particular, we are interested in splicing semigroups of dominoes. In the special case of alphabetic (symbol-to... / In Head uses formal language theory to study informational br chosen this approach because formal languages theory does not yet deal
11 Formal Specification Languages in Knowledge and Software Engineering - Fensel (1995)(Correct)
During the last years, a number of formal specification languages for knowledge-based
systems (kbs) have been developed. Characteristics of such systems are a complex knowledge
base and an inference... / quite natural to compare formal languages for specifying kbs with br for specifying kbs with formal languages which were developed by the
11 The Concurrent Language Shared Prolog - Brogi, Ciancarini (1991)(Correct)
Shared Prolog is a new concurrent logic language. A Shared Prolog system is
composed of a set of parallel agents which are Prolog programs extended by a guard
mechanism. The programmer controls the gr... / F. . Mathematical Logic and Formal Languages Mathematical Logic -
11 Building Ontologies: Towards a Unified Methodology - Uschold (1996)(Correct)
The use and importance of ontologies is becoming more widespread, however building ontologies is largely a black art. The aim of this paper is to identify and characterise what we currently know and t... / of an ontology into the formal language Ontolingua More
10 Syntactic Codes and Grammar Refinement - Kracht (1995)(Correct)
We call syntactic coding a technique which converts syntactic principles or constraints
on representations into grammatical rules which can be implemented in any given rule grammar.
In this paper we... / techniques used here are from formal language theory boolean algebra and br algebra and dynamic logic. For formal languages consult any book for
10 Evolving Stochastic Context-Free Grammars from Examples Using a.. - Keller, Rüdi Lutz(Correct)
This paper describes an evolutionary approach to the problem of inferring stochastic context-free grammars from finite language samples. The approach employs a genetic algorithm, with a fitness functi... / grammars for a range of formal languages. Keywords grammatical br language modelling formal languages induction minimum
10 Compositional Semantics for a Language of Imperfect Information - Hodges (1997)(Correct)
We describe a logic which is the same as first-order logic except that it allows control over the
information that passes down from formulas to subformulas. For example the logic is adequate to
expres... / compositionality. With the formal languages of logic this problem doesn't br that depends only on Formal languages have built-in grammars but
9 Affix Grammars for Natural Languages - Koster (1991)(Correct)
Affix Grammars over a Finite Lattice (agfls), a simple form of two-level grammars
admitting quite efficient implementations, are proposed as a formalism to
express the syntax of natural languages. In ... / embraced the theory of Formal Languages which was already at that br greatly enlarged and enriched Formal Language theory. They have devised
9 Emergence of Net-grammar in Communicating Agents - Takashi Hashimoto (1996)(Correct)
Evolution of symbolic language and grammar is studied in a network model. Language is expressed
by words, i.e. strings of symbols, which are generated by agents with their own symbolic
grammar system.... / paper is organized as follows. Formal language and the Chomsky hierarchy are br Modeling . Basic of Formal Languages . . Word and Language
9 Case-Based Representation and Learning of Pattern Languages - Jantke, Lange (1993)(Correct)
Pattern languages seem to suit case-based reasoning particularly well.
Therefore, the problem of inductively learning pattern languages is paraphrased
in a case-based manner. A careful investigation r... / measures in terms of formal languages. Two basic semantics are br lists are understood to accept formal languages and if cases are formalized
9 Computational Foundations of Basic Recursive Function Theory - Constable, Smith (1988)(Correct)
The theory of computability, or basic recursive function theory as it is often called, is usually motivated and developed using Church's Thesis. Here we show that there is an alternative computability... / Mathe- matical Logic and Formal Languages Mathematical br class of terms of T In formal language theory the concept of an
9 Modelling Autosegmental Phonology with Multi-Tape Finite State.. - Wiebe (1992)(Correct)
Phonology may be briefly defined as the study of sound patterns in spoken language.
One of the most well-known computational models of phonology, Koskenniemi's two-level
phonology, is based on an unde... / also investigate the class of formal languages accepted by multi-tape br into the class of formal languages accepted by MSFAs. . .
9 Rewrite Systems for Integer Arithmetic - Walters, Zantema (1995)(Correct)
We present three term rewrite systems for integer arithmetic with addition, multiplication,
and, in two cases, subtraction. All systems are ground confluent and terminating;
termination is proved by s... / term rewriting specification languages formal semantics confluence
9 Animation of Plant Development - Prusinkiewicz, Hammel, Mjolsness (1993)(Correct)
This paper introduces a combined discrete/continuous model of
plant development that integrates L-system-style productions and
differential equations. The model is suitable for animating simulated
dev... / F. . Mathematical Logic and Formal Languages Grammars and Other br Smith. Plants fractals and formal languages. Proceedings of SIGGRAPH '
9 Composition and Integrity Preservation of Secure Reactive Systems - Pfitzmann, Waidner (2000)(Correct)
We consider compositional properties of reactive systems that are secure in a cryptographic sense. We follow the well-known simulatability approach, i.e., the specification is an ideal system and a re... / cryptographic de nitions in formal languages. This is almost orthogonal br main advantage of is a formal language calculus as machine
8 Using Natural Language Interfaces - Ogden, Bernick (1988)(Correct)
Introduction....................................1
Habitability ......................................2
2.0 Evaluation Issues ...........................4
3.0 Evaluations of Prototype and
Commercial ... / manager Other more formal languages vary on functional coverage br be as difficult to use as formal language systems. NLC Other
8 A Guided Tour Across the Boundaries of Learning Recursive Languages - Zeugmann, Lange (1994)(Correct)
The present paper deals with the learnability of indexed families of uniformly
recursive languages from positive data as well as from both, positive and
negative data. We consider the influence of var... / Inductive inference of formal languages may be characterized as the br in the limit. Gold-style formal language learning has been intensively
8 MobiS: A Specification Language for Mobile Systems - Mascolo (1999)(Correct)
New formal languages have been proposed for the specification of mobility aspects of systems and for understanding the recent devised technologies for mobile computing. In this paper we introduce Mobi... / Abstract. New formal languages have been proposed for the br when they should move. New formal languages are being proposed in order
8 On Binary Methods - Bruce, Cardelli, Castagna, Group.. (1995)(Correct)
data types, modules, packages; F.3.1 [Logics and Meanings of Programs ] Specifying
and Verifying and Reasoning about Programs --- logics of programs; F.3.2 [Logics and Meanings of
Programs ] Studies o... / D. . Programming Languages Formal Definitions and Theory -
8 Decision Problems For Patterns - Jiang (1995)(Correct)
We settle an open problem, the inclusion problem for pattern languages [1, 2]. This is the first known case where inclusion is undecidable for generative devices having a trivially decidable equivalen... / F. . Mathematical Logic and Formal Languages Formal Languages - br and Formal Languages Formal Languages -Decision problems
8 Control of Polynomial Dynamic Systems: An Example - Dutertre, al. (1994)(Correct)
This paper presents the application of algebraic techniques to the
control of a discrete event system. The system is described using Signal, a
data-flow language. An equational model is then elabora... / and Wonham is based on formal languages and automata DES are br to modelling DES based on formal languages and automata is the
8 Interconvertibility of Set Constraints and Context-Free Language.. - Melski, Reps (1998)(Correct)
We show the interconvertibility of context-free-language reachability problems and a class of setconstraint
problems: given a context-free-language reachability problem, we show how to construct a
set... / and regular expressions in formal language theory namely a problem can br to the situation one has in formal language theory with finite-state
8 Automatic Recognition of Tractability in Inference Relations - McAllester (1993)(Correct)
A procedure is given for recognizing sets of inference rules that generate
polynomial time decidable inference relations. The procedure can automatically
recognize the tractability of the inference ... / Mathematical Logic and Formal Languages Mathematical logic -
8 The Role of Natural Language in Requirements Engineering - Ryan (1993)(Correct)
It is argued that the potential role of natural language
processing in the requirements engineering process has
been overstated in the past, possibly due to fundamental
misunderstandings of the requir... / The benefits of formal languages for requirements
8 Branching Time and Partial Order in Temporal Logics - Penczek (1995)(Correct)
The aim of this paper is to present existing propositional temporal
logics with branching and partially ordered time. These logics are used
for specifying and proving properties of programs and syst... / paper is to present existing formal languages of propositional temporal br Computation Tree Logic CTL formal language restrictions of which
8 Computational Dialectics - Gordon (1994)(Correct)
The central task in practical problem solving is to identify and choose among
alterative courses of action. Computer science has failed to provide adequate tools for
supporting rational, effective a... / to express their positions in formal languages of any kind and the state of
8 Petri Nets with Marking-Dependent Arc Cardinality: Properties and.. - Ciardo (1994)(Correct)
We discuss P/T-nets where the arc cardinalities are allowed
to be marking-dependent expressions of various types, resulting in a hierarchy
of subclasses. Some of the language and decidability proper... / in computer science from formal languages decidability and complexity
7 Optimizing an Arbitrary Function is Hard for the Genetic Algorithm - Hart, Belew (1991)(Correct)
The Genetic Algorithm (GA) is generally portrayed as a search procedure which can optimize pseudo-boolean functions based on a limited sample of the function's values. There have been many attempts to... / the reader is familiar with formal language theory we generally follow br encodings used when defining formal languages for an integer k hki
7 Parsing of Context-Free Languages - Sikkel, Nijholt (1997)(Correct)
Parsing is the process of assigning structure to sentences. The structure
is obtained from the grammatical description of the language. Both in Computer
Science and in Computational Linguistics, conte... / Eds.The Handbook of Formal Languages Vol. II Springer Verlag br theoretical computer science formal languages. This description is often
7 A Graphical Environment for Design of Concurrent Real-Time Systems - Moser, Ramakrishna, KUTTY..(Correct)
ion, Composition, and Refinement
In RTGIL, as well as in other logics [Abadi and Lamport 1995], composition is
represented by the conjunction of specifications. A primary concern when composing
speci... / Mathemat- ical Logic and Formal Languages Mathematical br theorem proving Formal Languages-decision problems
7 Disjunctive Datalog - Eiter, Gottlob, Mannila (1997)(Correct)
We consider disjunctive datalog, a powerful database query language based on disjunctive logic programming. Briefly, disjunctive datalog is a variant of datalog where disjunctions may appear in the ru... / Math- ematical Logic and Formal Languages Mathematical Logic
7 An Overview of the ISO/VDM-SL Standard - Plat, Larsen (1992)(Correct)
VDM-SL, the notation incorporated in the formal
method VDM, is currently being standardized
under auspices of the International Standards
Institution (ISO) and the British Standards
Institution (BSI).... / BSI It is one of the few formal languages of which the syntax and the br complete formal definition of formal languages. Virtually all aspects of
7 Joining and Rotating Data with Molecules - Arita, Hagiya, Suyama (1997)(Correct)
DNA--based computing is an attempt to solve
computational problems with a large number of DNA
molecules. Many theoretical results have been reported
so far, but their conclusions are seldom supported ... / problems to modeling formal languages Although these results br - . T. Head Formal language theory and dna An analysis
7 Reserved Graph Grammar: A Specification Tool for Diagrammatic VPLs - Zhang, Zhang (1997)(Correct)
When implementing textual languages, formal grammars
are commonly used to facilitate understanding languages
and creating parsers. In the implementation of a
diagrammatic visual programming language (... / When implementing textual languages formal grammars are commonly used br the implementation of textual languages formal grammars are commonly used
7 A Connectionist Symbol Manipulator That Discovers the Structure of.. - Mozer, Das (1993)(Correct)
We present a neural net architecture that can discover hierarchical and recursive
structure in symbol strings. To detect structure at multiple levels,
the architecture has the capability of reducing s... / stack memory. In terms of formal languages the architecture can learn br the theoretically most powerful formal language recognizer and learning
7 Paradigm merger in natural language processing - Gazdar (1996)(Correct)
This chapter considers the revolution that has taken place in natural language
processing research over the last five years. It begins by providing
a brief guide to the structure of the field and then... / of computationally useful formal languages such as grammar and lexicon
7 Analytic Analysis of Algorithms - Flajolet (1992)(Correct)
The average case analysis of algorithms can avail itself of the development of synthetic methods in combinatorial enumerations and in asymptotic analysis. Symbolic methods in combinatorial analysis ... / range of applications includes formal languages tree enumerations br concern a variety of domains formal languages tree enumerations
7 A timed LOTOS supporting a dense time domain and including new timed.. - Leduc, Léonard (1993)(Correct)
A time extended version of LOTOS, denoted Timed LOTOS, is proposed for the modelling of
quantitative timed behaviours. In this language neither the syntax nor the semantics are restricted
to a specifi... / Mathematical Logic and Formal Languages Formal Languages br Logic and Formal Languages Formal Languages Programming Languages
7 Abstraction of Object-Oriented Data Models - Karl Lieberherr Paul (1990)(Correct)
ion of
Object-Oriented Data Models
Karl J. Lieberherr, Paul Bergstein, Ignacio Silva-Lepe
Northeastern University, College of Computer Science
Cullinane Hall, 360 Huntington Ave., Boston MA 02115
... / two basic mechanisms used in formal languages concatenation and