

<?xml version="1.0" encoding="UTF-8"?>
<record>
  <title>VDM Specification of an Algorithm for Graph Decomposition</title>
  <journal>Journal of Digital Information Management</journal>
  <author>Abdul Huq,Narayanan T. Ramachandran</author>
  <volume>5</volume>
  <issue>6</issue>
  <year>2007</year>
  <doi></doi>
  <url>http://www.dirf.org/jdim/v5n6a1.asp</url>
  <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.</abstract>
</record>
