Foundations for Software Configuration Management Policies Using Graph Transformations
Lecture notes in computer sciencePublished 1 January 2000Open access
Francesco Parisi-Presicce, Alexander L. Wolf
Citations9
SJR quartileQ2
SJR score0.35
SNIP0.55
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
This work introduces a formal foundation for specifying configuration management policies by viewing the policies in terms of graph transformation systems, and can, for the first time, describe formal properties of the relationship between policies.
Abstract
Existing software configuration management systems embody a wide variety of policies for how artifacts can evolve. New policies continue to be introduced. Without a clean separation of configuration management policies from configuration management mechanisms, it is difficult to understand the policies as well as difficult to reason about how they relate. We introduce a formal foundation for specifying configuration management policies by viewing the policies in terms of graph transformation systems. Not only are we able to precisely capture the semantics of individual policies, we can, for the first time, describe formal properties of the relationship between policies.
Keywords
Computer ScienceBusiness, Management and Accounting
Software Practice and ExperienceRcs — a system for version control
950 Citations1985Walter F. Tichy
Basic version control concepts are introduced and the practice of version control using RCS is discussed, and usage statistics show that RCS's delta method is space and time efficient.
IEEE Transactions on Software EngineeringThe source code control system
706 Citations1975Marc Rochkind
The SCCS approach to source code control is discussed, how it is used and explained is shown and how the system is implemented is explained.
ACM Computing SurveysVersion models for software configuration management
580 Citations1998Reidar Conradi, Bernhard Westfechtel
This article provides an overview and classification of different versioning paradigms and defines and relates fundamental concepts such as revisions, variants, configurations, and changes and focuses on intensional versioning.
Lecture notes in computer scienceTheory and Application of Graph Transformations
111 Citations2000Hartmut Ehrig, Gregor Engels +2 more
CVS II: Parallelizing Software Dev elopment
91 Citations1998Brian Berliner, Mark Dabling
The program described in this paper fills a need in the UNIX community for a freely available tool to manage software revision and release control in a multi-developer, multi-directory,multi-group environment.
International Conference on Software EngineeringConfiguration management with logical structures
53 Citations1996Yijing Lin, Steven P. Reiss
Lecture notes in computer scienceSpatial and temporal refinement of typed graph transformation systems
28 Citations1998Martin Große–Rhode, Francesco Parisi-Presicce +1 more
This paper investigates two kinds of refinement relations for graph transformation systems in order to support the development of a module concept forgraph transformation systems.
International Journal of Software Engineering and Knowledge EngineeringA GRAPH-BASED SYSTEM FOR MANAGING CONFIGURATIONS OF ENGINEERING DESIGN DOCUMENTS
24 Citations1996Bernhard Westfechtel
The CoMa model integrates composition hierarchies, dependencies, and versions into a coherent framework based on a sparse set of essential configuration management concepts, and is defined in a high-level, multi-paradigm specification language (PROGRES) which combines concepts from various disciplines.
Lecture notes in computer scienceTransformations of graph grammars
23 Citations1996Francesco Parisi-Presicce
The notion of multilevel graph representations, where parts of graphs are not visible and the information can be restored via the explicit application of productions, and the corresponding extension of the classical double pushout approach is generalized to the algebraic theory of graph grammars.
Lecture notes in computer scienceRefinements of Graph Transformation Systems via Rule Expressions
19 Citations2000Martin Große–Rhode, Francesco Parisi Presicce +1 more
A refinement of a graph transformation system is given by associating with each of its rules a composition of rules of a refining system, that has the same visible effect as the original rule.
A graph transform model for configuration management environments
17 Citations1988Dennis Heimbigner, Steven Krane
A model for software configuration management that subsumes several existing systems that is patterned after compiler models in which programs are transformed by multiple phases ending in an executable program is described.
A Reusable, Distributed Repository for Configuration Management Policy Programming
13 Citations1998André van der Hoek, Antonio Carzaniga +2 more
The repository model and its interface are described, their implementation in NUCM is discussed, and how NUCM has been used to implement several, rather different, configuration management policies are presented.
Electronic Notes in Theoretical Computer ScienceA Compositional Approach to Structuring and Refinement of Typed Graph Grammars
12 Citations1995Andrea Corradini, Reiko Heckel
Colimits (pushouts) are used to model composition and (reverse) graph grammar morphisms to describe refinements of typed graph grammars to preserve the structure of a composed grammar and common subgrammars is shown to be compatible with the semantics.
ACM SIGSOFT Software Engineering NotesA graph transform model for configuration management environments
4 Citations1988Dennis Heimbigner, Steven Krane