On Synthesizing Systolic Arrays from Recurrence Equations with Linear Dependencies. - Sanjay V. Rajopadhye; S. Purushothaman; Richard Fujimoto (FSTTCS, 1986)

Reasoning About Modular Systolic Algorithms. - S. Purushothaman (ICPP, 1987)

Reasoning About Probabilistic Behavior in Concurrent Systems. - S. Purushothaman; P. A. Subrahmanyam (IEEE Trans. Software Eng., 1987)

Reasoning about Systolic Algorithms. - S. Purushothaman; P. A. Subrahmanyam (J. Parallel Distributed Comput., 1988)

Analysis of communicating processes for non-progress. - Wuxu Peng; S. Purushothaman (ICDCS, 1989)

Towards Dataflow Analysis of Communicating Finite State Machines. - Wuxu Peng; S. Purushothaman (PODC, 1989)

Mechanical Certification of Systolic Algorithms. - S. Purushothaman; P. A. Subrahmanyam (J. Autom. Reason., 1989)

A Unified Approach to the Deadlock Detection Problem in Networks of Communicating Finite State Machines. - Wuxu Peng; S. Purushothaman (CAV, 1990)

A Compositional Analysis of Evaluation-Order and Its Application. - M. Draghicescu; S. Purushothaman (LISP and Functional Programming, 1990)

Data Flow Analysis of Communicating Finite State Machines. - Wuxu Peng; S. Purushothaman (ACM Trans. Program. Lang. Syst., 1991)

Empty Stack Pushdown Omega-Tree Automata. - Wuxu Peng; S. Purushothaman (CAAP, 1992)

An Adequate Operational Semantics for Sharing in Lazy Evaluation. - S. Purushothaman; Jill Seaman (ESOP, 1992)

Analysis of a Class of Communicating Finite State Machines. - Wuxu Peng; S. Purushothaman (Acta Informatica, 1992)

5 Programming languages and systems. - S. Purushothaman; Jill Seaman (Computational Statistics, 1993)

Experiments in Data flow analysis of Communicating Finite State Machines. - S. Purushothaman Iyer (FORTE, 1993)

From Operational Definitions to Abstract Semantics. - S. Purushothaman; Jill Seaman (FPCA, 1993)

Book Review: Nets, Terms and Formulas . By E.-R. Olderog. (Cambridge University Press, 1991 . x+267pp. ISBN 0-521-40044-9 . $49.95). - S. Purushothaman (SIGACT News, 1993)

A Uniform Treatment of Order of Evalaution and Aggregate Update. - M. Draghicescu; S. Purushothaman (Theor. Comput. Sci., 1993)

Duplication, Insertion and Lossiness Errors in Unreliable Communication Channels. - Gérard Cécé; Alain Finkel; S. Purushothaman Iyer (SIGSOFT FSE, 1994)

An Improved Type-Inference Algorithm to Expose Parallelism in Object-Oriented Programs. - Sandeep Kumar; Dharma P. Agrawal; S. Purushothaman Iyer (LCR, 1995)

Optimality in Abstractions of Model Checking - Rance Cleaveland; S. Purushothaman Iyer; Daniel Yankelevich (SAS, 1995)

A New Typee of Pushdown Automata on Infinite Trees. - Wuxu Peng; S. Purushothaman Iyer (Int. J. Found. Comput. Sci., 1995)

Unreliable Channels are Easier to Verify Than Perfect Channels. - Gérard Cécé; Alain Finkel; S. Purushothaman Iyer (Inf. Comput., 1996)

An Operational Semantics of Sharing in Lazy Evaluation. - Jill Seaman; S. Purushothaman Iyer (Sci. Comput. Program., 1996)

Probabilistic Lossy Channel Systems. - S. Purushothaman Iyer; Murali Narasimha (TAPSOFT, 1997)

The role of observations in probabilistic open systems. - Murali Narasimha; Rance Cleaveland; S. Purushothaman Iyer (Monterey Workshop, 1998)

Unfoldings of Unbounded Petri Nets. - Parosh Aziz Abdulla; S. Purushothaman Iyer; Aletta Nylén (CAV, 2000)

Reasoning about Probabilistic Lossy Channel Systems. - Parosh Aziz Abdulla; Christel Baier; S. Purushothaman Iyer; Bengt Jonsson 001 (CONCUR, 2000)

Well-Abstracted Transition Systems. - Alain Finkel; S. Purushothaman Iyer; Grégoire Sutre (CONCUR, 2000)

Branching-Time Probalistic Model Checking. - Rance Cleaveland; S. Purushothaman Iyer (ICALP Satellite Workshops, 2000)

C Wolf - A Toolset for Extracting Models from C Programs. - Daniel C. DuVarney; S. Purushothaman Iyer (FORTE, 2002)

Towards fast solid state DNA sequencing. - S. Purushothaman; Christofer Toumazou; Julius Georgiou (ISCAS (4), 2002)

Well-abstracted transition systems: application to FIFO automata. - Alain Finkel; S. Purushothaman Iyer; Grégoire Sutre (Inf. Comput., 2003)

SAT-Solving the Coverability Problem for Petri Nets. - Parosh Aziz Abdulla; S. Purushothaman Iyer; Aletta Nylén (Formal Methods Syst. Des., 2004)

Introductory paper. - S. Purushothaman Iyer; David Hislop; Paul L. Jones; Jaime Lee; Frederick Pearce; Stephen Van Albert (Int. J. Softw. Tools Technol. Transf., 2004)

A case study on applying formal methods to medical devices: computer-aided resuscitation algorithm. - Raoul Praful Jetley; Cohan Carlos; S. Purushothaman Iyer (Int. J. Softw. Tools Technol. Transf., 2004)

An Approach to Unfolding Asynchronous Communication Protocols. - Yu Lei 001; S. Purushothaman Iyer (FM, 2005)

Simulating perfect channels with probabilistic lossy channels. - Parosh Aziz Abdulla; Christel Baier; S. Purushothaman Iyer; Bengt Jonsson 001 (Inf. Comput., 2005)

Probabilistic temporal logics via the modal mu-calculus. - Rance Cleaveland; S. Purushothaman Iyer; Murali Narasimha (Theor. Comput. Sci., 2005)

A Formal Approach to Pre-Market Review for Medical Device Software. - Raoul Praful Jetley; S. Purushothaman Iyer; Paul L. Jones; William Spees (COMPSAC (1), 2006)

Using Abstraction-driven Slicing for Postmortem Analysis of Software. - Raoul Praful Jetley; Yi Zhang 051; S. Purushothaman Iyer (ICPC, 2006)

A Formal Methods Approach to Medical Device Review. - Raoul Praful Jetley; S. Purushothaman Iyer; Paul L. Jones (Computer, 2006)

Analyzing network traffic to detect self-decrypting exploit code. - Qinghua Zhang; Douglas S. Reeves; Peng Ning; S. Purushothaman Iyer (AsiaCCS, 2007)

Error Report Driven Post-Mortem Analysis. - Yi Zhang 051; S. Purushothaman Iyer (ICPC, 2007)

Application of polynomial vector (pv) processing to improve the estimation performance of bio diesel in variable compression ratio diesel engine - M. Suresh; Maheswar Dutta; S. Purushothaman (CoRR, 2013)