IEEE Transactions on Software Engineering (TSE), Volume 7

Volume 7, Number 1, January 1981

• Robert Balzer, Thomas E. Cheatham Jr.: Editorial: Program Transformations. 1-2
• Robert Balzer:
  Transformational Implementation: An Example. 3-14
  
• Manfred Broy, Peter Pepper:
  Program Development as a Formal Activity. 14-23
  
• Edith Deak:
  A Transformational Derivation of a Parsing Algorithm in a High-Level Language. 23-31
  
• David S. Wile:
  Type Transformations. 32-39
  

• James Arthur, Jayashree Ramanathan:
  Design of Analyzers for Selective Program Analysis. 39-51
  
• Keith L. Clark, Maarten H. van Emden:
  Consequence Verification of Flowcharts. 52-60
  
• L. Howard Holley, Barry K. Rosen:
  Qualified Data Flow Problems. 60-78
  

• Edward G. Coffman Jr., Erol Gelenbe, Brigitte Plateau:
  Optimization of the Number of Copies in a Distributed Data Base. 78-84
  
• Peter A. Ng:
  Further Analysis of the Entity-Relationship Approach to Database Design. 85-99
  
• Sabah S. Al-Fedaghi, Peter Scheuermann:
  Mapping Considerations in the Design of Schemas for the Relational Model. 99-111
  
• B. Srinivasan, R. Sankar:
  Algorithms to Distribute a Database for Parallel Searching. 112
  

• Robert L. Budzinski, Edward S. Davidson, Wataru Mayeda, Harold S. Stone:
  DMIN: An Algorithm for Computing the Optimal Dynamic Allocation in a Virtual Memory Computer. 113-121
  
• Robert L. Budzinski, Edward S. Davidson:
  A Comparison of Dynamic and Static Virtual Memory Allocation Algorithms. 122-131
  
• Paolo Sipala:
  Optimum Cell Size for the Storage of Messages. 132-134
  
• Alan Jay Smith:
  Internal Scheduling and Memory Contention. 135-146
  

• Joe W. Duran, John J. Wiorkowski:
  Capture-Recaptur Sampling for Estimating Software Error Content. 147-148
  

Volume 7, Number 2, March 1981

• Robert L. Glass:
  Persistent Software Errors. 162-168
  
• Douglas Comer:
  Principles of Program Design Induced from Experience with Small Public Programs. 169-174
  
• Bernard Lint, Tilak Agerwala:
  Communication Issues in the Design and Analysis of Parallel Algorithms. 174-188
  
• Derek Coleman, Jane W. Hughes, Malcolm S. Powell:
  A Method for the Syntax Directed Design of Multiprograms. 189-196
  
• Hamed A. Ellozy:
  The Determination of Loop Invariants for Programs with Arrays. 197-206
  
• Nachum Dershowitz, Zohar Manna:
  Inference Rules for Program Annotation. 207-222
  
• Edward M. Reingold, John S. Tilford:
  Tidier Drawings of Trees. 223-228
  
• Phyllis Reisner:
  Formal Grammar and Human Factors Design of an Interactive Graphics System. 229-240
  
• Richard Sanford, J. Gibson:
  simplifld alfu-n2merik fOnetiks (sanf). 241-248
  
• Takeshi Chusho, Toshihiro Hayashi:
  Performance Analyses of Paging Algorithms for Compilation of a Highly Modularized Program. 248-254
  
• Geoffrey C. Goldbogen:
  PRIM: A Fast Matrix Transpose Method. 255-257
  

Volume 7, Number 3, May 1981

• Perng-Yi Richard Ma, Ted G. Lewis:
  On the Design of a Microcode Compiler for a Machine-Independent High-Level Language. 261-274
  
• Charles Wetherell, Alfred Shannon:
  LR - Automatic Parser Generator and LR(1) Parser. 274-278
  
• George K. Papakonstantinou:
  An Interpreter of Attribute Grammars and Its Application to Waveform Analysis. 279-284
  
• Jo-Mei Chang, King-sun Fu:
  Extended K-d Tree Database Organization: A Dynamic Multiattribute Clustering Method. 284-290
  
• Raymond M. Bryant:
  On Homogeneity and On-Line=Off-Line Behavior in M/G/1 Queueing Systems. 291-299
  
• Victor R. Basili, Robert W. Reiter Jr.:
  A Controlled Experiment Quantitatively Comparing Software Development Approaches. 299-320
  
• Alexandre Brandwajn, Jean-Alain Hernandez:
  A Study of a Mechanism for Controlling Multiprogammed Memory in an Interactive System. 321-331
  

Volume 7, Number 4, July 1981

• Richard H. Thayer, Arthur B. Pyster, Roger C. Wood:
  Major Issues in Software Engineering Project Management. 333-342
  
• David E. Peercy:
  A Software Maintainability Evaluation Methodology. 343-351
  
• Andrew Singer, Henry F. Ledgard, Jon F. Hueras:
  The Annotated Assistant: A Step Towards Human Engineering. 353-374
  
• Geneviève Jomier:
  A Mathematical Model for the Comparison of Static and Dynamic Memory Allocation in a Paged System. 375-385
  
• Lionel M. Ni, Kai Hwang:
  Performance Modeling of Shared-Resource Array Processors. 386-394
  
• Harry G. Perros:
  A Symmetrical Exponential Open Queue Network with Blocking and Feedback. 395-402
  
• Alan Jay Smith:
  Analysis of Long Term File Reference Patterns for Application to File Migration Algorithms. 403-417
  
• Jayadev Misra, K. Mani Chandy:
  Proofs of Networks of Processes. 417-426
  
• Stephen S. Yau, Chen-Chau Yang, Sol M. Shatz:
  An Approach to Distributed Computing System Software Design. 427-436
  
• Santosh K. Shrivastava:
  Structuring Distributed Systems for Recoverability and Crash Resistance. 436-447
  
• Paul R. Eggert:
  Runtime Checking for ISO Standard Pascal. 447-448
  

Volume 7, Number 5, September 1981

• David R. Barstow, Howard E. Shrobe:
  Guest Editorial: Programming Environments. 449-450
  
• James W. Goodwin:
  Why Programming Environments Need Dynamic Data Types. 451-457
  
• Elaine Kant, David R. Barstow:
  The Refinement Paradigm: The Interaction of Coding and Efficiency Knowledge in Program Synthesis. 458-471
  
• Raul Medina-Mora, Peter H. Feiler:
  An Incremental Programming Environment. 472-482
  
• Barry W. Boehm:
  An Experiment in Small-Scale Application Software Engineering. 482-493
  
• Volkmar H. Haase:
  Real-Time Behavior of Programs. 494-501
  
• Joep L. W. Kessels:
  The Soma: A Programming Construct for Distributed Processing. 502-509
  
• Sallie M. Henry, Dennis G. Kafura:
  Software Structure Metrics Based on Information Flow. 510-518
  
• Andrzej Blikle:
  On the Development of Correct Specified Programs. 519-527
  

Volume 7, Number 6, November 1981

• Stephen W. Smoliar:
  Operational Requirements Accommodation in Distributed System Design. 531-537
  
• C. V. Ramamoorthy, Yu-King R. Mok, Farokh B. Bastani, Gene H. Chin, Keiichi Suzuki:
  Application of a Methodology for the Development and Validation of Reliable Process Control Software. 537-555
  
• Stephen S. Yau, Paul C. Grabow:
  A Model for Representing Programs Using Hierarchical Graphs. 556-574
  
• Kapali P. Eswaran, V. Carl Hamacher, Gerald S. Shedler:
  Collision-Free Access Control for Computer Communication Bus Networks. 574-582
  
• Shahid H. Bokhari:
  A Shortest Tree Algorithm for Optimal Assignments Across Space and Time in a Distributed Processor System. 583-589
  
• Robert L. Baber:
  A Method for Representing Data Items of Unlimited Length in a Computer Memory. 590-593, (Comments: IEEE Trans. Software Eng. 8(6): 620-621(1982))
  
• Allan L. Mennie, Glenn H. MacEwen:
  Information Flow Certification Using an Intermediate Code Program Representation. 594-607, (Correction: IEEE Trans. Software Eng. 8(4): 446(1982))
  
• Peter A. Lee, J. L. Lloyd, Santosh K. Shrivastava:
  Some Critical Comments on the Paper "An Optimal Approach to Fault Tolerant Software Systems Design" by Gannon and Shapiro. 608-610, (see: IEEE Trans. Software Eng. 4(5): 390-409(1978))
  
• Thomas F. Gannon, Stephen D. Shapiro:
  Comments on the Critique of Lee, Lloyd, and Shrivastava. 610-611
  

Last update Fri May 24 20:57:55 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page