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

Derivation of a Path-Connectivity Matrix for Tagged Flowcharts. - Lawrence Yelowitz (J. ACM, 1975)

Control Structure Abstractions of the Backtracking Programming Technique (Abstract). - Susan L. Gerhart; Lawrence Yelowitz (ICSE, 1976)

New Results and Techniques in Resolution Theory. - Lawrence Yelowitz; Abraham Kandel (IEEE Trans. Computers, 1976)

Observations of Fallibility in Applications of Modern Programming Methodologies. - Susan L. Gerhart; Lawrence Yelowitz (IEEE Trans. Software Eng., 1976)

Control Structure Abstractions of the Backtracking Programming Technique. - Susan L. Gerhart; Lawrence Yelowitz (IEEE Trans. Software Eng., 1976)

An Efficient Algorithm for Constructing Hierarchical Graphs. - Lawrence Yelowitz (IEEE Trans. Syst. Man Cybern., 1976)

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

A project approach to structure and correctness in Pitt's second computer science course. - Lawrence Yelowitz (SIGCSE, 1978)

Arthur G. Duncan: Data Structures and Program Correctness: Bridging the Gap. - Lawrence Yelowitz (Comput. Lang., 1978)

Notes on "A note on the transitive closure of a boolean matrix". - Lawrence Yelowitz (SIGACT News, 1978)

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

FACC activities/positions in methodology, verification, and trusted systems. - Lawrence Yelowitz (ACM SIGSOFT Softw. Eng. Notes, 1981)

Modeling a Network Protocol in AFFIRM and Ada. - Lawrence Yelowitz; Susan L. Gerhart; G. Hilborn (PSTV, 1982)

Practical Experience with an Ada-Based Formal Specification/Language on a Large Project. - Lawrence Yelowitz (S&P, 1984)