Abstracting dependencies between software configuration items

ABSTRACT

This paper studies an abstract model of dependencies between software configuration items based on a theory of concurrent computation over a class of Petri nets. The primary goal is to illustrate the descriptive power of the model and lay theoretical groundwork for using it to design software configuration maintenance tools or model software configurations. As a start in this direction, the paper analyzes and addresses certain limitations in make description files using a form of abstract interpretation.

REFERENCES

• 1: Matthias Blume. CM: A Compilation Manager for SML/NJ. User Manual.
• 2: Andrei Broder. Some applications of Rabin's fingerprinting method. In R. M. Capocelli et. al., editor, Sequences II: Methods in Communication, Security, and Computer Science. Sprinter-Verlag, 1991.
• 3: G. L. Burn, C. Hankin, and S. Abramsky. Strictness analysis for higher-order functions. Science of Computer Programming, 7:249-278, 1986.
• 4: Stuart I. Feldman. Make-a program for maintaining computer programs. Software Practice and Experience, 9:255- 265, 1979.
• 5: G. Fowler, A case for make, Software—Practice & Experience, v.20 n.S1, p.35-46, June 1990 [doi>10.1002/spe.4380201305]
• 6: Christine B. Hanna and Roy Levin. The Vesta language for configuration management. Technical Report 107, Digital Systems Research Center, 1993.
• 7: Butler W. Lampson , Eric E. Schmidt, Practical use of a polymorphic applicative language, Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.237-255, January 24-26, 1983, Austin, Texas [doi>10.1145/567067.567090]
• 8: Roy Levin and Paul R. McJones. The Vesta approach to precise configuration of large software systems. Technical Report 105, Digital Systems Research Center, 1993.
• 9: D. E. Perry, Version control in the Inscape environment, Proceedings of the 9th international conference on Software Engineering, p.142-149, March 1987, Monterey, California, United States
• 10: Benjamin C. Pierce. Programming in the pi-calculus: An experiment in programming language design. Tutorial notes on the Pict language. Available electronically, 1995,
• 11: Benjamin C. Pierce, Concurrent Objects in a Process Calculus, Proceedings of the International Workshop on Theory and Practice of Parallel Programming, p.187-215, November 07-09, 1994
• 12: Benjamin C. Pierce and David N. Turner. Pict: A programming language based on the pi-calculus. To appear, 1995.
• 13: Robert W. Schwanke , Gail E. Kaiser, Smarter recompilation, ACM Transactions on Programming Languages and Systems (TOPLAS), v.10 n.4, p.627-632, Oct. 1988 [doi>10.1145/48022.214505]
• 14: Zhong Shao , Andrew W. Appel, Smartest recompilation, Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.439-450, March 1993, Charleston, South Carolina, United States [doi>10.1145/158511.158702]
• 15: Walter F. Tichy, Smart recompilation, ACM Transactions on Programming Languages and Systems (TOPLAS), v.8 n.3, p.273-291, July 1986 [doi>10.1145/5956.5959]
• 16: Andreas Zeller, A unified version model for configuration management, ACM SIGSOFT Software Engineering Notes, v.20 n.4, p.151-160, Oct. 1995

INDEX TERMS

Primary Classification:
  D. Software
  D.2 SOFTWARE ENGINEERING
      D.2.9 Management
          Subjects: Software configuration management

Additional Classification:
  D. Software
  D.1 PROGRAMMING TECHNIQUES
  D.2 SOFTWARE ENGINEERING
  D.3 PROGRAMMING LANGUAGES
      D.3.3 Language Constructs and Features
          Subjects: Concurrent programming structures

  G. Mathematics of Computing
  G.2 DISCRETE MATHEMATICS

  I. Computing Methodologies
  I.6 SIMULATION AND MODELING
      I.6.8 Types of Simulation
          Subjects: Parallel

General Terms:
Algorithms, Design, Languages, Management, Theory, Verification