Unanticipated Software EvolutionIn building a computer system, it is possible to anticipate some ways in which the system's requirements might evolve, leaving hooks and other build-in variation points in the design and implementation to accommodate such possible changes.However, predicting the future is notoriously difficult.Most of the expense and technical complications of software evolution comes from changes not anticipated in the original design.Does this mean that system developers are defenseless in the face of unanticipated changes?Not completely.There are a set of emerging technologies that recognize the inevitability of unanticipated changes in software systems and work to accommodate such changes.This special issue is dedicated to the emerging topic of Unanticipated Software Evolution (USE), exploring mechanisms to adapt to unanticipated needs in software systems.Clever techniques in areas such as software development processes, programming languages and environments and run-time infrastructures can ease the task of evolving a software system in ways not thought about by its original creators.Without USE technology, unanticipated changes often force software engineers to do what they do now: perform extensive and expensive invasive modification of existing designs and code.USE technology offers the promise of being able to do more automatically, often dynamically and with greater certainty of success.This issue contains three of the best papers of the 2002 and 2003 Workshops on Unanticipated Software Evolution (http://joint.iai.uni-bonn.de/use).The first paper, 'Towards a taxonomy of software change' by Buckley et al. is a new look at how software systems might be evolved.It proposes a taxonomy of software change based on characterizing the mechanisms of change and the factors that influence these mechanisms.It provides a framework for comparing existing evolution approaches, evaluating the relevant tools, methods and formalisms for a particular change scenario and identifying topics for future research.Software evolution is about changing something and often the most convenient quantum of change is some sort of programming module.Our second paper, 'KERIS: evolving software with extensible modules', by Zenger, presents an extension to Java focused on hierarchically composed, extensible modules.Modules are a 'coarse grain' of change.A key idea of KERIS is that rather than having the programmer explicitly detail the module linking, module interaction paths are automatically inferred.KERIS allows extensions of already linked systems by replacing selected submodules with compatible

We present an algorithm for eliminating GOTOs and replacing them with structured IF-THEN-ELSE and loop constructs. Previous approaches have treated GOTO removal as an isolated problem for programming languages. In this paper, we describe a way of reducing GOTO removal to the well-understood problem of converting a finite-state transition network to a regular expression. A semantics is provided showing how the regular expression form may be interpreted as a non-deterministic program. A set of pattern-based reduction rules is used to transform the regular expression form back to a conventional structured program. Besides achieving greater conceptual unity, the method leads to a simpler algorithm where the task of recognizing loop boundaries is separated from that of identifying loop exits. We have successfully applied the algorithm in systems for re-engineering COBOL/IMS database systems and assembly language code. © 1997 by John Wiley & Sons, Ltd. J. Software Maintenance 9: 47–66, 1997

MultiLex is a lexer generator designed to facilitate creation of lexical analyzers, particularly lexical analyzers for LALR(1) parsers of legacy languages. Innovative features of MultiLex include its pipeline architecture, lexical pattern-matching over a larger space of objects than just characters, reconfigurability for languages that include sub-languages, and lexically-scoped dictionary mechanism. We discuss the place of lexers in re-engineering of legacy languages, the features of MultiLex, and compare it to prior work on lexers. © 1997 by John Wiley & Sons, Ltd.

Article SafeBots: a paradigm for software security controls Share on Authors: Robert Filman Software Technology Center, Lockheed Martin Missiles and Space, 3251 Hanover Street, O/H1-41 B/255, Palo Alto, California Software Technology Center, Lockheed Martin Missiles and Space, 3251 Hanover Street, O/H1-41 B/255, Palo Alto, CaliforniaView Profile , Ted Linden Software Technology Center, Lockheed Martin Missiles and Space, 3251 Hanover Street, O/H1-41 B/255, Palo Alto, California Software Technology Center, Lockheed Martin Missiles and Space, 3251 Hanover Street, O/H1-41 B/255, Palo Alto, CaliforniaView Profile Authors Info & Claims NSPW '96: Proceedings of the 1996 workshop on New security paradigmsSeptember 1996 Pages 45–51https://doi.org/10.1145/304851.304863Online:17 September 1996Publication History 7citation419DownloadsMetricsTotal Citations7Total Downloads419Last 12 Months1Last 6 weeks0 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access

I present the results of an experiment in retrofitting objects into an existing system. I describe a technology, based on automatic redefinition of existing functions, that allowed alternative implementations of the fundamental data types of the KEE™ knowledge-based system building tool. This technology is applicable in environments where the system's procedures can be subject to programmatic manipulation. It allows the retrofitting of objects into the implementations of other existing systems. The experience of retrofitting objects into KEE provides insight into the issues of the interaction of semantic classes and data representation and granularity in object-based systems.1