Neelam Soundararajan

According to our database, Neelam Soundararajan authored at least 12 papers between 1979 and 1988.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

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

Responsive sequential processes.

Neelam Soundararajan, Roger L. Costello

ACM SIGPLAN Notices, 1988

A Proof System for Distributed Processes.

Ann E. Kelley Sobel, Neelam Soundararajan

Acta Informatica, 1988

1987

Proof Rules for Fault Tolerant Distributed Programs.

Mathai Joseph, Abha Moitra, Neelam Soundararajan

Sci. Comput. Program., 1987

Complexity in Classificatory Reasoning.

Ashok K. Goel, Neelam Soundararajan, B. Chandrasekaran

Proceedings of the 6th National Conference on Artificial Intelligence. Seattle, 1987

1986

Total Correctness of CSP Programs.

Neelam Soundararajan

Acta Informatica, 1986

1985

: Distributed Discrete Event Simulation using Dataflow.

V. Ashok, Neelam Soundararajan, Roger L. Costello

Proceedings of the International Conference on Parallel Processing, 1985

1984

Axiomatic Semantics of Communicating Sequential Processes.

Neelam Soundararajan

ACM Trans. Program. Lang. Syst., 1984

Denotational Semantics of CSP.

Neelam Soundararajan

Theor. Comput. Sci., 1984

A proof technique for parallel programs.

Neelam Soundararajan

Theor. Comput. Sci., 1984

1983

Correctness Proofs of CSP Programs.

Neelam Soundararajan

Theor. Comput. Sci., 1983

1979

Axiomatic Proofs of Fotal Correctness of Programs.

Neelam Soundararajan

Inf. Process. Lett., 1979