Axiomatic Proofs of Fotal Correctness of Programs. - Neelam Soundararajan (Inf. Process. Lett., 1979)

Correctness Proofs of CSP Programs. - Neelam Soundararajan (Theor. Comput. Sci., 1983)

A proof technique for parallel programs. - Neelam Soundararajan (Theor. Comput. Sci., 1984)

Denotational Semantics of CSP. - Neelam Soundararajan (Theor. Comput. Sci., 1984)

Axiomatic Semantics of Communicating Sequential Processes. - Neelam Soundararajan (ACM Trans. Program. Lang. Syst., 1984)

: Distributed Discrete Event Simulation using Dataflow. - V. Ashok; Neelam Soundararajan; Roger L. Costello (ICPP, 1985)

Total Correctness of CSP Programs. - Neelam Soundararajan (Acta Informatica, 1986)

Complexity in Classificatory Reasoning. - Ashok K. Goel 001; Neelam Soundararajan; B. Chandrasekaran 001 (AAAI, 1987)

Proof Rules for Fault Tolerant Distributed Programs. - Mathai Joseph; Abha Moitra; Neelam Soundararajan (Sci. Comput. Program., 1987)

A Proof System for Distributed Processes. - Ann E. Kelley Sobel; Neelam Soundararajan (Acta Informatica, 1988)

Responsive sequential processes. - Neelam Soundararajan; Roger L. Costello (ACM SIGPLAN Notices, 1988)

A Distributed Deadlock Detection and Resolution Algorithm and Its Correctness Proof. - Ahmed K. Elmagarmid; Neelam Soundararajan; Ming T. Liu (IEEE Trans. Software Eng., 1988)