A New Definition-Use Net Generator for Ada 2012 Programs

Definition-Use Net (DUN) is a graph-theoretical concurrent program representation that is very useful in software development activities such as program dependence analysis, testing, debugging, and complexity measuring. It is an arc-classified digraph having vertices representing information about definitions and/or uses of the values of variables, and inter-process synchronization and communication, and arcs representing deterministic or nondeterministic control ows between vertices. For capturing Definition-Use Nets for Ada 2012 programs, we developed an Asis-based DUN generator for Ada 2012 programs. This article presents an informal explanation for DUNs of Ada 2012 programs and shows some example DUNs of Ada 2012 programs generated by our DUN generator

[1]  Jingde Cheng,et al.  Complexity metrics for distributed programs , 1993, Proceedings of 1993 IEEE International Symposium on Software Reliability Engineering.

[2]  John Barnes,et al.  Ada 2012 Rationale , 2013, Lecture Notes in Computer Science.

[3]  John Barnes,et al.  Programming in ADA , 1989 .

[4]  Jingde Cheng.  Task Dependence Net as a Representation for Concurrent Ada Programs , 1992, Ada-Europe.

[5]  Jingde Cheng,et al.  Task dependence nets for concurrent systems with Ada 95 and its applications , 1997, TRI-Ada '97.

[6]  Joe D. Warren,et al.  The program dependence graph and its use in optimization , 1984, TOPL.

[7]  Jingde Cheng,et al.  A System Dependence Net generator for Ada programs , 1999, Proceedings Sixth Asia Pacific Software Engineering Conference (ASPEC'99) (Cat. No.PR00509).

[8]  Jingde Cheng.  Nondeterministic Parallel Control-Flow / Definition-Use Nets and their Applications , 1993, PARCO.

[9]  Jingde Cheng,et al.  Process dependence net of distributed programs and its applications in development of distributed systems , 1993, Proceedings of 1993 IEEE 17th International Computer Software and Applications Conference COMPSAC '93.

[10]  David W. Binkley,et al.  Interprocedural slicing using dependence graphs , 1988, SIGP.