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.
FreshML: Programming with Binders Made Simple - Shinwell, Pitts, Gabbay (2003)(Correct)
FreshML extends ML with elegant and practical constructs for
declaring and manipulating syntactical data involving binding operations.
User-declared FreshML datatypes involving binders are
concrete, i... / of expressions in formal languages. A specification of an br spoils this rosy picture. Formal languages very often involve binding
Probabilistic Logic under Coherence, Model-Theoretic Probabilistic.. - Biazzo, al. (2002)(Correct)
We study probabilistic logic under the viewpoint of the coherence principle of de Finetti.
In detail, we explore how probabilistic reasoning under coherence is related to model-theoretic probabilistic... / There is a wide spectrum of formal languages that have been explored in br In particular we define a formal language of logical and conditional
A Brief Survey of Software Architecture - Land (2002)(Correct)
Software of today is becoming larger and more complex. More powerful ways of structuring complexity are
consequently required, whether it is about development methodologies, structural programming, na... / and there are a number of formal languages for description of a system's br to describe architectures in a formal language. A number of architectural
Probabilistic Logic under Coherence, Model-Theoretic Probabilistic.. - Biazzo, al. (2002)(Correct)
We study probabilistic logic under the viewpoint of the coherence principle of de Finetti. unknown I N F S Y S
R E S E A R C H E P O R T
Institut f ur Informationssysteme
Abtg. Wissensbasierte Syst... / There is a wide spectrum of formal languages that have been explored in br In particular we define a formal language of logical and conditional
On Bounded Specifications - Kupferman, Vardi (2002)(Correct)
Bounded model checking methodologies check the correctness of a
system with respect to a given specification by examining computations of a
bounded length. Results from set-theoretic topology imply ... /
From Checking to Inference via Driving and Dag Grammars - Secher, Sørensen (2002)(Correct)
Abramov and Gluck have recently introduced a technique called URA for inverting first order functional programs. Given some desired output value, URA computes a potentially infinite sequence of substi... / F. . Mathematical Logic and Formal Languages Grammars and other
AGATE: Unifying Languages and Operating Systems - Aycock (2002)(Correct)
AGATE is a novel operating system which unifies disparate areas such as compiler construction, operating systems, data compression, formal languages, inter-process communication, and program represent... / systems data compression formal languages inter-process br systems data compression formal languages inter-process
Communities in Graphs - Brinkmeier (2002)(Correct)
Many applications, like the retrieval of information from the WWW, require or are improved by the detection of sets of closely related vertices in graphs. Depending on the application, many approaches... /
Curriculum Vitæ - Calude (2002)(Correct)
ormation and Mathematical Sciences, Massey University at
Albany, Auckland,Np Zealand, from February 1999 on.
2. Tutor, Department ofComputer Science, The University ofAuckland,
Auckland,N
ew
Zealan... / ed.DLT' Developments of Formal Languages Fourth International
Concurrency in Computational Networks - Stuijk (2002)(Correct)
Future generations of embedded multi-media systems will have an increasing need for compute platforms that combine high compute power with low energy consumption. To meet with these requirements, mult... /
Maximal Introspection of Agents - Bolander (2002)(Correct)
This paper concerns the representation of introspective belief and knowledge in multi-agent systems. An introspective agent is an agent that has the ability to refer to itself and reason about its own... /
PCFG Learning by Nonterminal Partition Search - Belz (2002)(Correct)
pcfg Learning by Partition Search is a general grammatical
inference method for constructing, adapting and optimising pcfgs. Given
a training corpus of examples from a language, a canonical grammar ... /
XML Semantics Extension - Havasi (2002)(Correct)
Nowadays one of the best standards for storing structured data is XML. The key idea behind our paper is based on a relationship between XML documents and attribute grammars. This parallel makes it pos... /
Automata theory for XML researchers - Neven (2002)(Correct)
this paper is limited in two ways. It assumes
that the element names of XML documents are
from a finite and known set and it ignores the
data values in the leaf nodes and attributes of
XML documents. ... /
Self-Assembling Finite Automata - Klein, Kutrib (2002)(Correct)
We investigate a model of self-assembling finite automata. An automaton is assembled on demand during its computation from copies out of a finite set of items. The items are pieces of a finite automat... / to the theory of automata and formal languages. Basically the idea is to
String Transformation for n-Dimensional Image Compression - Kutrib, Löwe (2002)(Correct)
Image compression and manipulation by weighted
nite automata exploit
similarities in the images in order to obtain notable compression ratios and
manipulation tools. The investigations are often ba... / i.e. patterns can been seen as formal languages. Choosing a reasonable br space. In order to apply formal language and automata theory methods
Learning DFA from Simple Examples - Parekh, Honavar (2001)(Correct)
Efficient learning of DFA is a challenging research problem in grammatical inference. It is known that both exact and approximate (in the PAC sense) identifiability of DFA is hard. Pitt, in his semina... / in the Chomsky hierarchy of formal languages An understanding of
Type-Safe Linking with Recursive DLLs and Shared Libraries - Duggan (2001)(Correct)
type defs abstype unknown Type-Safe Linking with Recursive DLLs and Shared
Libraries
DOMINIC DUGGAN
Stevens Institute of Technology
Component-based programming is an increasingly prevalent theme in s... / D. . Programming Languages Formal Definitions and
An Evaluation of Scenario Notations for Telecommunication Systems.. - Amyot, Eberlein (2001)(Correct)
The elicitation, modeling and analysis of requirements have consistently been one of the main challenges
during the development of complex systems. Telecommunication systems belong to this category of... / and more convivial than formal languages. Their application to br entities. LOTOS is a formal language that has constructs similar
A Kleene/Büchi-like Theorem for Clock Languages - Bouyer, Petit (2001)(Correct)
We propose in this paper a generalization of the famous Kleene/Bchi's theorem on
formal languages, one of the cornerstones of theoretical computer science, to the timed
model of clock languages. These... / Kleene Bchi's theorem on formal languages one of the cornerstones of br of rational expressions in formal language theory. Rational expressions
The Intuitionism Behind Statecharts Steps - Lüttgen, Mendler (2001)(Correct)
SEMANTICS
We have seen in the previous section that the behavior of a parallel configuration
P in all parallel contexts is captured by its set of sequence models SM (P ) or,
equivalently, its behavi... / F. . Mathematical Logic and Formal Languages Mathematical br D. . Programming Languages Formal Definitions and
Logics Capturing Local Properties - Libkin (2001)(Correct)
Well-known theorems of Hanf and Gaifman establishing locality... In this paper, we give logical characterizations of local properties behind Hanf's and Gaifman's theorems. We first deal with an infini... / F. . Mathematical Logic and Formal Languages Mathematical Logic
An Integrated Environment for Knowledge Acquisition - Blythe, Kim, Ramachandran, Gil (2001)(Correct)
This paper describes an integrated acquisition interface that includes
several techniques previously developed to support users in various
ways as they add new knowledge to an intelligent system. As ... / Users do not know formal languages. We have developed br of what subexpressions in the formal language result in each substring of
Probabilistic Logic under Coherence: Complexity and Algorithms - Biazzo, Gilio, Lukasiewicz.. (2001)(Correct)
We study probabilistic logic under the viewpoint of the coherence principle of de Finetti. unknown I N F S Y S
R E S E A R C H E P O R T
Institut f ur Informationssysteme
Abtg. Wissensbasierte Sy... / There is a wide spectrum of formal languages that have been explored in br logic. In detail we define a formal language of logical and conditional
An Algebraic Characterization of Data and Timed Languages - Bouyer, Petit, Thérien (2001)(Correct)
Algebra offers an elegant and powerful approach to understand regular languages and finite automata. Such framework has been notoriously lacking for timed languages and timed automata. We introduce th... / making a bridge between formal languages and algebra. A most famous br a and d D. In the formal language case monoid recognizability
Basic Analytic Combinatorics of Directed Lattice Paths - Banderier, Flajolet (2001)(Correct)
This paper develops a unified enumerative and asymptotic theory of directed 2-dimensional lattice paths in half-planes and quarter-planes. The lattice paths are speci ed by a finite set of rules that ... / non-parametric tests formal language theory random generation of br on generation mechanisms and formal languages as is evidenced by the
Uni-transitional Watson-Crick D0L systems - Salomaa (2001)(Correct)
The phenomenon known as Watson-Crick complementarity is basic both in
the experiments and theory of DNA computing. While the massive parallelism
of DNA strands makes exhaustive searches possible, comp... / and ideas to the theory of formal languages can be seen also from the br Salomaa A. eds Handbook of Formal Languages Vol. - .
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
A Formal Analysis of the CORBA Security Service - Basin, Rittinger, Vigano (2001)(Correct)
We give a formal speci cation of the security service of
CORBA, the Common Object Request Broker Architecture
speci ed by the Object Management Group, OMG. In doing
so, we tackle the problem of how on... / service's data-model using the formal language Z. Through this process we br we focus on CORBA and use the formal language Z to give a formal analysis
An Agent-based Petri Net Model with Application to Seller/Buyer.. - Xu, Shatz (2001)(Correct)
Agents are becoming one of the most important topics
in distributed and autonomous decentralized systems
(ADS), and there are increasing attempts to use agent
technologies to develop software systems ... / systems includes using formal languages such as Z to provide a br of agents and designing formal languages such as DESIRE for
Modular Feature Specification - Turner (2001)(Correct)
CRESS (CHISEL Representation Employing Systematic Specification) is a notation and
set of tools for graphical specification and analysis of features. It is applicable wherever a
system consists of b... / translate them into various formal languages. The toolset is portable and
Constructor-based Conditional Narrowing - Antoy (2001)(Correct)
We define a transformation from a left-linear constructor-based conditional
rewrite system into an overlapping inductively sequential
rewrite system. This transformation is sound and complete for the... / Mathematical Logic and Formal Languages Grammars and Other
Recursion Schemes from Comonads - Uustalu, Vene, Pardo (2001)(Correct)
Within the setting of the categorical approach to total functional programming, we introduce a \many-in-one" recursion scheme that neatly uni es a variety of seemingly diverging strengthenings of th... / Mathematical Logic and Formal Languages Mathematical Logic Lambda
A Framework for Modeling Agent-Oriented Software - Xu, Shatz (2001)(Correct)
With the increasing importance of complex software
systems in the software industry, the need for using agent
technologies to develop large-scale commercial and
industrial software systems is growing ... / systems includes using formal languages such as Z to provide a br of agents designing formal languages such as DESIRE for
Failure Diagnosis of Discrete Event Systems with Linear-time Temporal .. - Jiang, Kumar (2001)(Correct)
Failure diagnosis problem of discrete event systems with linear-time temporal logic
speci cations is studied in this paper. Diagnosability of discrete event systems in the
temporal logic setting is ... / speci cations when compared to formal language automata-based speci br diagnoser compared to that of formal language automata-based speci
Une brève biographie scientifique de Maurice Nivat - Curien (2001)(Correct)
until now.
During the early seventies, in parallel with his scienti c work, Maurice began
to devote much time and energy to building research teams, both at IRIA
and at the university. IRIA (Institut... / the research on automata and formal languages on programming languages br Scienti c works. I Formal language theory. In his thesis
A Logical Characterization of Data Languages - Bouyer (2001)(Correct)
this paper is the following theorem, which states that the property language L is
equivalent to the data automata formalism. This theorem appears thus as an extension of Bchi's
theorem [Bc62] in the f... / Keywords real-time systems formal languages. Introduction The br The ideal case of formal languages. In the formal languages
Some Implications of MSC, SDL and TTCN Time Extensions for.. - Hogrefe, Koch, Neukirchen (2001)(Correct)
The purpose of this paper is to describe how computer-aided test generation methods can benefit from the time features and extensions to MSC, SDL and TTCN which are either already available or current... / time extensions to the formal languages as ITU-T recommendations. In br test sequence. Timer in Formal Languages The formal languages MSC
STCT: An Efficient Algorithm for Supervisory Control Design - Zhang, Wonham (2001)(Correct)
This paper introduces a new synthesis approach for the
supervisory control of discrete-event systems (DES).
Our algorithm, named S(mart)TCT after our software
package CTCT hitherto in use, is much mor... / is based on automata and formal languages in practice nite automata
An Authoring Tool for Informal and Formal Requirements Specifications - Hähnle, Johannisson, Ranta (2001)(Correct)
We describe foundations and design principles of a tool that
supports authoring of informal and formal software requirements specifications
simultaneously and from a single source. The tool is an at... / The usage of formal and semi-formal languages for requirements br and complex expressions in any formal language are not easy to read even
Topologies for the Set of Disjunctive - Words Ludwig Staiger (2001)(Correct)
An infinite sequence (!-word) is referred to as disjunctive provided
it contains every finite word as infix (factor). As Jrgensen
and Thierrin [JT83] observed the set of disjunctive !-words, D,
has a... / of the topologies derived from formal languages cf. St Here the set br languages in Handbook of Formal Languages G. Rozenberg and A. Salomaa
Consistency Checking of Distributed Documents - Nentwich (2001)(Correct)
Contents
1 Introduction 5
1.1 Problem statement . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5
1.2 Contribution . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ... / as the UML OMG and to formal languages such as Z Spivey br diagrams and modern semi-formal languages such as the UML is primarily
Parameterized Logic Programs - Where Computing Meets (2001)(Correct)
In this paper, we describe recent attempts to incorporate
learning into logic programs as a step toward adaptive software that can
learn from an environment. Although there are a variety of types of... / there exist stochastic formal languages such as hidden Markov models
A logic of probability with decidable model-checking - Beauquier (2001)(Correct)
A predicate logic of probability, close to logics of probability of Halpern and al., is introduced.
We consider the following model-checking problem: for a formula and a nite state Markov chain
to de... / properties Automata and formal languages. Introduction This
SAVCBS 2001 Proceedings - Specification And Verification (2001)(Correct)
Our goal is to investigate specification-based approaches to
testing OO components. That is, given a class C and its
specification, how do we test C to see if it meets its specification
? Two importan... / software D. . Programming Languages Formal Definitions and Theory br the nature of programming languages formal techniques for static
Origins of The IEEE Standard Upper Ontology - Ian Niles Adam (2001)(Correct)
this paper we discuss the origins of the
Standard Upper ontology effort (SUO, 2001), the
strategy used in created the current working draft
that will likely form the basis for the standard, as
well as... / they have the necessary formal languages to do so. Librarians and
Theory Of Formal Languages And Automata - Koslowski (2001)(Correct)
CONTENTS CONTENTS
Contents
0 Overview: the world of formal languages 1
0.0 From letters to language families . . . . . . . . . . . . . . . . . . . . . . . . . . . 1
0.1 Desirable closure properties o... /
Levels of Exploration - Diehl, Kerren (2001)(Correct)
Visualization of computational models is at the heart of educational software for computer science and related elds. In this paper we look at how generation of such visualizations and the visualizatio... / of increased exploration in formal language theory and compiler design br computer science e.g. formal languages automata theory and formal
From Plain English To Controlled English - Moll, Schwitter (2001)(Correct)
We outline an approach for transferring specifications and technical documents
written in plain English into controlled English. In a first step, we analyse the
sentences of the source documents and (... / computerprocessable like formal languages Schwitter Fuchs et al.
A Formal Data-Model of the CORBA Security Service - Basin, Rittinger, Viganò (2001)(Correct)
We use the formal language Z to specify and analyze the
security service of CORBA. In doing so, we tackle the problem
of how one can apply lightweight formal methods to
improve the precision and aid t... / ABSTRACT We use the formal language Z to specify and analyze the br Z is a formal language based on typed set theory and
XML Technology - Tutorial Toms Hruska (2001)(Correct)
This tutorial deals with the components of XML technology. It starts with the
markup languages history. Next part describes the XML as the modern language. In the
following parts, we will deal with th... / Formal languages Compilers nroff troff and
A Two-Variable Fragment of English - Pratt-Hartmann (2001)(Correct)
Controlled languages are regimented fragments of natural language
designed to make the processing of natural language more ecient and reliable. This
paper de nes a controlled language, E2V, whose prin... / between natural and formal languages. Keywords natural br between natural and formal languages. The plan of the paper is as
Probabilistic Approaches to Syntax - Manning (2001)(Correct)
killing interest in probabilistic methods for syntax, just as for a long time McCarthy
and Hayes (1969) discouraged exploration of probabilistic methods in Arti cial Intelligence. Among
his arguments... / understanding. Logics and formal languages have a language-like form br that Gold proved that formal languages even nite state ones are
Information Compression And Retention In Dynamical Processes - Petersen (2001)(Correct)
We discuss some recent work on various constructions that accumulate or remove information within dynamical systems: tail fields, numeration systems and formal languages (especially of -shifts), and f... / elds numeration systems and formal languages especially of shifts br Formal-language properties of the associated
Logics for Hybrid Systems - Davoren, Nerode (2000)(Correct)
Hybrid systems are heterogenous dynamical
systems characterized by interacting continuous and discrete
dynamics. Such mathematical models have proved fruitful
in a great diversity of engineering appli... / temporal logic automata formal languages software verification br characterized by an automaton formal language of finite or infinite words
Partial-Order Process Algebra (and its Relation to Petri Nets) - Baeten, Basten (2000)(Correct)
To date, many different formalisms exist for describing and analyzing the behavior of concurrent systems.
Petri nets and process algebras are two well-known classes of such formalisms. Petri-net theo... / computing science. Numerous formal languages for describing and analyzing br of expressions in such a formal language is often captured in a
Generation of LR Parsers by Partial Evaluation - Michael Sperber, Peter Thiemann (2000)(Correct)
this paper appeared in Proceedings of the ACM SIGPLAN Symposium
on Partial Evaluation and Semantics-Based Program Manipulation, 1995 under the title
"The Essence of LR Parsing."
Authors' addresses:
Mi... / F. . Mathematical Logic and Formal Languages Grammars and Other br compiler front ends and other formal language processors. LR parsing is
Profinite methods in semigroup theory - Weil (2000)(Correct)
this paper. The extended bibliography given below shows other important contributions by
Azevedo, Costa, Delgado, Pin, Teixeira, Volkov, Weil and Zeitoun. unknown Profinite methods
in semigroup theor... / connections with the theory of formal languages via Eilenberg's variety br due to the connections with formal language theory first established by
Logic Journal of the IGPL 8:3 - Areces, Franconi, Goré, de.. (2000)(Correct)
Description Logics (DLs) are a family of knowledge representation formalisms mainly characterised
by constructors to build complex concepts and roles from atomic ones. Expressive role constructors
are... / artificial intelligence formal languages etc. Going in the br and A. Salomaa. Handbook of Formal Languages. Springer . K.
Using modal logics for the formal analysis and synthesis of hybrid.. - Davoren (2000)(Correct)
The purpose of this paper is two-fold. We first give an overview of recent work
on the formal analysis and verification of hybrid systems, which are dynamical systems
with both discrete and continuo... / is no facility within their formal languages to talk about how a system br explicitly named in the formal language via labeled modal operators
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
Real-Time Computation: A Formal Definition and its Applications - Bruda, Akl (2000)(Correct)
There are few formal definitions of real-time problems, and the currently available definitions do not
capture all the relevant aspects of such computations. We propose a new definition, and we belie... / complexity theory formal languages timed languages br systems in New Trends in Formal Languages G. Paun and A. Salomaa
Languages of Dot-Depth 3/2 - Glaßer, Schmitz (2000)(Correct)
We prove an effective characterization of languages having dot-depth 3=2. To our knowledge,
only the classes of levels 0, 1=2 and 1 of the dot-depth hierarchy were known to be decidable. Let
B 3=2 de... / question in the Handbook of Formal Languages Pin b and in PW This br editors Handbook of formal languages volume I pages - .
Verification on Infinite Structures - Burkart, Caucal, Moller, Steffen (2000)(Correct)
In this chapter, we present a hierarchy of infinite-state systems
based on the primitive operations of sequential and parallel composition; the
hierarchy includes a variety of commonly-studied classes... / for finite-state automata formal language theorists have been studying br of generators for families of formal languages. In Milner
Logics with Counting and Local Properties - Libkin (2000)(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 Logic
Length Distributions And Regular Sequences - Bassino, Béal, Perrin (2000)(Correct)
This paper presents a survey on length distributions of regular languages.
The accent is on problems in coding theory and the relation with symbolic dynamics.
Key words. Regular sequences, nite au... / of a length distribution for a formal language is a simple one it is the br information concerning a formal language since it measures in a sense
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
The Challenge of Discovering Meta-Data - Morik, Haustein (2000)(Correct)
Introduction
Machine learning research has always been driven by
scenarios. The scenarios were put together from ideas
of anthropological disciplines (e.g., linguistics, cognitive
and social science,... / learning capabilities to formal languages the interactions to those br while restricting them to formal languages. The recognition of
Learning Elementary Formal Systems with Queries - Sakamoto, Hirata (2000)(Correct)
An elementary formal system (EFS , for short) is a kind of logic program which
directly manipulates character strings. A number of researches have investigated
the ability of EFS as an uniform frame... / employed EFS for studying formal languages and later Arikawa et al. br Elementary formal systems and formal languages -Simple formal systems
Using a Coordination Language to Specify and Analyze Systems.. - Ciancarini, Franzè, Mascolo (2000)(Correct)
Syntax.
in the rule (speci ed in the where clause). The Client space terminates as soon
as it receives the 10-th answer. The termination rule END checks if the Client
space contains the tuple (\idle"... / WORK PoliS is not the rst formal language used to study systems br based systems. In terms of formal languages process algebras have been
Learning regular languages from simple positive examples - Denis (2000)(Correct)
Learning from positive data constitutes an important topic in Grammatical
Inference since it is believed that the acquisition of grammar by children
only needs syntactically correct (i.e. positive) ... / one of the simplest class of formal languages the class REG of regular br Inductive inference of formal languages from positive data.
PC grammar systems with terminal transmission - Fernau (2000)(Correct)
We introduce a new variant of PC grammar systems, called PC grammar
systems with terminal transmission, PCGSTT for short, motivated
by questions concerning grammatical inference of such systems. We ... / centralized PCGSTT have nice formal language theoretic properties they br and data communication with formal language theoretic means. The aim and
Creating Semantic Representations of Diagrams - Minas (2000)(Correct)
Diagrams that serve as a visual input facility for programming
environments have to be translated into some kind of semantic
description. This paper describes such a method which is based on a
sp... / for visual programming are formal languages and are thus defined by
Learning the Dynamics of Embedded Clauses - Bodén, Blair (2000)(Correct)
Recent work by Siegelmann has shown that the computational power of
neural networks matches that of Turing Machines. Proofs are based on a
fractal encoding of states to simulate the memory and opera... / Previous work on learning formal languages requiring stacks e.g.
Constrained Rewrite Transition Systems - Strejcek (2000)(Correct)
We extend broadly studied rewrite transition systems with a mechanism
for computing with partial information in the form similar to
that one used in Concurrent Constraint Programming (CCP). Two
new... / well-studied classes of formal languages and transition system br in solving problems in classic formal language theory. Definition . . A
Efficient Verification Algorithms for One-Counter Processes - Kucera (2000)(Correct)
We study the problem of strong/weak bisimilarity between processes
of one-counter automata and finite-state processes. We show that
the problem of weak bisimilarity between processes of one-counter
... / have their origin in theory of formal languages HU but recently i.e.
A Unifying Semantics for Time and Events - Bennett, Galton (2000)(Correct)
We give a formal semantics for a highly expressive language for representing
temporal relationships and events. This language, which we
call Versatile Event Logic (VEL), provides a general temporal ... / Representations of time within formal languages can be readily divided into
A Formal View of Aspects in the Development of Component-based.. - Blair, Blair, Andersen, Jones (2000)(Correct)
In this paper, we present an aspect-oriented
specification technique that supports the specification of
component-based distributed systems. Importantly, this
technique also supports the synthesis of ... / solutions using appropriate formal languages. The subsequent synthesis br Blair c Different formal languages may if appropriate be
Automaticity And Rationality - Shallit (2000)(Correct)
Automaticity is a measure of descriptional complexity for formal languages L, and
measures how closely L can be approximated by regular languages. I survey some of
the known results and open problems ... / descriptional complexity for formal languages L and measures how br . Introduction Let L be a formal language that is a subset of Sigma
First-order expressivity for S5-models: modal vs. two-sorted languages - Sturm, Wolter (2000)(Correct)
this paper we are going to prove some
results on the expressive power of the standard first-order modal language by comparing it
with its extensional counterpart. We thereby restrict our attention to ... / a certain domain by using formal languages one often has to choose br set. Last but not least the formal language should offer a way to express
Characterizing and Deciding MSO-Definability of Macro Tree.. - Engelfriet, Maneth (2000)(Correct)
A macro tree transduction is MSO definable if and only if
it is of linear size increase. Furthermore, it is decidable for a macro tree
transduction whether or not it is MSO definable.
Classificatio... / Classification Automata and Formal Languages Introduction Macro br editors Handbook of Formal Languages. Vol. . Chap. .
Use Your Logic - Areces, FRANCONI, al. (2000)(Correct)
This paper views modal logics as languages that are especially tailored for describing
relational structures. After pointing out the connections between modal logics
and other elds, it describes a na... / cial intelligence GHR formal languages RS etc. Going in the br and A. Salomaa. Handbook of Formal Languages. Springer . Sch K.
Improving the Java Memory Model Using CRF - Maessen, Arvind, Shen (2000)(Correct)
This paper describes alternative memory semantics for Java programs
using an enriched version of the Commit/Reconcile/Fence
(CRF) memory model [16]. It outlines a set of reasonable practices
for safe ... / D. . Programming Languages Formal Definitions and Theory
Sets and Constraint Logic Programming - Dovier, Piazza, Pontelli, Rossi (2000)(Correct)
this paper we present a study of the problem of handling constraints made by conjunctions of
positive and negative literals based on the predicate symbols =;2; [, and jj (i.e., disjointness of
two set... / Math- ematical Logic and Formal Languages Mathematical Logic Logic
A Method for Incorporating Knowledge and Communication Into.. - Ricker, Rudie (2000)(Correct)
Using a formal method for reasoning about knowledge, decentralized discrete-event control
problems are described. States of the system where supervisors do not have sufficient knowledge
to make the co... / is based on the theory of formal languages In this context a br author. as a generator of a formal language. Decentralized supervisors
A Unifying Approach to HTML Wrapper Representation and Learning - Grieser, Jantke, Lange, Thomas (2000)(Correct)
The number, the size, and the dynamics of Internet information
sources bears abundant evidence of the need for automation in information
extraction. This calls for representation formalisms that m... / 'Inductive inference of formal languages from positive data' br AEFSs can be used to describe formal languages and relate the resulting
Stochastically Enhanced Timed Automata - Blair, Jones, Blair (2000)(Correct)
1. Introduction
In our previous work, we have been interested in the development of methodologies
and techniques for the specification and verification of distributed multimedia
systems, with particu... / considering the use of timed formal languages for the specification of br may be specified in different formal languages. A detailed description of
Metric-Based Analysis of Context-Free Grammars - Power, Malloy (2000)(Correct)
Recent advances in software engineering have produced
a variety of well established approaches, formalisms
and techniques to facilitate the construction
of large-scale applications. Developers interes... / grammars. When describing formal languages such as programming
TIC - A Toolkit for Validation in Formal Language Learning - Dötsch, Jantke (2000)(Correct)
Quite often, heuristics and common sense suggest
directions for improving well--known learning algorithms.
However it seems not an easy task to verify
that the modifications are indeed helpful.
Th... / -A Toolkit for Validation in Formal Language Learning Volker Dotsch br algorithms for learning formal languages. This is a well-examined and