| |
| 1984 | ||
|---|---|---|
| 10 | Lawrence Yelowitz: Practical Experience with an Ada-Based Formal Specification/Language on a Large Project. IEEE Symposium on Security and Privacy 1984: 111-113 | |
| 1982 | ||
| 9 | Lawrence Yelowitz, Susan L. Gerhart, G. Hilborn: Modeling a Network Protocol in AFFIRM and Ada. PSTV 1982: 435-450 | |
| 1979 | ||
| 8 | Arthur G. Duncan, Lawrence Yelowitz: Studies in Abstract/Concrete Mappings in Proving Algorithm Correctness. ICALP 1979: 218-229 | |
| 1978 | ||
| 7 | Lawrence Yelowitz: Arthur G. Duncan: Data Structures and Program Correctness: Bridging the Gap. Comput. Lang. 3(2): 135-142 (1978) | |
| 1976 | ||
| 6 | Susan L. Gerhart, Lawrence Yelowitz: Control Structure Abstractions of the Backtracking Programming Technique (Abstract). ICSE 1976: 391 | |
| 5 | Lawrence Yelowitz, Abraham Kandel: New Results and Techniques in Resolution Theory. IEEE Trans. Computers 25(7): 673-677 (1976) | |
| 4 | Susan L. Gerhart, Lawrence Yelowitz: Observations of Fallibility in Applications of Modern Programming Methodologies. IEEE Trans. Software Eng. 2(3): 195-207 (1976) | |
| 3 | Susan L. Gerhart, Lawrence Yelowitz: Control Structure Abstractions of the Backtracking Programming Technique. IEEE Trans. Software Eng. 2(4): 285-292 (1976) | |
| 1975 | ||
| 2 | Arthur G. Duncan, Lawrence Yelowitz: Loop Unravelling: A Practical Tool in Proving Program Correctness. Inf. Process. Lett. 4(3): 70-72 (1975) | |
| 1 | EE | Lawrence Yelowitz: Derivation of a Path-Connectivity Matrix for Tagged Flowcharts. J. ACM 22(1): 145-154 (1975) |
| 1 | Arthur G. Duncan | [2] [8] |
| 2 | Susan L. Gerhart | [3] [4] [6] [9] |
| 3 | G. Hilborn | [9] |
| 4 | Abraham Kandel | [5] |