VDM Specification of an Algorithm for Graph Decomposition.
Journal of Digital Information Management 2007, Dec, 5, 6
-
- $5.99
-
- $5.99
Publisher Description
ABSTRACT: Complex software systems need a precise specification of their intended behaviour. While graph theory plays an important role in several aspects of building such software systems, formal methods provide a rigorous mathematical framework within which a system can be described. In this paper, an algorithm for decomposing a graph into disjoint paths is presented. Such decompositions are useful, particularly in implementing software testing. VDM representation of the proposed algorithm facilitates automation of testing process without any ambiguity. Categories and Subject Descriptors
More Books Like This
More Books by Journal of Digital Information Management
A Model to Predict Whether an Online RPG Makes Gamers Loyal.
2003
Collaborative Information Searching in an Information-Intensive Work Domain: Preliminary Results.
2004
The City in Four Dimensions: The Nu.M.E. Project.
2004
T-Stem--a Superior Stemmer and Temporal Extractor for Arabic Texts.
2005
Semantic Notation and Retrieval in Art and Architecture Image Collections.
2005
Cluster Based Mixed Coding Schemes for Inverted File Index Compression.
2008