William G. Griswold
- Boehm88.B. W. Boehm. A spiral model of software development and enhancement. Cornpurer, 21(5):61-72, May 1988. Google Scholar
Digital Library
- Bowdidge & Griswold 94.R. W. Bowdidge and W. G. Griswold. Automated support for encapsulating abstract datatypes. ln ACM SIGSOFT '94 Symposium on the Foundations of SofMnre Engineering. pages 97-110, December 1994. Google ScholarDigital Library
- Bowdidge & Griswold 96.R. W. Bowdidge and W. G. Griswold. How software tools organize programmer behavior during tbe task of data encapsulation. Technical Report CS95-443, University of California, San Diego, Department of Computer Science and Engineering, August 1995 (revised February 1996).Google Scholar
- Bowdidge 95.R. W. Bowdidge. Supporfiig ihe ReskucturingofData Absrractions through Manipulation of a Program Viualiultion. PbD dissertation, University of California, San Diego, Department of Computer Science & Engineering, November 1995. Technical Report (X95-457. Google ScholarDigital Library
- Chow & Notkin 96.K. Chow and D. Notkia. Semi-automatic update of applications in response to library changes. Teclmical Report UW- CSE 96-03-01, Department of Computer Science and Engineering, University of Washington, 1996. To appearin ICSM '96. Google ScholarDigital Library
- Cusumano & Selby 95.M. A. Cusumano and R. W. Selby. Microsoji Secrets: How the World's Most Powerful Sojiware Company Creates Technology, .Shnpes Markets, and Manages People. Free Press, New York, 1995. Google ScholarDigital Library
- DeMarco 95.T. DeMarco. On systems architecture. In Proceedingsof ihe 1995 Monterey Workshop on Increasing the Practicallmpacr of Formal Merho& for Computer-Aided Sofhare Developmenr: Specifcadon- Based Sofiware Architectures. 1995.Google Scholar
- Griswold & Notkin 93.W. G. Griswold and D. Notkin. Automated assistance for program restructuring. ACM Transactions on Sojiware Engineering and Merhodology, 2(3):228-269. July 1993. Google ScholarDigital Library
- Griswold & Notkin 95.W. G. Griswold and D. Notkio. Architectural tradeoffs for a meaning-preserving program restructuring tool. IEEE Transactions on Sofiware Engineering, 21(4):275-287.1995. Google ScholarDigital Library
- Griswold 91.W. G. driswold. &graResrructuring as an Aid io Sofiware Maintenance. PhD dissertation, Universitv of Washington. Deot. of Computer Science & Engineer& August 1>91. Tech&al kep&t No. 91-08-04. Google ScholarDigital Library
- Griswold 93.W. G. Griswold. Direct update of dataflow representations forameaning-preserviogprogmmrestmctmingtool.InACMSIGSOFT '93 Symposium on the Foundationsof Sofnare Engineering, pages 42- 55, December 1993. Google ScholarDigital Library
- Griswold et al 96.W. G. Griswold, M. I. Chen, R. W. Bowdidge, and J. D. Morgentbaler. Tool suppoxt for planning the restructuring of data &&actions in large systems. In ACMSIGSOFT '96Symposium on Ihe Foundations of Sofnyare Engineering, October 1996. To appear. Google ScholarDigital Library
- Kiczales 94.G. K&ales. why black boxes are so hard to reuse: A new approach to abstraction for the engineering of software. Videotape. Selections from OOPSLA '94, 1994. See also http://www.parc.xerox.com/spl/projects/oi/.Google Scholar
- Kiczales 96.G. K&ales. Beyond the black box: Open implementation. IEEE Software 13(1):8-l 1. January 1996. Google ScholarDigital Library
- Malan & Wentzel 93.R. A. Malanqd K. Wentzel. Economics of software reuse revisited. In Proceedings of the 3rd Irvine Sofnvare Symposium, pages 109-121.April 1993.Google Scholar
- Morgenthaler & Griswold 95.J. D. Momentbaler and W. G. Griswold. &gram analysis for pra&al pro& restructuring. In Proceedings of the ICSE-I7 Workshon on Pronram Tranrformations for Sofhvare oZution. 1995. Tech. keport G95-418, &partmeni of Cokputer Science and Engineering, University of California, San Diego.Google Scholar
- Muller et al 92.H. A. Muller, S. R. Tiiey, M. A. Orgon. B. D. Conie. and N. H. Madhavji. A reverse engineering environment based on spatial and visual software interconnection models. In Proceedingsof the SIG- SOFT '92 Ffth Symposium on Sofhvare Development Environments, December 1992. Google ScholarDigital Library
- Murphy 96.G. C. Murphy. Lightweight Structural Summarization as an Aid fo Soffware Evolution. PhD dissertation. Universitv of Washmpton. Department of Computer Science & Eogiot&g. Ju?; 1996. - . Google ScholarDigital Library
- Murphy et al 95.G. C. Murphy, D. Notkin, and K. Sullivan. Software reflexion models: bridging tbe gap between source and high-level models. In ACM SIGSOFT '95 Symposium on the Foundations of Sofnvare Engineering, pages 18-28, October 1995. Google ScholarDigital Library
- Parnas 72.D. L. Pamas. On the criteria to be used in decomposing systems into modules. Communications of the ACM, 15(12):1053-1058, December 1972. Google ScholarDigital Library
- Parnas 76.D. L. Pamas. On the design and development of program families. IEEETransactionsonSoJwareEngineering.2(1):1-9,March 1976.Google Scholar
- petroski 94.H. Petroski. Design Paradigms: Case Histories of Error and Judgment in Engineering. Cambridge University Press, Cambridge, England, 1994.Google Scholar
- Sullivan & Notkin 92.K. J. Sullivan and D. Notkio. Reconciling environment integration and component independence. ACM Transactions on Software Engineering and Methodology, 1(3):229-268. July 1992. Google ScholarDigital Library
- Sullivan 94.K. J. Sullivan. Mediafors: Easing ihe Design and Evolution of Integrated Systems. PhD dissertation, University of Washington, Dept. of Computer Science & Engineering, August 1994. Google ScholarDigital Library
Index Terms
- Just-in-time architecture: planning software in an uncertain world
Recommendations
Just-in-time single-batch-processing machine scheduling
Highlights- A generalized single-batch-processing machine scheduling problem is studied
- The ...
AbstractIn this paper, we study a single-batch-processing machine (SBPM) scheduling problem by considering a just-in-time criterion. Our objective is to minimize the total weighted earliness and tardiness (WET) penalties of jobs, where the ...
Non-approximability of just-in-time scheduling
We consider the following single machine just-in-time scheduling problem with earliness and tardiness costs: Given n jobs with processing times, due dates and job weights, the task is to schedule these jobs without preemption on a single machine such ...
A quadratic time algorithm to maximize the number of just-in-time jobs on identical parallel machines
Articles presented at the conference on routing and location (CORAL)In this paper, we study a scheduling problem on identical parallel machines, in which a processing time and a due date are given for each job, and the objective is to maximize the number of just-in-time jobs. A job is called just-in-time if it is ...
Comments