Loop Unravelling: A Practical Tool in Proving Program Correctness. - Arthur G. Duncan; Lawrence Yelowitz (Inf. Process. Lett., 1975)

Abstractions, instantiations, and proofs of marking algorithms. - Lawrence Yelowitz; Arthur G. Duncan (Artificial Intelligence and Programming Languages, 1977)

Studies in Abstract/Concrete Mappings in Proving Algorithm Correctness. - Arthur G. Duncan; Lawrence Yelowitz (ICALP, 1979)

Using Ada for industrial embedded microprocessor applications. - Arthur G. Duncan; John S. Hutchison (SIGPLAN, 1980)

Using Attributed Grammars to Test Designs and Implementations. - Arthur G. Duncan; John S. Hutchison (ICSE, 1981)

Using Ada for industrial embedded microprocessor applications, II. - Arthur G. Duncan; John S. Hutchison (AdaTEC Conference on Ada, 1982)

Prototyping in ADA: a case study. - Arthur G. Duncan (Rapid Prototyping, 1982)

Communication System Design Using Ada. - Arthur G. Duncan; John S. Hutchison; John W. Bailey; T. M. Chapman; A. Fregly; Elizabeth Kruesi; T. McDonald; D. Merrill; Sylvia B. Sheppard (ICSE, 1984)

Implementing Internal Program Representations with Ada and Ada 9X. - Arthur G. Duncan (TRI-Ada, 1994)

Conversion to Ada and Ada 95: A Software Re-engineering Approach. - Arthur G. Duncan (TRI-Ada Tutorials, 1995)

Reusable Ada Libraries Supporting Infinite Data Structures. - Arthur G. Duncan (SIGAda, 1998)