this article presents an efficient, trainable system for sentence boundary disambiguation. The system, called Satz, makes simple estimates of the parts of speech of the tokens immediately preceding and following each punctuation mark, and uses these estimates as input to a machine learning algorithm that then classifies the punctuation mark. Satz is very fast both in training and sentence analysis, and its combined robustness and accuracy surpass existing techniques. The system needs only a small lexicon and training corpus, and has been shown to transfer quickly and easily from English to other languages, as demonstrated on French and German.

The realisation of domain-specific languages (DSL DSLs) differs in fundamental ways from that of traditional programming languages. We describe eight recurring patterns that we have identified as being used for DSL design and implementation. Existing languages can be extended, restricted, partially used, or become hosts for DSLs. DSL Simple DSLs DSL can be implemented by lexical processing. In addition, DSLs DSL can be used to create front-ends to existing systems or to express complicated data structures. Finally, DSLs DSL can be combined using process pipelines. The patterns described form a pattern language that can be used as a building block for a systematic

Abstract This paper introduces an automatic method for finding acronyms and their definitions in free text. The method is based on an inexact pattern matching algorithm applied to text surrounding the possible acronym. Evaluation shows both high recall and precision for a set of documents randomly selected from a larger set of full text documents. \Lambda

A formal approach for modeling and analyzing concurrent systems is proposed which integrates performance characteristics in the early stages of the design process. The approach relies on both stochastically timed process algebras and stochastically timed Petri nets in order to exploit their complementary advantages. The approach is instantiated to the case of EMPA (Extended Markovian Process Algebra), introduced together with the collection of its four semantics and the notion of equivalence that are required in order to implement the approach. Finally, the case study of the alternating bit protocol is presented to illustrate the adequacy of the approach. 1

We present TwoTowers, a tool for analyzing functional and performance properties of concurrent systems expressed as terms in the stochastically timed reward process algebra EMPA r . TwoTowers builds on two existing tools, CWBNC and MarCA, that have been retargeted to carry out functional and performance analysis (respectively) of EMPA r system specifications. As an example, we describe the application of TwoTowers to the Lehmann-Rabin randomized distributed algorithm for the dining philosopher problem. Keywords Software tools, process algebras, performance evaluation, Markov chains 1 INTRODUCTION The desirability of taking account of the performance aspects of a system in the early stages of its design has been widely recognized (Yemini et al. 1982, Ferrari 1986, Harvey 1986, Bochmann et al. 1988). Nevertheless, it often happens that a concurrent system is tested for efficiency only after it has been fully designed and tested for functionality. This results in two problems. On the ...

this paper, we define the characteristics of some integrated software development environments designed to take advantage of modern UNIX workstations. We describe the DEC FUSE product as an example of one of these environments and present two methods used to create theDEC FUSE product. With the first method, we show how tools are built as graphical user interfaces (GUIs) on top of existing

This paper is a report on a prototype implementation of Hybrid, a strongly-typed, concurrent, object-oriented language. The implementation we describe features a compile-time system for translating Hybrid object type definitions into C, a run-time system for supporting communication, concurrency and object persistence, and a type manager that mediates between the two.

Many program maintenance tools rely on traditional parsing techniques to obtain syntactic level models of the code being maintained. When, for some reason, code cannot be parsed, software maintainers are forced to fall back on ad hoc tools and techniques, such as grep. As an alternative, hierarchical lexical analysis augmented with simple data structures can be used to extract an approximation of the abstract syntax for a source file. Experiments indicate that such an approach is feasible and produces results comparable to those obtained using a parser.

OF THE THESIS Graphical User Interface for Compiler Optimizations with Simple-SUIF by Brian Keith Harvey Master of Science, Graduate Program in Computer Science University of California, Riverside, December, 1996 Professor Gary Tyson, Chairperson Very few tools exist which support the process of studying back end optimizations. Currently, researchers examining different back end optimizations must rely on general debugging tools or design their own tools to help in the generation of optimizing functions. A tool designed to give information specifically tailored for optimization designers is necessary. Such a tool would allow researchers to view the results of a newly designed optimization or analyze how the intermediate code of a program changes depending on the order in which transformations are applied. More efficient development of optimization routines should be the result of using this tool. This thesis presents the Visual Simple-SUIF Compiler (VSSC) package, designed to a...

Contents Chapter 1 Introduction............................................................................................................ 1 1.1 State-Transition Diagrams ....................................................................................................... 1 1.2 Statecharts ................................................................................................................................. 2 1.3 Concurrent, Hierarchical, Finite State Machines.................................................................... 3 1.4 Statechart Details ...................................................................................................................... 4 1.4.1 Additional Features ...................................................................................................... 4 1.4.1.1 Default States and History ............................................................................. 4 1.4.1.2 Conditions, Broadcastin