Sat, 05 Jul 2008 05:38:06 BST CiteULike: bfraser's library [386 articles] http://www.citeulike.org/user/bfraser CiteULike.org en-gb Copyright © 2004-2008 citeulike.org http://www.citeulike.org/user/bfraser/article/2965138 <i>IEEE Transactions on Software Engineering (2008)</i><br /><br />There is a growing consensus that crosscutting concerns harm code quality. An example of a crosscutting concern is a functional requirement whose implementation is distributed across multiple software modules. We asked the question, "How much does the amount that a concern is crosscutting affect the number of defects in a program?" We conducted three extensive case studies to help answer this question. All three studies revealed a moderate to strong statistically significant correlation between the degree of scattering and the number of defects. This paper describes the experimental framework we developed to conduct the studies, the metrics we adopted and developed to measure the degree of scattering, the studies we performed, the efforts we undertook to remove experimental and other biases, and the results we obtained. In the process, we have formulated a theory that explains why increased scattering might lead to increased defects. Do Crosscutting Concerns Cause Defects? Marc Eaddy Thomas Zimmermann Kaitlin Sherwood Vibhav Garg Gail Murphy Nachiappan Nagappan Alfred Aho IEEE Transactions on Software Engineering (2008) 2008-07-04T22:13:36-00:00 2008 IEEE Transactions on Software Engineering aosd concern defect http://www.citeulike.org/user/bfraser/article/2319580 <i>(July 2006), pp. 89-100.</i> Statement Annotations for Fine-Grained Advising Marc Eaddy Alfred Aho (July 2006), pp. 89-100. 2008-02-01T14:35:52-00:00 2006 89 100 aosd http://www.citeulike.org/user/bfraser/article/715399 <i>Lecture Notes in Computer Science, Vol. 3880 (February 2006), pp. 106-134.</i> Aspect Categories and Classes of Temporal Properties Shmuel Katz doi:10.1007/11687061_4 Lecture Notes in Computer Science, Vol. 3880 (February 2006), pp. 106-134. 2006-06-29T07:34:37-00:00 2006 Lecture Notes in Computer Science 3880 106 134 aosd journal verification http://www.citeulike.org/user/bfraser/article/2931388 <i>pp. 65-76.</i><br /><br />It is shown that the popular puzzle Sokoban can be used to emulate a linear bounded automata (finite tape Turing Machine (TM)). In particular, a construction is given that has a solution if and only if the corresponding Turing Machine on its input halts in the accept state. Further, if the TM halts and accepts, then the pusher will make Θ(n + t(n)) moves and pushes, where n is the number of symbols on the input tape, and t(n) is the number of transitions made by the TM during its... Sokoban is PSPACE-complete Joseph Culberson pp. 65-76. 2008-06-26T16:09:00-00:00 65 76 ai planning sokoban http://www.citeulike.org/user/bfraser/article/2931386 <i>Computers and Games (2003), pp. 360-375.</i><br /><br />Heuristic search has been successful for games like chess and checkers, but seems to be of limited value in games such as Go and shogi, and puzzles such as Sokoban. Other techniques are necessary to approach the performance that humans achieve in these hard domains. This paper explores using planning as an alternative problem-solving framework for Sokoban. Previous attempts to express Sokoban as a planning application led to poor performance results. Sokoban is introduced as a new planning formulation of the domain. The approach abstracts a Sokoban problem into rooms and tunnels. This allows for the decomposition of the hard initial problem into several simpler sub-problems, each of which can be solved efficiently. The experimental results show that the abstraction has the potential for an exponential reduction in the size of the search space explored. Using Abstraction for Planning in Sokoban Adi Botea Martin Müller Jonathan Schaeffer Computers and Games (2003), pp. 360-375. 2008-06-26T16:06:13-00:00 2003 Computers and Games 360 375 abstraction ai planning sokoban http://www.citeulike.org/user/bfraser/article/1207879 <i>: Advances in Exception Handling Techniques: (2001), 147.</i> Action-Oriented Exception Handling in Cooperative and Competitive Concurrent Object-Oriented Systems Alexander Romanovsky Jörg Kienzle : Advances in Exception Handling Techniques: (2001), 147. 2007-04-05T07:42:24-00:00 2001 : Advances in Exception Handling Techniques: 147 concurrency distributed exception_handling oop http://www.citeulike.org/user/bfraser/article/2880000 <i>FM 2008: Formal Methods (2008), pp. 1-11.</i><br /><br />Aspects are now commonly used to add functionality that otherwise would cut across the structure of object systems. In this survey, both directions in the connection between aspects and formal methods are examined. On the one hand, the use of aspects to facilitate (general) software verification, and especially model checking, is demonstrated. On the other hand, the new challenges to formal specification and verification posed by aspects are defined, and several existing solutions are described. Aspects and Formal Methods Shmuel Katz doi:10.1007/978-3-540-68237-0_1 FM 2008: Formal Methods (2008), pp. 1-11. 2008-06-10T15:26:08-00:00 2008 FM 2008: Formal Methods 1 11 aspect formalmethods http://www.citeulike.org/user/bfraser/article/2927528 <i>(2004)</i><br /><br />Aspects are intended to add needed functionality to a system or to treat concerns of the system by augmenting or changing the existing code in a manner that cross-cuts the usual class or process hierarchy. However, sometimes aspects can invalidate some of the already existing desirable properties of the system. This paper shows how to automatically identify such situations. The importance of specifications of the underlying system is emphasized, and shown to clarify the degree of obliviousness... Diagnosis of harmful aspects using regression verification S Katz (2004) 2008-06-25T21:42:51-00:00 2004 aosd aspect_interference http://www.citeulike.org/user/bfraser/article/2927505 <i>(2003)</i> Interference Analysis for AspectJ M Storzer J Krinke (2003) 2008-06-25T21:26:00-00:00 2003 aosd aspect_interference aspectj http://www.citeulike.org/user/bfraser/article/2927490 <i>Automated Software Engineering, 2006. ASE '06. 21st IEEE/ACM International Conference on (2006), pp. 313-316.</i><br /><br />The aspect-oriented paradigm allows weaving aspects in different join points of a program. Aspects can modify object fields and method control flow, thus possibly introducing subtle and undesired interactions (conflicts) among aspects and objects, which are not easily detectable. In this paper we propose a fully automated approach to discover conflicts among classes and aspects directly from Java bytecode. The novelty of this work is the usage of a rule engine for identifying possible conflicts among advices, methods, and fields. The knowledge base is obtained through static analysis of classes and aspects bytecode. The possible conflicts are represented by means of rules that can be easily extended and customized Automated Reasoning on Aspects Interactions Paolo Falcarin Marco Torchiano doi:10.1109/ASE.2006.19 Automated Software Engineering, 2006. ASE '06. 21st IEEE/ACM International Conference on (2006), pp. 313-316. 2008-06-25T21:12:08-00:00 2006 Automated Software Engineering, 2006. ASE '06. 21st IEEE/ACM International Conference on 313 316 aosd aspect_interference formalmethods http://www.citeulike.org/user/bfraser/article/2924312 <i>Trends in Ecology & Evolution, Vol. 17, No. 3. (1 March 2002), pp. 115-120.</i><br /><br />Nausea and vomiting are routine features of early pregnancy in humans. But are they adaptive or pathological? Several lines of evidence suggest that they protect mothers and developing embryos from dietary mutagens and pathogens. Nausea and vomiting in pregnancy (NVP) coincide with the vulnerable period of embryogenesis, are associated with food aversions, and are predictors of positive pregnancy outcomes. Here, I argue that NVP is not directly adaptive, but arises as a byproduct of genetic conflict between mother and embryo. The negative correlation between first-trimester spontaneous abortion and NVP is not the result of protection of embryos from environmental mutagens or pathogens, but the result of intrinsic chromosomal defects. These low-quality embryos produce subnormal levels of human chorionic gonadotropin, a hormone involved in pregnancy maintenance, and the probable proximate trigger for NVP. Pregnancy sickness and embryo quality Scott Forbes doi:10.1016/S0169-5347(01)02428-4 Trends in Ecology & Evolution, Vol. 17, No. 3. (1 March 2002), pp. 115-120. 2008-06-24T20:33:03-00:00 2002 Trends in Ecology & Evolution 17 3 115 120 pregancy http://www.citeulike.org/user/bfraser/article/2434829 <i>Theoretical Computer Science, Vol. 114, No. 1. (14 June 1993), pp. 149-171.</i><br /><br />In process algebras, bisimulation equivalence is typically defined directly in terms of the operational rules of action; it also has an alternative characterization in terms of a simple modal logic (sometimes called Hennessy-Milner logic). This paper first defines two forms of bisimulation equivalence for the [pi]-calculus, a process algebra which allows dynamic reconfiguration among processes; it then explores a family of possible logics, with different modal operators. It is proven that two of these logics characterize the two bisimulation equivalences. Also, the relative expressive power of all the logics is exhibited as a lattice. The results are applicable to most value-passing process algebras. Modal logics for mobile processes Robin Milner Joachim Parrow David Walker doi:10.1016/0304-3975(93)90156-N Theoretical Computer Science, Vol. 114, No. 1. (14 June 1993), pp. 149-171. 2008-02-27T07:52:21-00:00 1993 Theoretical Computer Science 114 1 149 171 logic modal pi-calculus process_algebra http://www.citeulike.org/user/bfraser/article/309400 <i>Vol. 36, No. 10. (October 2001), pp. 241-252.</i> Extensible algebraic datatypes with defaults Matthias Zenger Martin Odersky doi:10.1145/507635.507665 Vol. 36, No. 10. (October 2001), pp. 241-252. 2005-08-31T19:36:04-00:00 2001 0362-1340 36 10 241 252 ACM Press adt oop http://www.citeulike.org/user/bfraser/article/1842741 <i>The Journal of Logic Programming, Vol. 37, No. 1-3. (12 October 1998), pp. 95-138.</i><br /><br />Constraint Handling Rules (CHR) are our proposal to allow more flexibility and application-oriented customization of constraint systems. CHR are a declarative language extension especially designed for writing user-defined constraints. CHR are essentially a committed-choice language consisting of multi-headed guarded rules that rewrite constraints into simpler ones until they are solved. In this broad survey we aim at covering all aspects of CHR as they currently present themselves. Going from theory to practice, we will define syntax and semantics for CHR, introduce an important decidable property, confluence, of CHR programs and define a tight integration of CHR with constraint logic programming languages. This survey then describes implementations of the language before we review several constraint solvers - both traditional and nonstandard ones - written in the CHR language. Finally we introduce two innovative applications that benefited from using CHR. Theory and practice of constraint handling rules Thom Fruhwirth doi:10.1016/S0743-1066(98)10005-5 The Journal of Logic Programming, Vol. 37, No. 1-3. (12 October 1998), pp. 95-138. 2007-10-30T16:41:36-00:00 1998 The Journal of Logic Programming 37 1-3 95 138 constraint http://www.citeulike.org/user/bfraser/article/2919745 <i>(2004)</i><br /><br />In this paper, we show that the basic pointcut languages offered by current aspect-oriented programming languages impact important software engineering properties, such as evolvability and comprehensibility, in a negative way. We discuss this impact by means of detailed examples, and propose an advanced pointcut managing environment, based on machine learning techniques, to overcome the problem. 1 Problem Statement An important part of an aspect's definition consists of the specification of... Inductively generated pointcuts to support refactoring to aspects T Tourwe A Kellens W Vanderperren F Vannieuwenhuyse (2004) 2008-06-23T20:49:57-00:00 2004 aosd machine_learning http://www.citeulike.org/user/bfraser/article/2906268 <i>(1992), pp. 359-363.</i> Planning as satisfiability Henry Kautz Bart Selman (1992), pp. 359-363. 2008-06-18T21:52:31-00:00 1992 359 363 John Wiley & Sons, Inc. planning sat sat_encoding http://www.citeulike.org/user/bfraser/article/163708 <i>Commun. ACM, Vol. 12, No. 10. (October 1969), pp. 576-580.</i> An axiomatic basis for computer programming CAR Hoare doi:10.1145/363235.363259 Commun. ACM, Vol. 12, No. 10. (October 1969), pp. 576-580. 2005-04-19T01:26:16-00:00 1969 Commun. ACM 0001-0782 12 10 576 580 ACM Press classic http://www.citeulike.org/user/bfraser/article/2604156 <i>Computer Languages, Systems & Structures, Vol. 30, No. 1-2. ( 2004), pp. 21-33.</i><br /><br />This paper shows that one can reason at a meta level about the structure of object-oriented source code in a language-independent way. To achieve this, we propose a language-independent meta-level interface to extract complex information about the structure of the source code. This approach is validated by defining a set of logic queries to detect object-oriented best practice patterns and design patterns in two different languages: Smalltalk and Java. The queries were applied to two similar medium-sized applications available for each language, and the results were confirmed by manually investigating the source code and available documentation. Language-independent detection of object-oriented design patterns Johan Fabry Tom Mens doi:10.1016/j.cl.2003.09.002 Computer Languages, Systems & Structures, Vol. 30, No. 1-2. ( 2004), pp. 21-33. 2008-03-27T23:00:02-00:00 2004 Computer Languages, Systems & Structures 30 1-2 21 33 aosd design patterns http://www.citeulike.org/user/bfraser/article/2899206 <i>(2007)</i> ReLAx: implementing KALA over the reflex AOP kernel Johan Fabry éric Tanter Theo D'Hondt doi:10.1145/1255400.1255403 (2007) 2008-06-16T17:44:23-00:00 2007 ACM aop aosd http://www.citeulike.org/user/bfraser/article/2899195 <i>Science of Computer Programming, Vol. 71, No. 3. (1 May 2008), pp. 165-180.</i><br /><br />Transaction management is a known crosscutting concern. Previous research has been conducted to express this concern as an aspect. However, such work has used general-purpose aspect languages which lack a formal foundation, and most importantly are unable to express advanced models of transaction management. In this paper, we propose a domain-specific aspect language for advanced transaction management, called KALA, that overcomes these limitations. First, KALA is based on a recognized formalism for the domain of advanced transaction management, called ACTA. Second, as a consequence of being based on the ACTA formalism, KALA covers a wide variety of models for transaction management. Finally, being a domain-specific aspect language, KALA allows programmers to express their needs at a higher level of abstraction than what is achieved with general-purpose aspect languages. This paper reports on the design of KALA and its implementation over Java, based on the Reflex AOP kernel for domain-specific aspect languages. KALA: Kernel aspect language for advanced transactions Johan Fabry Éric Tanter Theo D'Hondt doi:10.1016/j.scico.2007.10.004 Science of Computer Programming, Vol. 71, No. 3. (1 May 2008), pp. 165-180. 2008-06-16T17:38:53-00:00 2008 Science of Computer Programming 71 3 165 180 aosd transaction http://www.citeulike.org/user/bfraser/article/2883480 <i>Theoretical Computer Science, Vol. 183, No. 2. (15 September 1997), pp. 215-228.</i><br /><br />We present general results for showing process equivalences applied to the finite control fragment of the [pi]-calculus decidable. Firstly, a Finite Reachability Theorem states that up to finite name spaces and up to a static normalisation procedure, the set of reachable agent expressions is finite. Secondly, a Boundedness Lemma shows that no potential computations are missed when name spaces are chosen large enough, but finite. We show how these results lead to decidability for a number of [pi]-calculus equivalences such as strong or weak, late or early bismulation equivalence. Furthermore, for strong late equivalence we show how our techniques can be used to adapt the well-known Paige-Tarjan algorithm. Strikingly, this results in a single exponential running time not much worse than the running time for the case of for instance CCS. Our results considerably strengthens previous results on decidable equivalences for parameter-passing process calculi. On the decidability of process equivalences for the [pi]-calculus Mads Dam doi:10.1016/S0304-3975(96)00325-8 Theoretical Computer Science, Vol. 183, No. 2. (15 September 1997), pp. 215-228. 2008-06-11T17:39:54-00:00 1997 Theoretical Computer Science 183 2 215 228 decidability pi-calculus verification http://www.citeulike.org/user/bfraser/article/2883473 <i>(2003), pp. 145-212.</i> Proof systems for pi-calculus logics Mads Dam (2003), pp. 145-212. 2008-06-11T17:34:24-00:00 2003 145 212 Kluwer Academic Publishers pi-calculus http://www.citeulike.org/user/bfraser/article/2883471 <i>Inf. Comput., Vol. 129, No. 1. (August 1996), pp. 35-51.</i> Model checking mobile processes Mads Dam Inf. Comput., Vol. 129, No. 1. (August 1996), pp. 35-51. 2008-06-11T17:33:35-00:00 1996 Inf. Comput. 0890-5401 129 1 35 51 Academic Press, Inc. model_checking pi-calculus http://www.citeulike.org/user/bfraser/article/1806485 <i>ACM Trans. Program. Lang. Syst., Vol. 21, No. 5. (September 1999), pp. 914-947.</i> Linearity and the pi-calculus Naoki Kobayashi Benjamin Pierce David Turner doi:10.1145/330249.330251 ACM Trans. Program. Lang. Syst., Vol. 21, No. 5. (September 1999), pp. 914-947. 2007-10-22T13:47:13-00:00 1999 ACM Trans. Program. Lang. Syst. 0164-0925 21 5 914 947 ACM Press linear_logic pi-calculus http://www.citeulike.org/user/bfraser/article/959328 <i>(1990), pp. 81-94.</i> The chemical abstract machine Gerard Berry Gerard Boudol doi:10.1145/96709.96717 (1990), pp. 81-94. 2006-11-23T10:58:38-00:00 1990 81 94 ACM Press abstraction concurrency theory http://www.citeulike.org/user/bfraser/article/2842778 <i>(2004)</i> Load Balancing of Autonomous Actors over Dynamic Networks Travis Desell Kaoutar Maghraoui Carlos Varela (2004) 2008-05-28T20:55:02-00:00 2004 IEEE Computer Society actor distributed http://www.citeulike.org/user/bfraser/article/2842772 <i>Parallel Processing and Applied Mathematics (2004), pp. 1083-1090.</i><br /><br />Over the last two decades, efficient message passing libraries have been developed for parallel scientific computation. Concurrently, programming languages have been created supporting dynamically reconfigurable distributed systems over the heterogeneous Internet. In this paper, we introduce SALSA-MPI, an actor programming language approach to scientific computing that extends MPI with a checkpointing and migration API and a runtime system that manages both periodic checkpoints and process or application migration. The goal is to enable dynamic network reconfiguration and load balancing without sacrificing application performance or requiring extensive code modifications. As driving technology for this effort of unifying parallel and distributed computing, we plan to use adaptive solvers of partial differential equations. Fields as diverse as fluid dynamics, material science, biomechanics, and ecology make use of parallel adaptive computation, but target architectures have traditionally been supercomputers and tightly-coupled clusters. SALSA-MPI is intended to allow these computations to make efficient use of more distributed and dynamic computing resources. Adaptive Computation over Dynamic and Heterogeneous Networks Kaoutar Maghraoui Joseph Flaherty Boleslaw Szymanski James Teresco Carlos Varela Parallel Processing and Applied Mathematics (2004), pp. 1083-1090. 2008-05-28T20:52:35-00:00 2004 Parallel Processing and Applied Mathematics 1083 1090 distributed http://www.citeulike.org/user/bfraser/article/3530 <i>(1988), pp. 47-57.</i> Polymorphic effect systems JM Lucassen DK Gifford doi:10.1145/73560.73564 (1988), pp. 47-57. 2004-12-13T16:40:33-00:00 1988 47 57 ACM Press polymorphism type_theory http://www.citeulike.org/user/bfraser/article/1093247 <i>Distributed Computing Systems, 1998. Proceedings. 18th International Conference on (1998), pp. 12-21.</i><br /><br />Exception handling in concurrent and distributed programs is a difficult task though it is often necessary. In many cases traditional exception mechanisms for sequential programs are no longer appropriate. One major difficulty is that the process of handling an exception may need to involve multiple concurrent components that are cooperating in pursuit of some global goal. Another complication is that several exceptions may be raised concurrently in different nodes of a distributed environment. Existing proposals and actual concurrent languages either ignore these difficulties or only cope with a limited form of them. The paper attempts a general solution, developed especially for distributed object systems, starting from a conceptual model, together with algorithms for coordinating concurrent components and resolving multiple exceptions, through to an actual system implementation. An industrial production cell is chosen as a case study to demonstrate the usefulness of the proposed model and algorithms. A system that supports coordinated atomic actions and exception resolution is implemented in distributed Ada 95 and examined through several performance-related experiments Coordinated exception handling in distributed object systems: from model to system implementation J Xu A Romanovsky B Randell doi:10.1109/ICDCS.1998.679465 Distributed Computing Systems, 1998. Proceedings. 18th International Conference on (1998), pp. 12-21. 2007-02-07T18:55:14-00:00 1998 Distributed Computing Systems, 1998. Proceedings. 18th International Conference on 12 21 distributed exception_handling http://www.citeulike.org/user/bfraser/article/1093245 <i>IEEE Trans. Softw. Eng., Vol. 12, No. 8. (August 1986), pp. 811-826.</i> Error recovery in asynchronous systems Roy Campbell Brian Randell IEEE Trans. Softw. Eng., Vol. 12, No. 8. (August 1986), pp. 811-826. 2007-02-07T18:53:29-00:00 1986 IEEE Trans. Softw. Eng. 0098-5589 12 8 811 826 IEEE Press distributed exception_handling http://www.citeulike.org/user/bfraser/article/2739242 <i>Software Process Technology (1996), pp. 108-124.</i><br /><br />Data obtained during a 1968 study of the software process [8] led to an investigation of the evolution of OS/360 [13] and and, over a period of twenty years, to formulation of eight Laws of Software Evolution. The FEAST project recently initiated (see sections 4–6 below) is expected to throw additional light on the phenomenology underlying these laws, to increase understanding of them, to explore their finer detail, to expose their wider relevance and implications and to develop means for their beneficial exploitation. This paper is intended to trigger wider interest in the laws and in the FEAST study of feedback and feedback control in the context of the software process and its improvement to ensure beneficial exploitation of their potential. Laws of software evolution revisited M Lehman doi:10.1007/BFb0017737 Software Process Technology (1996), pp. 108-124. 2008-04-30T17:16:49-00:00 1996 Software Process Technology 108 124 engineering software_evolution http://www.citeulike.org/user/bfraser/article/2739216 <i>Proceedings of the IEEE, Vol. 68, No. 9. (1980), pp. 1060-1076.</i><br /><br />By classifying programs according to their relationship to the environment in which they are executed, the paper identifies the sources of evolutionary pressure on computer applications and programs and shows why this results in a process of never ending maintenance activity. The resultant life cycle processes are then briefly discussed. The paper then introduces laws of Program Evolution that have been formulated following quantitative studies of the evolution of a number of different systems. Finally an example is provided of the application of Evolution Dynamics models to program release planning. Programs, life cycles, and laws of software evolution MM Lehman Proceedings of the IEEE, Vol. 68, No. 9. (1980), pp. 1060-1076. 2008-04-30T17:07:54-00:00 1980 Proceedings of the IEEE 68 9 1060 1076 engineering programming software software_evolution http://www.citeulike.org/user/bfraser/article/1301354 <i>J. Funct. Program., Vol. 15, No. 4. (July 2005), pp. 503-542.</i> Embedded interpreters Nick Benton doi:10.1017/S0956796804005398 J. Funct. Program., Vol. 15, No. 4. (July 2005), pp. 503-542. 2007-05-17T06:28:54-00:00 2005 J. Funct. Program. 0956-7968 15 4 503 542 Cambridge University Press embedded_languages fp http://www.citeulike.org/user/bfraser/article/478829 <i>ACM Comput. Surv., Vol. 35, No. 2. (June 2003), pp. 114-131.</i> The many faces of publish/subscribe Patrick Pascal Felber Rachid Guerraoui Anne-Marie Kermarrec doi:10.1145/857076.857078 ACM Comput. Surv., Vol. 35, No. 2. (June 2003), pp. 114-131. 2006-01-24T16:18:59-00:00 2003 ACM Comput. Surv. 0360-0300 35 2 114 131 ACM Press architecture software http://www.citeulike.org/user/bfraser/article/149347 <i>ACM Trans. Inter. Tech., Vol. 2, No. 2. (May 2002), pp. 115-150.</i><br /><br />The World Wide Web has succeeded in large part because its software architecture has been designed to meet the needs of an Internet-scale distributed hypermedia application. The modern Web architecture emphasizes scalability of component interactions, generality of interfaces, independent deployment of components, and intermediary components to reduce interaction latency, enforce security, and encapsulate legacy systems. In this article we introduce the Representational State Transfer (REST) architectural style, developed as an abstract model of the Web architecture and used to guide our redesign and definition of the Hypertext Transfer Protocol and Uniform Resource Identifiers. We describe the software engineering principles guiding REST and the interaction constraints chosen to retain those principles, contrasting them to the constraints of other architectural styles. We then compare the abstract model to the currently deployed Web architecture in order to elicit mismatches between the existing protocols and the applications they are intended to support. Principled design of the modern Web architecture Roy Fielding Richard Taylor doi:10.1145/514183.514185 ACM Trans. Inter. Tech., Vol. 2, No. 2. (May 2002), pp. 115-150. 2005-04-04T18:05:20-00:00 2002 ACM Trans. Inter. Tech. 1533-5399 2 2 115 150 ACM Press architecture rest web http://www.citeulike.org/user/bfraser/article/1351871 <i>Software Engineering, 1998. Proceedings of the 1998 (20th) International Conference on (1998), pp. 177-186.</i><br /><br />Continuous availability is a critical requirement for an important class of software systems. For these systems, runtime system evolution can mitigate the costs and risks associated with shutting down and restarting the system for an update. We present an architecture-based approach to runtime software evolution and highlight the role of software connectors in supporting runtime change. An initial implementation of a tool suite for supporting the runtime modification of software architectures, called ArchStudio, is presented Architecture-based runtime software evolution P Oreizy N Medvidovic RN Taylor doi:10.1109/ICSE.1998.671114 Software Engineering, 1998. Proceedings of the 1998 (20th) International Conference on (1998), pp. 177-186. 2007-05-31T15:27:55-00:00 1998 Software Engineering, 1998. Proceedings of the 1998 (20th) International Conference on 177 186 architecture runtime software_evolution http://www.citeulike.org/user/bfraser/article/2731174 <i>ACM Trans. Softw. Eng. Methodol., Vol. 1, No. 3. (July 1992), pp. 229-268.</i> Reconciling environment integration and software evolution Kevin Sullivan David Notkin doi:10.1145/131736.131744 ACM Trans. Softw. Eng. Methodol., Vol. 1, No. 3. (July 1992), pp. 229-268. 2008-04-28T22:25:32-00:00 1992 ACM Trans. Softw. Eng. Methodol. 1 3 229 268 ACM engineering integration software software_evolution http://www.citeulike.org/user/bfraser/article/1379615 <i>(2005), pp. 59-68.</i> Classpects: unifying aspect- and object-oriented language design Hridesh Rajan Kevin Sullivan doi:10.1145/1062455.1062483 (2005), pp. 59-68. 2007-06-12T02:29:51-00:00 2005 59 68 ACM Press aosd oop http://www.citeulike.org/user/bfraser/article/778826 <i>(1995), pp. 49-61.</i> Precise interprocedural dataflow analysis via graph reachability Thomas Reps Susan Horwitz Mooly Sagiv doi:10.1145/199448.199462 (1995), pp. 49-61. 2006-07-28T20:45:15-00:00 1995 49 61 ACM Press graph ifds program_analysis http://www.citeulike.org/user/bfraser/article/261736 <i>(15 March 2000)</i><br /><br />We live in a dynamic economic and commerical world, surrounded by objects of remarkable complexity and power. In many industries, changes in products and technologies have brought with them new kinds of firms and forms of organization. We are discovering news ways of structuring work, of bringing buyers and sellers together, and of creating and using market information. Although our fast-moving economy often seems to be outside of our influence or control, human beings create the things that create the market forces. Devices, software programs, production processes, contracts, firms, and markets are all the fruit of purposeful action: they are designed.<br /> <br /> Using the computer industry as an example, Carliss Y. Baldwin and Kim B. Clark develop a powerful theory of design and industrial evolution. They argue that the industry has experienced previously unimaginable levels of innovation and growth because it embraced the concept of <i>modularity</i>, building complex products from smaller subsystems that can be designed independently yet function together as a whole. Modularity freed designers to experiment with different approaches, as long as they obeyed the established <i>design rules</i>. Drawing upon the literatures of industrial organization, real options, and computer architecture, the authors provide insight into the forces of change that drive today's economy. Design Rules, Vol. 1: The Power of Modularity Carliss Baldwin Kim Clark (15 March 2000) 2005-07-21T16:21:36-00:00 2000 The MIT Press architecture design modularity http://www.citeulike.org/user/bfraser/article/2719471 <i>(2005), pp. 15-26.</i> An analysis of modularity in aspect oriented design Cristina Lopes Sushil Bajracharya doi:10.1145/1052898.1052900 (2005), pp. 15-26. 2008-04-25T21:02:34-00:00 2005 15 26 ACM aosd aspect modularity http://www.citeulike.org/user/bfraser/article/2719469 <i></i> Inversion of Control Containers and the Dependency Injection pattern Martin Fowler 2008-04-25T21:01:09-00:00 architecture dependency_injection design spring http://www.citeulike.org/user/bfraser/article/2697657 <i>(1999), pp. 122-131.</i> PuLSE: a methodology to develop software product lines Joachim Bayer Oliver Flege Peter Knauber Roland Laqua Dirk Muthig Klaus Schmid Tanya Widen Jean-Marc Debaud doi:10.1145/303008.303063 (1999), pp. 122-131. 2008-04-21T18:21:53-00:00 1999 122 131 ACM design engineering pulse software software_product_line spl http://www.citeulike.org/user/bfraser/article/115158 <i>(15 January 1995)</i><br /><br /><I>Design Patterns</I> is a modern classic in the literature of object-oriented development, offering timeless and elegant solutions to common problems in software design. It describes patterns for managing object creation, composing objects into larger structures, and coordinating control flow between objects. The book provides numerous examples where using composition rather than inheritance can improve the reusability and flexibility of code. Note, though, that it's not a tutorial but a catalog that you can use to find an object-oriented design pattern that's appropriate for the needs of your particular application--a selection for virtuoso programmers who appreciate (or require) consistent, well-engineered object-oriented designs. Now on CD, this internationally acclaimed bestseller is more valuable than ever! <P> Use the contents of the CD to create your own design documents and reusable components. The CD contains: 23 patterns you can cut and paste into your own design documents; sample code demonstrating pattern implementation; complete Design Patterns content in standard HTML format, with numerous hyperlinked cross-references; accessed through a standard web browser; Java-based dynamic search mechanism, enhancing online seach capabilities; graphical user environment, allowing ease of navigation. <P> First published in 1995, this landmark work on object-oriented software design presents a catalog of simple and succinct solutions to common design problems. Created by four experienced designers, the 23 patterns contained herein have become an essential resource for anyone developing reusable object-oriented software. In response to reader demand, the complete text and pattern catalog are now available on CD-ROM. This electronic version of <i>Design Patterns</i> enables programmers to install the book directly onto a computer or network for use as an online reference for creating reusable object-oriented software. <P> The authors first describe what patterns are and how they can help you in the design process. They then systematically name, explain, evaluate, and catalog recurring designs in object-oriented systems. All patterns are compiled from real-world examples and include code that demonstrates how they may be implemented in object-oriented programming languages such as C++ and Smalltalk. Readers who already own the book will want the CD to take advantage of its dynamic search mechanism and ready-to-install patterns. Design Patterns Erich Gamma Richard Helm Ralph Johnson John Vlissides (15 January 1995) 2005-03-06T00:47:55-00:00 1995 Addison-Wesley Professional classic design patterns http://www.citeulike.org/user/bfraser/article/2670388 <i>(2008)</i> A Domain-Specific Language for Parallel and Grid Computing Joao Sobral Miguel Monteiro (2008) 2008-04-14T20:30:20-00:00 2008 aosd dsl parallel http://www.citeulike.org/user/bfraser/article/1888932 <i>(2006), pp. 134-145.</i> Reusable aspect-oriented implementations of concurrency patterns and mechanisms Carlos Cunha Ao Jo\ Miguel Monteiro doi:10.1145/1119655.1119674 (2006), pp. 134-145. 2007-11-09T10:18:09-00:00 2006 134 145 ACM aosd aspect aspectj concurrency reuse http://www.citeulike.org/user/bfraser/article/777709 <i>Communications Magazine, IEEE, Vol. 35, No. 2. (1997), pp. 46-55.</i><br /><br />Large computer networks such as corporate intranets and the Internet are inherently heterogeneous due to such factors as increasingly rapid technological change, engineering trade-offs, accumulation of legacy systems over time, and varying system costs. Unfortunately, such heterogeneity makes the development and maintenance of applications that make the best use of such networks difficult. The Common Object Request Broker Architecture specification created by the Object Management Group provides a stable model for distributed object-oriented systems that helps developers cope with heterogeneity and inevitable change. Applications written to the CORBA standard are abstracted away from underlying networking protocols and transports, instead relying on object request brokers to provide a fast and flexible communication and object activation substrated. The abstractions provided by CORBA ORBs are currently serving as the basis for applications in a wide variety of problem domains, including telecommunications, finance, medicine, and manufacturing, running on platforms ranging from mainframes down to test and measurement equipment. This article first provides an overview of the Object Management Architecture, then describes in detail the CORBA component of that architecture, and concludes with a description of the OMG organization along with some of its current and future work CORBA: integrating diverse applications within distributed heterogeneous environments S Vinoski doi:10.1109/35.565655 Communications Magazine, IEEE, Vol. 35, No. 2. (1997), pp. 46-55. 2006-07-28T10:31:24-00:00 1997 Communications Magazine, IEEE 35 2 46 55 corba distributed http://www.citeulike.org/user/bfraser/article/350136 <i>(02 August 2005)</i> Service-Oriented Architecture : Concepts, Technology, and Design Thomas Erl (02 August 2005) 2005-10-14T01:27:46-00:00 2005 Prentice Hall PTR architecture distributed soa http://www.citeulike.org/user/bfraser/article/2651094 <i>(2005)</i> Spring in Action Craig Walls Ryan Breidenbach (2005) 2008-04-10T22:01:24-00:00 2005 Manning aosd middleware spring http://www.citeulike.org/user/bfraser/article/2651076 <i>Middleware 2003 (2003), pp. 997-997.</i><br /><br />JBoss is an extensible, reflective, and dynamically reconfigurable Java application server. It includes a set of components that implement the J2EE specification, but its scope goes well beyond J2EE. JBoss is open-ended middleware, in the sense that users can extend middleware services by dynamically deploying new components into a running server. We believe that no other application server currently o.ers such a degree of extensibility. This paper focuses on two major architectural parts of JBoss: its middleware component model, based on the JMX model, and its meta-level architecture for generalized EJBs. The former requires a novel class loading model, which JBoss implements. The latter includes a powerful and flexible remote method invocation model, based on dynamic proxies, and relies on systematic usage of interceptors as aspect-oriented programming artifacts. The JBoss Extensible Server Marc Fleury Francisco Reverbel doi:10.1007/3-540-44892-6_18 Middleware 2003 (2003), pp. 997-997. 2008-04-10T21:50:41-00:00 2003 Middleware 2003 997 997 aosd java jboss middleware